java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem19_label19.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 23:03:24,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 23:03:24,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 23:03:24,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 23:03:24,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 23:03:24,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 23:03:24,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 23:03:24,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 23:03:24,859 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 23:03:24,860 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 23:03:24,861 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 23:03:24,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 23:03:24,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 23:03:24,863 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 23:03:24,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 23:03:24,865 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 23:03:24,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 23:03:24,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 23:03:24,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 23:03:24,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 23:03:24,872 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 23:03:24,873 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 23:03:24,874 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 23:03:24,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 23:03:24,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 23:03:24,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 23:03:24,881 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 23:03:24,882 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 23:03:24,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 23:03:24,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 23:03:24,885 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 23:03:24,885 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 23:03:24,887 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 23:03:24,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 23:03:24,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 23:03:24,890 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 23:03:24,891 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 23:03:24,891 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 23:03:24,891 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 23:03:24,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 23:03:24,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 23:03:24,898 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 23:03:24,926 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 23:03:24,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 23:03:24,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 23:03:24,928 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 23:03:24,929 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 23:03:24,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 23:03:24,929 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 23:03:24,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 23:03:24,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 23:03:24,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 23:03:24,931 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 23:03:24,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 23:03:24,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 23:03:24,932 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 23:03:24,932 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 23:03:24,932 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 23:03:24,932 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 23:03:24,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 23:03:24,933 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 23:03:24,933 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 23:03:24,933 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 23:03:24,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 23:03:24,934 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 23:03:24,934 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 23:03:24,934 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 23:03:24,934 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 23:03:24,934 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 23:03:24,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 23:03:24,935 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 23:03:24,982 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 23:03:24,995 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 23:03:24,998 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 23:03:25,000 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 23:03:25,000 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 23:03:25,001 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem19_label19.c [2019-09-07 23:03:25,077 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1e462a3a/dc11519f28a140e38251b7201407c2ff/FLAG7caba1a40 [2019-09-07 23:03:26,042 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 23:03:26,043 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem19_label19.c [2019-09-07 23:03:26,094 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1e462a3a/dc11519f28a140e38251b7201407c2ff/FLAG7caba1a40 [2019-09-07 23:03:26,580 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1e462a3a/dc11519f28a140e38251b7201407c2ff [2019-09-07 23:03:26,593 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 23:03:26,595 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 23:03:26,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 23:03:26,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 23:03:26,600 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 23:03:26,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:03:26" (1/1) ... [2019-09-07 23:03:26,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1af94a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:03:26, skipping insertion in model container [2019-09-07 23:03:26,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:03:26" (1/1) ... [2019-09-07 23:03:26,612 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 23:03:26,865 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 23:03:29,074 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 23:03:29,086 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 23:03:30,216 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 23:03:30,268 INFO L192 MainTranslator]: Completed translation [2019-09-07 23:03:30,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:03:30 WrapperNode [2019-09-07 23:03:30,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 23:03:30,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 23:03:30,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 23:03:30,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 23:03:30,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:03:30" (1/1) ... [2019-09-07 23:03:30,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:03:30" (1/1) ... [2019-09-07 23:03:30,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:03:30" (1/1) ... [2019-09-07 23:03:30,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:03:30" (1/1) ... [2019-09-07 23:03:30,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:03:30" (1/1) ... [2019-09-07 23:03:30,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:03:30" (1/1) ... [2019-09-07 23:03:30,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:03:30" (1/1) ... [2019-09-07 23:03:30,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 23:03:30,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 23:03:30,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 23:03:30,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 23:03:30,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:03:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 23:03:30,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 23:03:30,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 23:03:30,768 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 23:03:30,768 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 23:03:30,768 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 23:03:30,768 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 23:03:30,768 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output5 [2019-09-07 23:03:30,769 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output6 [2019-09-07 23:03:30,769 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 23:03:30,769 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 23:03:30,769 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 23:03:30,769 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 23:03:30,770 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 23:03:30,770 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output5 [2019-09-07 23:03:30,770 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output6 [2019-09-07 23:03:30,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 23:03:30,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 23:03:30,771 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 23:03:30,771 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 23:03:30,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 23:03:30,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 23:03:42,362 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 23:03:42,362 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 23:03:42,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:03:42 BoogieIcfgContainer [2019-09-07 23:03:42,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 23:03:42,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 23:03:42,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 23:03:42,371 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 23:03:42,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 11:03:26" (1/3) ... [2019-09-07 23:03:42,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4838cd1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:03:42, skipping insertion in model container [2019-09-07 23:03:42,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:03:30" (2/3) ... [2019-09-07 23:03:42,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4838cd1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:03:42, skipping insertion in model container [2019-09-07 23:03:42,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:03:42" (3/3) ... [2019-09-07 23:03:42,375 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem19_label19.c [2019-09-07 23:03:42,382 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 23:03:42,390 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 23:03:42,406 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 23:03:42,450 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 23:03:42,451 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 23:03:42,451 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 23:03:42,451 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 23:03:42,451 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 23:03:42,451 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 23:03:42,451 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 23:03:42,452 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 23:03:42,452 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 23:03:42,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states. [2019-09-07 23:03:42,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 23:03:42,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:03:42,505 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:03:42,507 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:03:42,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:03:42,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1392046818, now seen corresponding path program 1 times [2019-09-07 23:03:42,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:03:42,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:03:42,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:03:42,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:03:42,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:03:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:03:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:03:42,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:03:42,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:03:42,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:03:42,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:03:42,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:03:42,841 INFO L87 Difference]: Start difference. First operand 1777 states. Second operand 3 states. [2019-09-07 23:03:53,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:03:53,884 INFO L93 Difference]: Finished difference Result 5046 states and 9510 transitions. [2019-09-07 23:03:53,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:03:53,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-07 23:03:53,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:03:53,933 INFO L225 Difference]: With dead ends: 5046 [2019-09-07 23:03:53,934 INFO L226 Difference]: Without dead ends: 3207 [2019-09-07 23:03:53,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:03:53,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2019-09-07 23:03:54,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 3156. [2019-09-07 23:03:54,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3156 states. [2019-09-07 23:03:54,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3156 states to 3156 states and 5827 transitions. [2019-09-07 23:03:54,151 INFO L78 Accepts]: Start accepts. Automaton has 3156 states and 5827 transitions. Word has length 30 [2019-09-07 23:03:54,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:03:54,152 INFO L475 AbstractCegarLoop]: Abstraction has 3156 states and 5827 transitions. [2019-09-07 23:03:54,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:03:54,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3156 states and 5827 transitions. [2019-09-07 23:03:54,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-07 23:03:54,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:03:54,158 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:03:54,158 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:03:54,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:03:54,158 INFO L82 PathProgramCache]: Analyzing trace with hash 553086255, now seen corresponding path program 1 times [2019-09-07 23:03:54,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:03:54,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:03:54,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:03:54,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:03:54,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:03:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:03:54,406 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:03:54,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:03:54,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 23:03:54,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 23:03:54,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 23:03:54,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 23:03:54,409 INFO L87 Difference]: Start difference. First operand 3156 states and 5827 transitions. Second operand 6 states. [2019-09-07 23:04:09,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:04:09,360 INFO L93 Difference]: Finished difference Result 9280 states and 17297 transitions. [2019-09-07 23:04:09,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 23:04:09,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-09-07 23:04:09,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:04:09,402 INFO L225 Difference]: With dead ends: 9280 [2019-09-07 23:04:09,403 INFO L226 Difference]: Without dead ends: 6130 [2019-09-07 23:04:09,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 23:04:09,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6130 states. [2019-09-07 23:04:09,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6130 to 6069. [2019-09-07 23:04:09,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6069 states. [2019-09-07 23:04:09,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6069 states to 6069 states and 10871 transitions. [2019-09-07 23:04:09,615 INFO L78 Accepts]: Start accepts. Automaton has 6069 states and 10871 transitions. Word has length 101 [2019-09-07 23:04:09,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:04:09,616 INFO L475 AbstractCegarLoop]: Abstraction has 6069 states and 10871 transitions. [2019-09-07 23:04:09,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 23:04:09,616 INFO L276 IsEmpty]: Start isEmpty. Operand 6069 states and 10871 transitions. [2019-09-07 23:04:09,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-07 23:04:09,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:04:09,619 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:04:09,619 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:04:09,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:04:09,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1904272445, now seen corresponding path program 1 times [2019-09-07 23:04:09,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:04:09,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:04:09,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:04:09,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:04:09,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:04:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:04:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:04:09,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:04:09,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 23:04:09,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 23:04:09,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 23:04:09,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 23:04:09,789 INFO L87 Difference]: Start difference. First operand 6069 states and 10871 transitions. Second operand 5 states. [2019-09-07 23:04:26,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:04:26,024 INFO L93 Difference]: Finished difference Result 18455 states and 33723 transitions. [2019-09-07 23:04:26,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 23:04:26,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-07 23:04:26,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:04:26,110 INFO L225 Difference]: With dead ends: 18455 [2019-09-07 23:04:26,111 INFO L226 Difference]: Without dead ends: 12392 [2019-09-07 23:04:26,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 23:04:26,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12392 states. [2019-09-07 23:04:26,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12392 to 12116. [2019-09-07 23:04:26,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12116 states. [2019-09-07 23:04:26,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12116 states to 12116 states and 18910 transitions. [2019-09-07 23:04:26,634 INFO L78 Accepts]: Start accepts. Automaton has 12116 states and 18910 transitions. Word has length 103 [2019-09-07 23:04:26,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:04:26,638 INFO L475 AbstractCegarLoop]: Abstraction has 12116 states and 18910 transitions. [2019-09-07 23:04:26,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 23:04:26,639 INFO L276 IsEmpty]: Start isEmpty. Operand 12116 states and 18910 transitions. [2019-09-07 23:04:26,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-07 23:04:26,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:04:26,648 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:04:26,648 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:04:26,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:04:26,652 INFO L82 PathProgramCache]: Analyzing trace with hash -436665375, now seen corresponding path program 1 times [2019-09-07 23:04:26,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:04:26,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:04:26,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:04:26,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:04:26,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:04:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:04:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:04:26,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:04:26,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 23:04:26,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 23:04:26,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 23:04:26,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 23:04:26,817 INFO L87 Difference]: Start difference. First operand 12116 states and 18910 transitions. Second operand 6 states. [2019-09-07 23:04:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:04:40,639 INFO L93 Difference]: Finished difference Result 30458 states and 48769 transitions. [2019-09-07 23:04:40,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 23:04:40,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2019-09-07 23:04:40,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:04:40,702 INFO L225 Difference]: With dead ends: 30458 [2019-09-07 23:04:40,703 INFO L226 Difference]: Without dead ends: 18348 [2019-09-07 23:04:40,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 23:04:40,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18348 states. [2019-09-07 23:04:41,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18348 to 18194. [2019-09-07 23:04:41,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18194 states. [2019-09-07 23:04:41,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18194 states to 18194 states and 27323 transitions. [2019-09-07 23:04:41,169 INFO L78 Accepts]: Start accepts. Automaton has 18194 states and 27323 transitions. Word has length 108 [2019-09-07 23:04:41,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:04:41,170 INFO L475 AbstractCegarLoop]: Abstraction has 18194 states and 27323 transitions. [2019-09-07 23:04:41,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 23:04:41,170 INFO L276 IsEmpty]: Start isEmpty. Operand 18194 states and 27323 transitions. [2019-09-07 23:04:41,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-07 23:04:41,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:04:41,172 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:04:41,173 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:04:41,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:04:41,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1830037864, now seen corresponding path program 1 times [2019-09-07 23:04:41,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:04:41,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:04:41,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:04:41,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:04:41,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:04:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:04:41,318 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:04:41,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:04:41,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 23:04:41,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 23:04:41,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 23:04:41,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 23:04:41,323 INFO L87 Difference]: Start difference. First operand 18194 states and 27323 transitions. Second operand 5 states. [2019-09-07 23:04:57,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:04:57,358 INFO L93 Difference]: Finished difference Result 54570 states and 87197 transitions. [2019-09-07 23:04:57,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 23:04:57,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-09-07 23:04:57,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:04:57,499 INFO L225 Difference]: With dead ends: 54570 [2019-09-07 23:04:57,500 INFO L226 Difference]: Without dead ends: 36382 [2019-09-07 23:04:57,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 23:04:57,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36382 states. [2019-09-07 23:04:58,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36382 to 35220. [2019-09-07 23:04:58,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35220 states. [2019-09-07 23:04:58,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35220 states to 35220 states and 49778 transitions. [2019-09-07 23:04:58,368 INFO L78 Accepts]: Start accepts. Automaton has 35220 states and 49778 transitions. Word has length 158 [2019-09-07 23:04:58,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:04:58,370 INFO L475 AbstractCegarLoop]: Abstraction has 35220 states and 49778 transitions. [2019-09-07 23:04:58,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 23:04:58,370 INFO L276 IsEmpty]: Start isEmpty. Operand 35220 states and 49778 transitions. [2019-09-07 23:04:58,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-07 23:04:58,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:04:58,376 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:04:58,376 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:04:58,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:04:58,377 INFO L82 PathProgramCache]: Analyzing trace with hash 38049613, now seen corresponding path program 1 times [2019-09-07 23:04:58,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:04:58,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:04:58,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:04:58,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:04:58,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:04:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:04:58,821 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:04:58,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:04:58,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 23:04:58,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 23:04:58,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 23:04:58,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 23:04:58,822 INFO L87 Difference]: Start difference. First operand 35220 states and 49778 transitions. Second operand 6 states. [2019-09-07 23:05:11,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:05:11,957 INFO L93 Difference]: Finished difference Result 83156 states and 122536 transitions. [2019-09-07 23:05:11,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 23:05:11,958 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 168 [2019-09-07 23:05:11,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:05:13,651 INFO L225 Difference]: With dead ends: 83156 [2019-09-07 23:05:13,652 INFO L226 Difference]: Without dead ends: 47942 [2019-09-07 23:05:13,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 23:05:13,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47942 states. [2019-09-07 23:05:14,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47942 to 47548. [2019-09-07 23:05:14,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47548 states. [2019-09-07 23:05:14,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47548 states to 47548 states and 65648 transitions. [2019-09-07 23:05:14,595 INFO L78 Accepts]: Start accepts. Automaton has 47548 states and 65648 transitions. Word has length 168 [2019-09-07 23:05:14,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:05:14,596 INFO L475 AbstractCegarLoop]: Abstraction has 47548 states and 65648 transitions. [2019-09-07 23:05:14,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 23:05:14,596 INFO L276 IsEmpty]: Start isEmpty. Operand 47548 states and 65648 transitions. [2019-09-07 23:05:14,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-07 23:05:14,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:05:14,601 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:05:14,601 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:05:14,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:05:14,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1085525974, now seen corresponding path program 1 times [2019-09-07 23:05:14,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:05:14,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:05:14,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:05:14,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:05:14,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:05:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:05:14,763 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 46 proven. 85 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 23:05:14,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:05:14,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:05:14,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:05:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:05:14,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 23:05:14,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:05:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-07 23:05:15,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 23:05:15,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2019-09-07 23:05:15,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 23:05:15,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 23:05:15,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 23:05:15,027 INFO L87 Difference]: Start difference. First operand 47548 states and 65648 transitions. Second operand 7 states. [2019-09-07 23:05:31,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:05:31,927 INFO L93 Difference]: Finished difference Result 141996 states and 205285 transitions. [2019-09-07 23:05:31,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 23:05:31,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 209 [2019-09-07 23:05:31,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:05:32,337 INFO L225 Difference]: With dead ends: 141996 [2019-09-07 23:05:32,337 INFO L226 Difference]: Without dead ends: 94454 [2019-09-07 23:05:32,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-07 23:05:32,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94454 states. [2019-09-07 23:05:35,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94454 to 87170. [2019-09-07 23:05:35,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87170 states. [2019-09-07 23:05:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87170 states to 87170 states and 118115 transitions. [2019-09-07 23:05:35,472 INFO L78 Accepts]: Start accepts. Automaton has 87170 states and 118115 transitions. Word has length 209 [2019-09-07 23:05:35,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:05:35,472 INFO L475 AbstractCegarLoop]: Abstraction has 87170 states and 118115 transitions. [2019-09-07 23:05:35,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 23:05:35,472 INFO L276 IsEmpty]: Start isEmpty. Operand 87170 states and 118115 transitions. [2019-09-07 23:05:35,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 713 [2019-09-07 23:05:35,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:05:35,495 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:05:35,495 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:05:35,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:05:35,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1086254884, now seen corresponding path program 1 times [2019-09-07 23:05:35,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:05:35,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:05:35,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:05:35,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:05:35,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:05:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:05:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 23:05:36,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:05:36,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:05:36,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:05:36,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:05:36,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:05:36,154 INFO L87 Difference]: Start difference. First operand 87170 states and 118115 transitions. Second operand 3 states. [2019-09-07 23:05:49,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:05:49,202 INFO L93 Difference]: Finished difference Result 216993 states and 307654 transitions. [2019-09-07 23:05:49,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:05:49,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 712 [2019-09-07 23:05:49,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:05:49,616 INFO L225 Difference]: With dead ends: 216993 [2019-09-07 23:05:49,616 INFO L226 Difference]: Without dead ends: 129829 [2019-09-07 23:05:49,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:05:49,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129829 states. [2019-09-07 23:05:52,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129829 to 129785. [2019-09-07 23:05:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129785 states. [2019-09-07 23:05:53,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129785 states to 129785 states and 181664 transitions. [2019-09-07 23:05:53,165 INFO L78 Accepts]: Start accepts. Automaton has 129785 states and 181664 transitions. Word has length 712 [2019-09-07 23:05:53,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:05:53,167 INFO L475 AbstractCegarLoop]: Abstraction has 129785 states and 181664 transitions. [2019-09-07 23:05:53,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:05:53,167 INFO L276 IsEmpty]: Start isEmpty. Operand 129785 states and 181664 transitions. [2019-09-07 23:05:53,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2019-09-07 23:05:53,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:05:53,212 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:05:53,212 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:05:53,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:05:53,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1012236860, now seen corresponding path program 1 times [2019-09-07 23:05:53,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:05:53,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:05:53,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:05:53,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:05:53,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:05:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:05:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-09-07 23:05:54,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:05:54,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 23:05:54,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 23:05:54,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 23:05:54,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 23:05:54,269 INFO L87 Difference]: Start difference. First operand 129785 states and 181664 transitions. Second operand 4 states. [2019-09-07 23:06:16,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:06:16,151 INFO L93 Difference]: Finished difference Result 379316 states and 580656 transitions. [2019-09-07 23:06:16,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 23:06:16,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 906 [2019-09-07 23:06:16,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:06:17,302 INFO L225 Difference]: With dead ends: 379316 [2019-09-07 23:06:17,302 INFO L226 Difference]: Without dead ends: 249537 [2019-09-07 23:06:17,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 23:06:17,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249537 states. [2019-09-07 23:06:26,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249537 to 243621. [2019-09-07 23:06:26,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243621 states. [2019-09-07 23:06:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243621 states to 243621 states and 362396 transitions. [2019-09-07 23:06:27,360 INFO L78 Accepts]: Start accepts. Automaton has 243621 states and 362396 transitions. Word has length 906 [2019-09-07 23:06:27,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:06:27,361 INFO L475 AbstractCegarLoop]: Abstraction has 243621 states and 362396 transitions. [2019-09-07 23:06:27,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 23:06:27,361 INFO L276 IsEmpty]: Start isEmpty. Operand 243621 states and 362396 transitions. [2019-09-07 23:06:27,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1196 [2019-09-07 23:06:27,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:06:27,469 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:06:27,469 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:06:27,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:06:27,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1761173251, now seen corresponding path program 1 times [2019-09-07 23:06:27,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:06:27,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:06:27,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:06:27,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:06:27,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:06:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:06:33,387 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 321 proven. 250 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2019-09-07 23:06:33,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:06:33,387 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:06:33,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:06:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:06:33,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 1504 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 23:06:33,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:06:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 830 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-07 23:06:34,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:06:34,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 23:06:34,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 23:06:34,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 23:06:34,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 23:06:34,387 INFO L87 Difference]: Start difference. First operand 243621 states and 362396 transitions. Second operand 9 states. [2019-09-07 23:07:05,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:07:05,709 INFO L93 Difference]: Finished difference Result 688521 states and 1155884 transitions. [2019-09-07 23:07:05,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 23:07:05,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1195 [2019-09-07 23:07:05,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:07:07,814 INFO L225 Difference]: With dead ends: 688521 [2019-09-07 23:07:07,814 INFO L226 Difference]: Without dead ends: 444906 [2019-09-07 23:07:08,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1222 GetRequests, 1204 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-09-07 23:07:08,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444906 states. [2019-09-07 23:07:22,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444906 to 438282. [2019-09-07 23:07:22,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438282 states. [2019-09-07 23:07:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438282 states to 438282 states and 691693 transitions. [2019-09-07 23:07:33,398 INFO L78 Accepts]: Start accepts. Automaton has 438282 states and 691693 transitions. Word has length 1195 [2019-09-07 23:07:33,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:07:33,398 INFO L475 AbstractCegarLoop]: Abstraction has 438282 states and 691693 transitions. [2019-09-07 23:07:33,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 23:07:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 438282 states and 691693 transitions. [2019-09-07 23:07:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1518 [2019-09-07 23:07:33,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:07:33,600 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:07:33,601 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:07:33,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:07:33,602 INFO L82 PathProgramCache]: Analyzing trace with hash 618721467, now seen corresponding path program 1 times [2019-09-07 23:07:33,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:07:33,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:07:33,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:07:33,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:07:33,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:07:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:07:43,481 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 356 proven. 243 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2019-09-07 23:07:43,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:07:43,482 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:07:43,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:07:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:07:43,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 1848 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 23:07:43,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:07:44,991 INFO L134 CoverageAnalysis]: Checked inductivity of 834 backedges. 596 proven. 2 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2019-09-07 23:07:44,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:07:44,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-07 23:07:45,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 23:07:45,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 23:07:45,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-07 23:07:45,000 INFO L87 Difference]: Start difference. First operand 438282 states and 691693 transitions. Second operand 11 states. [2019-09-07 23:08:40,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:08:40,365 INFO L93 Difference]: Finished difference Result 1151257 states and 1897497 transitions. [2019-09-07 23:08:40,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 23:08:40,365 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1517 [2019-09-07 23:08:40,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:08:43,308 INFO L225 Difference]: With dead ends: 1151257 [2019-09-07 23:08:43,309 INFO L226 Difference]: Without dead ends: 712981 [2019-09-07 23:08:45,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1565 GetRequests, 1536 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=660, Unknown=0, NotChecked=0, Total=870 [2019-09-07 23:08:46,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712981 states. [2019-09-07 23:09:11,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712981 to 709792. [2019-09-07 23:09:11,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709792 states. [2019-09-07 23:09:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709792 states to 709792 states and 1012800 transitions. [2019-09-07 23:09:28,695 INFO L78 Accepts]: Start accepts. Automaton has 709792 states and 1012800 transitions. Word has length 1517 [2019-09-07 23:09:28,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:09:28,697 INFO L475 AbstractCegarLoop]: Abstraction has 709792 states and 1012800 transitions. [2019-09-07 23:09:28,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 23:09:28,697 INFO L276 IsEmpty]: Start isEmpty. Operand 709792 states and 1012800 transitions. [2019-09-07 23:09:28,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1378 [2019-09-07 23:09:28,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:09:28,868 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:09:28,869 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:09:28,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:09:28,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1754392776, now seen corresponding path program 1 times [2019-09-07 23:09:28,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:09:28,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:09:28,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:09:28,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:09:28,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:09:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:09:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1298 backedges. 309 proven. 350 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2019-09-07 23:09:41,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:09:41,216 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:09:41,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:09:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:09:41,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 1747 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 23:09:41,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:09:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1298 backedges. 1064 proven. 2 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-09-07 23:09:42,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 23:09:42,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-09-07 23:09:42,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 23:09:42,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 23:09:42,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-09-07 23:09:42,396 INFO L87 Difference]: Start difference. First operand 709792 states and 1012800 transitions. Second operand 16 states. [2019-09-07 23:10:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:10:37,281 INFO L93 Difference]: Finished difference Result 1604745 states and 2348765 transitions. [2019-09-07 23:10:37,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-07 23:10:37,282 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1377 [2019-09-07 23:10:37,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:10:54,211 INFO L225 Difference]: With dead ends: 1604745 [2019-09-07 23:10:54,211 INFO L226 Difference]: Without dead ends: 887351 [2019-09-07 23:10:55,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1518 GetRequests, 1424 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3250 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1505, Invalid=7615, Unknown=0, NotChecked=0, Total=9120 [2019-09-07 23:10:56,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887351 states. [2019-09-07 23:11:24,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887351 to 831578. [2019-09-07 23:11:24,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831578 states. [2019-09-07 23:11:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831578 states to 831578 states and 1178410 transitions. [2019-09-07 23:11:29,215 INFO L78 Accepts]: Start accepts. Automaton has 831578 states and 1178410 transitions. Word has length 1377 [2019-09-07 23:11:29,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:11:29,216 INFO L475 AbstractCegarLoop]: Abstraction has 831578 states and 1178410 transitions. [2019-09-07 23:11:29,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 23:11:29,217 INFO L276 IsEmpty]: Start isEmpty. Operand 831578 states and 1178410 transitions. [2019-09-07 23:11:29,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1695 [2019-09-07 23:11:29,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:11:29,506 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:11:29,506 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:11:29,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:11:29,507 INFO L82 PathProgramCache]: Analyzing trace with hash -662275491, now seen corresponding path program 1 times [2019-09-07 23:11:29,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:11:29,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:11:29,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:11:29,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:11:29,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:11:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:11:43,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 79 proven. 2 refuted. 0 times theorem prover too weak. 976 trivial. 0 not checked. [2019-09-07 23:11:43,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 23:11:43,306 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 23:11:43,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:11:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:11:43,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 2050 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 23:11:43,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 23:11:45,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 623 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2019-09-07 23:11:45,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 23:11:45,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-07 23:11:45,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:11:45,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:11:45,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:11:45,020 INFO L87 Difference]: Start difference. First operand 831578 states and 1178410 transitions. Second operand 3 states. [2019-09-07 23:12:16,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:12:16,764 INFO L93 Difference]: Finished difference Result 1809681 states and 2605517 transitions. [2019-09-07 23:12:16,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:12:16,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1694 [2019-09-07 23:12:16,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:12:22,138 INFO L225 Difference]: With dead ends: 1809681 [2019-09-07 23:12:22,139 INFO L226 Difference]: Without dead ends: 978113 [2019-09-07 23:12:23,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1696 GetRequests, 1695 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:12:24,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978113 states. [2019-09-07 23:12:59,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978113 to 978030. [2019-09-07 23:12:59,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978030 states. [2019-09-07 23:13:21,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978030 states to 978030 states and 1335751 transitions. [2019-09-07 23:13:21,548 INFO L78 Accepts]: Start accepts. Automaton has 978030 states and 1335751 transitions. Word has length 1694 [2019-09-07 23:13:21,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:13:21,549 INFO L475 AbstractCegarLoop]: Abstraction has 978030 states and 1335751 transitions. [2019-09-07 23:13:21,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:13:21,549 INFO L276 IsEmpty]: Start isEmpty. Operand 978030 states and 1335751 transitions. [2019-09-07 23:13:21,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2010 [2019-09-07 23:13:21,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:13:21,835 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:13:21,835 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:13:21,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:13:21,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1330738292, now seen corresponding path program 1 times [2019-09-07 23:13:21,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:13:21,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:13:21,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:13:21,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:13:21,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:13:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat