/usr/bin/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 --traceabstraction.assert.codeblocks.term.scoring.heuristic NUM_FUNCTIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 --traceabstraction.trace.refinement.strategy CAMEL_SMT_AM -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_10-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-19 23:03:42,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-19 23:03:42,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-19 23:03:42,548 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-19 23:03:42,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-19 23:03:42,550 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-19 23:03:42,551 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-19 23:03:42,553 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-19 23:03:42,555 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-19 23:03:42,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-19 23:03:42,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-19 23:03:42,557 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-19 23:03:42,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-19 23:03:42,559 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-19 23:03:42,560 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-19 23:03:42,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-19 23:03:42,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-19 23:03:42,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-19 23:03:42,565 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-19 23:03:42,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-19 23:03:42,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-19 23:03:42,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-19 23:03:42,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-19 23:03:42,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-19 23:03:42,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-19 23:03:42,575 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-19 23:03:42,575 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-19 23:03:42,576 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-19 23:03:42,576 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-19 23:03:42,577 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-19 23:03:42,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-19 23:03:42,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-19 23:03:42,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-19 23:03:42,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-19 23:03:42,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-19 23:03:42,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-19 23:03:42,582 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-19 23:03:42,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-19 23:03:42,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-19 23:03:42,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-19 23:03:42,584 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-19 23:03:42,585 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 [2020-07-19 23:03:42,607 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-19 23:03:42,607 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-19 23:03:42,608 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-19 23:03:42,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-19 23:03:42,609 INFO L138 SettingsManager]: * Use SBE=true [2020-07-19 23:03:42,609 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-19 23:03:42,609 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-19 23:03:42,609 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-19 23:03:42,610 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-19 23:03:42,610 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-19 23:03:42,610 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-19 23:03:42,611 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-19 23:03:42,611 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-19 23:03:42,611 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-19 23:03:42,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-19 23:03:42,612 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-19 23:03:42,612 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-19 23:03:42,612 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-19 23:03:42,612 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-19 23:03:42,613 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-19 23:03:42,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-19 23:03:42,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-19 23:03:42,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-19 23:03:42,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-19 23:03:42,614 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-19 23:03:42,614 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-19 23:03:42,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-19 23:03:42,615 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-19 23:03:42,615 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-19 23:03:42,615 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> NUM_FUNCTIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_SMT_AM [2020-07-19 23:03:42,876 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-19 23:03:42,891 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-19 23:03:42,895 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-19 23:03:42,896 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-19 23:03:42,899 INFO L275 PluginConnector]: CDTParser initialized [2020-07-19 23:03:42,900 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_10-2.c [2020-07-19 23:03:42,969 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ce2de36/db0271d3157f42d3810e21b043d8e447/FLAG24eba8917 [2020-07-19 23:03:43,428 INFO L306 CDTParser]: Found 1 translation units. [2020-07-19 23:03:43,429 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_10-2.c [2020-07-19 23:03:43,436 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ce2de36/db0271d3157f42d3810e21b043d8e447/FLAG24eba8917 [2020-07-19 23:03:43,807 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ce2de36/db0271d3157f42d3810e21b043d8e447 [2020-07-19 23:03:43,820 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-19 23:03:43,823 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-19 23:03:43,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-19 23:03:43,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-19 23:03:43,828 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-19 23:03:43,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:03:43" (1/1) ... [2020-07-19 23:03:43,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@441f1685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:43, skipping insertion in model container [2020-07-19 23:03:43,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:03:43" (1/1) ... [2020-07-19 23:03:43,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-19 23:03:43,861 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-19 23:03:44,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-19 23:03:44,032 INFO L203 MainTranslator]: Completed pre-run [2020-07-19 23:03:44,049 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-19 23:03:44,064 INFO L208 MainTranslator]: Completed translation [2020-07-19 23:03:44,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:44 WrapperNode [2020-07-19 23:03:44,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-19 23:03:44,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-19 23:03:44,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-19 23:03:44,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-19 23:03:44,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:44" (1/1) ... [2020-07-19 23:03:44,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:44" (1/1) ... [2020-07-19 23:03:44,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:44" (1/1) ... [2020-07-19 23:03:44,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:44" (1/1) ... [2020-07-19 23:03:44,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:44" (1/1) ... [2020-07-19 23:03:44,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:44" (1/1) ... [2020-07-19 23:03:44,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:44" (1/1) ... [2020-07-19 23:03:44,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-19 23:03:44,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-19 23:03:44,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-19 23:03:44,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-19 23:03:44,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:44" (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 [2020-07-19 23:03:44,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-19 23:03:44,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-19 23:03:44,262 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-19 23:03:44,262 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-19 23:03:44,262 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-19 23:03:44,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-19 23:03:44,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-19 23:03:44,263 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-19 23:03:44,263 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-19 23:03:44,263 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-19 23:03:44,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-19 23:03:44,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-19 23:03:44,464 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-19 23:03:44,465 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-19 23:03:44,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:03:44 BoogieIcfgContainer [2020-07-19 23:03:44,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-19 23:03:44,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-19 23:03:44,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-19 23:03:44,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-19 23:03:44,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:03:43" (1/3) ... [2020-07-19 23:03:44,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65186038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:03:44, skipping insertion in model container [2020-07-19 23:03:44,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:03:44" (2/3) ... [2020-07-19 23:03:44,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65186038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:03:44, skipping insertion in model container [2020-07-19 23:03:44,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:03:44" (3/3) ... [2020-07-19 23:03:44,479 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10-2.c [2020-07-19 23:03:44,489 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-19 23:03:44,495 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-19 23:03:44,509 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-19 23:03:44,535 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-19 23:03:44,535 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-19 23:03:44,535 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-19 23:03:44,535 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-19 23:03:44,535 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-19 23:03:44,536 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-19 23:03:44,536 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-19 23:03:44,536 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-19 23:03:44,556 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-19 23:03:44,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-19 23:03:44,564 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:03:44,565 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 23:03:44,565 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:03:44,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:03:44,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2020-07-19 23:03:44,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:03:44,581 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030796114] [2020-07-19 23:03:44,582 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@67dfe06e [2020-07-19 23:03:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:44,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 23:03:44,870 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030796114] [2020-07-19 23:03:44,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:03:44,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-19 23:03:44,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42541102] [2020-07-19 23:03:44,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-19 23:03:44,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:03:44,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-19 23:03:44,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-19 23:03:44,899 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-07-19 23:03:45,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:03:45,004 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-19 23:03:45,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-19 23:03:45,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-19 23:03:45,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:03:45,020 INFO L225 Difference]: With dead ends: 44 [2020-07-19 23:03:45,021 INFO L226 Difference]: Without dead ends: 30 [2020-07-19 23:03:45,025 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-19 23:03:45,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-19 23:03:45,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-19 23:03:45,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-19 23:03:45,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-19 23:03:45,082 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2020-07-19 23:03:45,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:03:45,083 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-19 23:03:45,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-19 23:03:45,083 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-19 23:03:45,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-19 23:03:45,085 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:03:45,086 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 23:03:45,086 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-19 23:03:45,087 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:03:45,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:03:45,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2020-07-19 23:03:45,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:03:45,088 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768239235] [2020-07-19 23:03:45,089 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@67dfe06e [2020-07-19 23:03:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:45,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 23:03:45,156 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768239235] [2020-07-19 23:03:45,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 23:03:45,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-19 23:03:45,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63254205] [2020-07-19 23:03:45,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-19 23:03:45,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:03:45,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-19 23:03:45,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-19 23:03:45,160 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2020-07-19 23:03:45,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:03:45,228 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-07-19 23:03:45,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-19 23:03:45,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-19 23:03:45,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:03:45,231 INFO L225 Difference]: With dead ends: 36 [2020-07-19 23:03:45,231 INFO L226 Difference]: Without dead ends: 32 [2020-07-19 23:03:45,233 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-19 23:03:45,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-19 23:03:45,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-19 23:03:45,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-19 23:03:45,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-19 23:03:45,250 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2020-07-19 23:03:45,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:03:45,251 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-19 23:03:45,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-19 23:03:45,252 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-19 23:03:45,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-19 23:03:45,255 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:03:45,256 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 23:03:45,256 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-19 23:03:45,257 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:03:45,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:03:45,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2020-07-19 23:03:45,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:03:45,260 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300004708] [2020-07-19 23:03:45,260 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@67dfe06e [2020-07-19 23:03:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:45,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-19 23:03:45,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300004708] [2020-07-19 23:03:45,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436774406] [2020-07-19 23:03:45,459 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@40045ede No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:03:45,508 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@40045ede issued 3 check-sat command(s) [2020-07-19 23:03:45,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:03:45,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-19 23:03:45,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:03:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-19 23:03:45,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 23:03:45,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-19 23:03:45,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503011291] [2020-07-19 23:03:45,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 23:03:45,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:03:45,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 23:03:45,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-19 23:03:45,613 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 10 states. [2020-07-19 23:03:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:03:45,840 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2020-07-19 23:03:45,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-19 23:03:45,841 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-19 23:03:45,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:03:45,842 INFO L225 Difference]: With dead ends: 58 [2020-07-19 23:03:45,843 INFO L226 Difference]: Without dead ends: 34 [2020-07-19 23:03:45,844 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-07-19 23:03:45,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-19 23:03:45,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-19 23:03:45,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-19 23:03:45,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-07-19 23:03:45,854 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2020-07-19 23:03:45,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:03:45,854 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-07-19 23:03:45,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 23:03:45,855 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-07-19 23:03:45,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-19 23:03:45,857 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:03:45,857 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-19 23:03:46,071 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-19 23:03:46,072 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:03:46,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:03:46,073 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2020-07-19 23:03:46,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:03:46,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666492821] [2020-07-19 23:03:46,074 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@67dfe06e [2020-07-19 23:03:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:46,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-19 23:03:46,221 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666492821] [2020-07-19 23:03:46,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946101434] [2020-07-19 23:03:46,222 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@426256c4 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:03:46,267 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@426256c4 issued 3 check-sat command(s) [2020-07-19 23:03:46,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:03:46,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-19 23:03:46,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:03:46,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-19 23:03:46,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 23:03:46,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-19 23:03:46,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93876951] [2020-07-19 23:03:46,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-19 23:03:46,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:03:46,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-19 23:03:46,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-19 23:03:46,316 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 9 states. [2020-07-19 23:03:46,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:03:46,508 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-07-19 23:03:46,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-19 23:03:46,509 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-19 23:03:46,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:03:46,515 INFO L225 Difference]: With dead ends: 54 [2020-07-19 23:03:46,515 INFO L226 Difference]: Without dead ends: 50 [2020-07-19 23:03:46,516 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-19 23:03:46,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-19 23:03:46,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2020-07-19 23:03:46,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-19 23:03:46,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2020-07-19 23:03:46,543 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 27 [2020-07-19 23:03:46,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:03:46,545 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2020-07-19 23:03:46,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-19 23:03:46,546 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2020-07-19 23:03:46,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-19 23:03:46,548 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:03:46,548 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2020-07-19 23:03:46,759 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:03:46,760 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:03:46,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:03:46,761 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2020-07-19 23:03:46,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:03:46,762 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181092603] [2020-07-19 23:03:46,762 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@67dfe06e [2020-07-19 23:03:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:46,845 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-19 23:03:46,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181092603] [2020-07-19 23:03:46,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323372322] [2020-07-19 23:03:46,846 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@681d6dd2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:03:46,884 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@681d6dd2 issued 3 check-sat command(s) [2020-07-19 23:03:46,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:03:46,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-19 23:03:46,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:03:46,953 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-19 23:03:46,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 23:03:46,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2020-07-19 23:03:46,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962988344] [2020-07-19 23:03:46,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-19 23:03:46,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:03:46,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-19 23:03:46,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-19 23:03:46,956 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 11 states. [2020-07-19 23:03:47,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:03:47,215 INFO L93 Difference]: Finished difference Result 108 states and 170 transitions. [2020-07-19 23:03:47,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-19 23:03:47,215 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-07-19 23:03:47,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:03:47,218 INFO L225 Difference]: With dead ends: 108 [2020-07-19 23:03:47,218 INFO L226 Difference]: Without dead ends: 66 [2020-07-19 23:03:47,220 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-07-19 23:03:47,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-19 23:03:47,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-07-19 23:03:47,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-19 23:03:47,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2020-07-19 23:03:47,237 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 39 [2020-07-19 23:03:47,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:03:47,238 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2020-07-19 23:03:47,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-19 23:03:47,238 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2020-07-19 23:03:47,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-19 23:03:47,243 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:03:47,243 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2020-07-19 23:03:47,444 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:03:47,445 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:03:47,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:03:47,446 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2020-07-19 23:03:47,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:03:47,447 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898351116] [2020-07-19 23:03:47,447 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@67dfe06e [2020-07-19 23:03:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:47,593 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-19 23:03:47,594 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898351116] [2020-07-19 23:03:47,594 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319731381] [2020-07-19 23:03:47,595 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@22784b73 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:03:47,629 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@22784b73 issued 3 check-sat command(s) [2020-07-19 23:03:47,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:03:47,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-19 23:03:47,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:03:47,699 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-19 23:03:47,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 23:03:47,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-07-19 23:03:47,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670831113] [2020-07-19 23:03:47,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-19 23:03:47,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:03:47,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-19 23:03:47,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-19 23:03:47,701 INFO L87 Difference]: Start difference. First operand 66 states and 95 transitions. Second operand 13 states. [2020-07-19 23:03:48,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:03:48,180 INFO L93 Difference]: Finished difference Result 180 states and 324 transitions. [2020-07-19 23:03:48,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-19 23:03:48,180 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2020-07-19 23:03:48,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:03:48,184 INFO L225 Difference]: With dead ends: 180 [2020-07-19 23:03:48,184 INFO L226 Difference]: Without dead ends: 120 [2020-07-19 23:03:48,187 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2020-07-19 23:03:48,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-07-19 23:03:48,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2020-07-19 23:03:48,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-19 23:03:48,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 169 transitions. [2020-07-19 23:03:48,211 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 169 transitions. Word has length 40 [2020-07-19 23:03:48,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:03:48,211 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 169 transitions. [2020-07-19 23:03:48,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-19 23:03:48,212 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 169 transitions. [2020-07-19 23:03:48,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-19 23:03:48,215 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:03:48,215 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2020-07-19 23:03:48,429 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:03:48,429 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:03:48,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:03:48,430 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2020-07-19 23:03:48,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:03:48,431 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458905036] [2020-07-19 23:03:48,431 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@67dfe06e [2020-07-19 23:03:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:48,564 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-07-19 23:03:48,565 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458905036] [2020-07-19 23:03:48,565 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294497879] [2020-07-19 23:03:48,566 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7ba9589c No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:03:48,628 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7ba9589c issued 3 check-sat command(s) [2020-07-19 23:03:48,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:03:48,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-19 23:03:48,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:03:48,735 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-19 23:03:48,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 23:03:48,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2020-07-19 23:03:48,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867801302] [2020-07-19 23:03:48,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-19 23:03:48,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:03:48,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-19 23:03:48,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-07-19 23:03:48,738 INFO L87 Difference]: Start difference. First operand 106 states and 169 transitions. Second operand 14 states. [2020-07-19 23:03:49,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:03:49,279 INFO L93 Difference]: Finished difference Result 258 states and 498 transitions. [2020-07-19 23:03:49,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-19 23:03:49,279 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2020-07-19 23:03:49,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:03:49,284 INFO L225 Difference]: With dead ends: 258 [2020-07-19 23:03:49,284 INFO L226 Difference]: Without dead ends: 158 [2020-07-19 23:03:49,287 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2020-07-19 23:03:49,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-19 23:03:49,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2020-07-19 23:03:49,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-19 23:03:49,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 180 transitions. [2020-07-19 23:03:49,342 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 180 transitions. Word has length 54 [2020-07-19 23:03:49,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:03:49,343 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 180 transitions. [2020-07-19 23:03:49,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-19 23:03:49,346 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 180 transitions. [2020-07-19 23:03:49,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-07-19 23:03:49,358 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:03:49,359 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 23:03:49,559 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-19 23:03:49,560 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:03:49,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:03:49,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1504181040, now seen corresponding path program 1 times [2020-07-19 23:03:49,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:03:49,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309245527] [2020-07-19 23:03:49,561 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@67dfe06e [2020-07-19 23:03:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:49,755 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 38 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2020-07-19 23:03:49,756 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309245527] [2020-07-19 23:03:49,756 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873952335] [2020-07-19 23:03:49,756 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@9a336fb No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:03:49,808 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@9a336fb issued 3 check-sat command(s) [2020-07-19 23:03:49,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:03:49,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-19 23:03:49,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:03:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 68 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-07-19 23:03:49,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 23:03:49,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-07-19 23:03:49,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760227897] [2020-07-19 23:03:49,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-19 23:03:49,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:03:49,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-19 23:03:49,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-07-19 23:03:49,936 INFO L87 Difference]: Start difference. First operand 112 states and 180 transitions. Second operand 16 states. [2020-07-19 23:03:50,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:03:50,578 INFO L93 Difference]: Finished difference Result 243 states and 465 transitions. [2020-07-19 23:03:50,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-19 23:03:50,593 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 82 [2020-07-19 23:03:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:03:50,595 INFO L225 Difference]: With dead ends: 243 [2020-07-19 23:03:50,595 INFO L226 Difference]: Without dead ends: 110 [2020-07-19 23:03:50,597 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2020-07-19 23:03:50,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-19 23:03:50,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 87. [2020-07-19 23:03:50,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-19 23:03:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2020-07-19 23:03:50,611 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 82 [2020-07-19 23:03:50,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:03:50,612 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2020-07-19 23:03:50,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-19 23:03:50,612 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2020-07-19 23:03:50,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-07-19 23:03:50,614 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:03:50,614 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 23:03:50,829 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:03:50,829 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:03:50,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:03:50,830 INFO L82 PathProgramCache]: Analyzing trace with hash 2095197631, now seen corresponding path program 1 times [2020-07-19 23:03:50,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:03:50,831 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548704328] [2020-07-19 23:03:50,831 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@67dfe06e [2020-07-19 23:03:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 61 proven. 94 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2020-07-19 23:03:51,141 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548704328] [2020-07-19 23:03:51,141 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203469612] [2020-07-19 23:03:51,141 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1d9a6738 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:03:51,191 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1d9a6738 issued 3 check-sat command(s) [2020-07-19 23:03:51,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:03:51,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-19 23:03:51,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:03:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 24 proven. 155 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2020-07-19 23:03:51,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 23:03:51,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2020-07-19 23:03:51,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136515149] [2020-07-19 23:03:51,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-19 23:03:51,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:03:51,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-19 23:03:51,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2020-07-19 23:03:51,332 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand 17 states. [2020-07-19 23:03:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:03:52,011 INFO L93 Difference]: Finished difference Result 217 states and 375 transitions. [2020-07-19 23:03:52,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-19 23:03:52,011 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 123 [2020-07-19 23:03:52,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:03:52,014 INFO L225 Difference]: With dead ends: 217 [2020-07-19 23:03:52,014 INFO L226 Difference]: Without dead ends: 137 [2020-07-19 23:03:52,016 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=872, Unknown=0, NotChecked=0, Total=1056 [2020-07-19 23:03:52,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-07-19 23:03:52,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 117. [2020-07-19 23:03:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-19 23:03:52,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 172 transitions. [2020-07-19 23:03:52,031 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 172 transitions. Word has length 123 [2020-07-19 23:03:52,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:03:52,032 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 172 transitions. [2020-07-19 23:03:52,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-19 23:03:52,032 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 172 transitions. [2020-07-19 23:03:52,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2020-07-19 23:03:52,036 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:03:52,036 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 13, 13, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 23:03:52,251 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:03:52,251 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:03:52,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:03:52,252 INFO L82 PathProgramCache]: Analyzing trace with hash 466415905, now seen corresponding path program 1 times [2020-07-19 23:03:52,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:03:52,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61399742] [2020-07-19 23:03:52,253 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@67dfe06e [2020-07-19 23:03:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:52,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 165 proven. 262 refuted. 0 times theorem prover too weak. 977 trivial. 0 not checked. [2020-07-19 23:03:52,856 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61399742] [2020-07-19 23:03:52,857 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50201418] [2020-07-19 23:03:52,857 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@74ec41de No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:03:52,966 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@74ec41de issued 3 check-sat command(s) [2020-07-19 23:03:52,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:03:52,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-19 23:03:52,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:03:53,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 77 proven. 418 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2020-07-19 23:03:53,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 23:03:53,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2020-07-19 23:03:53,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187551030] [2020-07-19 23:03:53,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-19 23:03:53,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:03:53,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-19 23:03:53,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2020-07-19 23:03:53,156 INFO L87 Difference]: Start difference. First operand 117 states and 172 transitions. Second operand 18 states. [2020-07-19 23:03:53,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:03:53,903 INFO L93 Difference]: Finished difference Result 263 states and 450 transitions. [2020-07-19 23:03:53,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-07-19 23:03:53,903 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 231 [2020-07-19 23:03:53,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:03:53,906 INFO L225 Difference]: With dead ends: 263 [2020-07-19 23:03:53,906 INFO L226 Difference]: Without dead ends: 158 [2020-07-19 23:03:53,908 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=1111, Unknown=0, NotChecked=0, Total=1332 [2020-07-19 23:03:53,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-19 23:03:53,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 148. [2020-07-19 23:03:53,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-07-19 23:03:53,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 227 transitions. [2020-07-19 23:03:53,925 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 227 transitions. Word has length 231 [2020-07-19 23:03:53,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:03:53,926 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 227 transitions. [2020-07-19 23:03:53,926 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-19 23:03:53,926 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 227 transitions. [2020-07-19 23:03:53,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2020-07-19 23:03:53,932 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:03:53,933 INFO L422 BasicCegarLoop]: trace histogram [28, 28, 25, 25, 21, 21, 14, 14, 14, 14, 14, 14, 14, 12, 12, 12, 12, 12, 12, 12, 9, 7, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 23:03:54,146 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-19 23:03:54,147 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:03:54,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:03:54,148 INFO L82 PathProgramCache]: Analyzing trace with hash -80201483, now seen corresponding path program 2 times [2020-07-19 23:03:54,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:03:54,150 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658734709] [2020-07-19 23:03:54,151 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@67dfe06e [2020-07-19 23:03:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3760 backedges. 243 proven. 571 refuted. 0 times theorem prover too weak. 2946 trivial. 0 not checked. [2020-07-19 23:03:55,162 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658734709] [2020-07-19 23:03:55,162 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102111312] [2020-07-19 23:03:55,163 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6d12bbbd No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:03:55,269 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@6d12bbbd issued 3 check-sat command(s) [2020-07-19 23:03:55,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:03:55,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-19 23:03:55,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:03:55,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3760 backedges. 139 proven. 856 refuted. 0 times theorem prover too weak. 2765 trivial. 0 not checked. [2020-07-19 23:03:55,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 23:03:55,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 19 [2020-07-19 23:03:55,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942637581] [2020-07-19 23:03:55,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-19 23:03:55,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:03:55,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-19 23:03:55,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2020-07-19 23:03:55,492 INFO L87 Difference]: Start difference. First operand 148 states and 227 transitions. Second operand 19 states. [2020-07-19 23:03:56,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:03:56,468 INFO L93 Difference]: Finished difference Result 337 states and 597 transitions. [2020-07-19 23:03:56,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-07-19 23:03:56,469 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 367 [2020-07-19 23:03:56,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:03:56,473 INFO L225 Difference]: With dead ends: 337 [2020-07-19 23:03:56,473 INFO L226 Difference]: Without dead ends: 200 [2020-07-19 23:03:56,476 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 470 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=1378, Unknown=0, NotChecked=0, Total=1640 [2020-07-19 23:03:56,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-07-19 23:03:56,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 176. [2020-07-19 23:03:56,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-07-19 23:03:56,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 275 transitions. [2020-07-19 23:03:56,493 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 275 transitions. Word has length 367 [2020-07-19 23:03:56,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:03:56,494 INFO L479 AbstractCegarLoop]: Abstraction has 176 states and 275 transitions. [2020-07-19 23:03:56,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-19 23:03:56,494 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 275 transitions. [2020-07-19 23:03:56,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2020-07-19 23:03:56,508 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:03:56,508 INFO L422 BasicCegarLoop]: trace histogram [42, 42, 39, 39, 34, 32, 21, 21, 21, 21, 21, 21, 21, 19, 19, 19, 19, 19, 19, 19, 15, 11, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 23:03:56,724 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:03:56,724 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:03:56,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:03:56,725 INFO L82 PathProgramCache]: Analyzing trace with hash -495618503, now seen corresponding path program 3 times [2020-07-19 23:03:56,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:03:56,726 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353090686] [2020-07-19 23:03:56,727 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@67dfe06e [2020-07-19 23:03:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:03:58,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8989 backedges. 425 proven. 1461 refuted. 0 times theorem prover too weak. 7103 trivial. 0 not checked. [2020-07-19 23:03:58,242 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353090686] [2020-07-19 23:03:58,242 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051380876] [2020-07-19 23:03:58,242 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@711bdf66 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:03:58,417 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@711bdf66 issued 3 check-sat command(s) [2020-07-19 23:03:58,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:03:58,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 1014 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-19 23:03:58,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:03:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 8989 backedges. 254 proven. 1547 refuted. 0 times theorem prover too weak. 7188 trivial. 0 not checked. [2020-07-19 23:03:58,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 23:03:58,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2020-07-19 23:03:58,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047817361] [2020-07-19 23:03:58,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-19 23:03:58,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:03:58,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-19 23:03:58,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2020-07-19 23:03:58,800 INFO L87 Difference]: Start difference. First operand 176 states and 275 transitions. Second operand 22 states. [2020-07-19 23:04:00,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:04:00,430 INFO L93 Difference]: Finished difference Result 424 states and 800 transitions. [2020-07-19 23:04:00,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-07-19 23:04:00,431 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 559 [2020-07-19 23:04:00,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:04:00,438 INFO L225 Difference]: With dead ends: 424 [2020-07-19 23:04:00,438 INFO L226 Difference]: Without dead ends: 253 [2020-07-19 23:04:00,442 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 772 GetRequests, 718 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=445, Invalid=2635, Unknown=0, NotChecked=0, Total=3080 [2020-07-19 23:04:00,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2020-07-19 23:04:00,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 218. [2020-07-19 23:04:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-07-19 23:04:00,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 360 transitions. [2020-07-19 23:04:00,481 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 360 transitions. Word has length 559 [2020-07-19 23:04:00,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:04:00,482 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 360 transitions. [2020-07-19 23:04:00,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-19 23:04:00,483 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 360 transitions. [2020-07-19 23:04:00,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 845 [2020-07-19 23:04:00,519 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:04:00,520 INFO L422 BasicCegarLoop]: trace histogram [63, 63, 60, 60, 50, 49, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 20, 18, 13, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 23:04:00,733 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:04:00,734 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:04:00,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:04:00,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1928846884, now seen corresponding path program 4 times [2020-07-19 23:04:00,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:04:00,736 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457843671] [2020-07-19 23:04:00,736 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@67dfe06e [2020-07-19 23:04:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:04,212 INFO L134 CoverageAnalysis]: Checked inductivity of 20893 backedges. 3107 proven. 2983 refuted. 0 times theorem prover too weak. 14803 trivial. 0 not checked. [2020-07-19 23:04:04,212 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457843671] [2020-07-19 23:04:04,212 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489138546] [2020-07-19 23:04:04,212 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1e46d23b No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:04:04,458 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@1e46d23b issued 3 check-sat command(s) [2020-07-19 23:04:04,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:04:04,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 1527 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-19 23:04:04,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:04:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 20893 backedges. 700 proven. 1847 refuted. 0 times theorem prover too weak. 18346 trivial. 0 not checked. [2020-07-19 23:04:04,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 23:04:04,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 22 [2020-07-19 23:04:04,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380025720] [2020-07-19 23:04:04,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-19 23:04:04,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:04:04,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-19 23:04:04,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2020-07-19 23:04:04,887 INFO L87 Difference]: Start difference. First operand 218 states and 360 transitions. Second operand 22 states. [2020-07-19 23:04:06,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:04:06,253 INFO L93 Difference]: Finished difference Result 527 states and 957 transitions. [2020-07-19 23:04:06,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2020-07-19 23:04:06,254 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 844 [2020-07-19 23:04:06,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:04:06,259 INFO L225 Difference]: With dead ends: 527 [2020-07-19 23:04:06,260 INFO L226 Difference]: Without dead ends: 323 [2020-07-19 23:04:06,263 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1154 GetRequests, 1101 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=412, Invalid=2558, Unknown=0, NotChecked=0, Total=2970 [2020-07-19 23:04:06,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2020-07-19 23:04:06,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 269. [2020-07-19 23:04:06,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-07-19 23:04:06,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 438 transitions. [2020-07-19 23:04:06,286 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 438 transitions. Word has length 844 [2020-07-19 23:04:06,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:04:06,287 INFO L479 AbstractCegarLoop]: Abstraction has 269 states and 438 transitions. [2020-07-19 23:04:06,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-19 23:04:06,287 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 438 transitions. [2020-07-19 23:04:06,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1581 [2020-07-19 23:04:06,309 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:04:06,310 INFO L422 BasicCegarLoop]: trace histogram [117, 117, 114, 114, 94, 93, 58, 58, 58, 58, 58, 58, 58, 57, 57, 57, 57, 57, 57, 57, 36, 36, 24, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 23:04:06,526 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-19 23:04:06,526 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:04:06,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:04:06,526 INFO L82 PathProgramCache]: Analyzing trace with hash 592452606, now seen corresponding path program 5 times [2020-07-19 23:04:06,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:04:06,527 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447626467] [2020-07-19 23:04:06,527 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@67dfe06e [2020-07-19 23:04:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:14,411 INFO L134 CoverageAnalysis]: Checked inductivity of 74553 backedges. 1235 proven. 6687 refuted. 0 times theorem prover too weak. 66631 trivial. 0 not checked. [2020-07-19 23:04:14,412 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447626467] [2020-07-19 23:04:14,412 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858475719] [2020-07-19 23:04:14,412 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2eac2658 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:04:14,820 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2eac2658 issued 3 check-sat command(s) [2020-07-19 23:04:14,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:04:14,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 2854 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-19 23:04:14,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:04:16,432 INFO L134 CoverageAnalysis]: Checked inductivity of 74553 backedges. 1140 proven. 3811 refuted. 0 times theorem prover too weak. 69602 trivial. 0 not checked. [2020-07-19 23:04:16,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 23:04:16,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 23 [2020-07-19 23:04:16,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130463147] [2020-07-19 23:04:16,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-19 23:04:16,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:04:16,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-19 23:04:16,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2020-07-19 23:04:16,437 INFO L87 Difference]: Start difference. First operand 269 states and 438 transitions. Second operand 23 states. [2020-07-19 23:04:18,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:04:18,074 INFO L93 Difference]: Finished difference Result 588 states and 1018 transitions. [2020-07-19 23:04:18,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2020-07-19 23:04:18,075 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1580 [2020-07-19 23:04:18,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:04:18,080 INFO L225 Difference]: With dead ends: 588 [2020-07-19 23:04:18,080 INFO L226 Difference]: Without dead ends: 333 [2020-07-19 23:04:18,084 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2099 GetRequests, 2041 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=466, Invalid=3074, Unknown=0, NotChecked=0, Total=3540 [2020-07-19 23:04:18,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-07-19 23:04:18,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 235. [2020-07-19 23:04:18,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2020-07-19 23:04:18,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 350 transitions. [2020-07-19 23:04:18,105 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 350 transitions. Word has length 1580 [2020-07-19 23:04:18,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:04:18,106 INFO L479 AbstractCegarLoop]: Abstraction has 235 states and 350 transitions. [2020-07-19 23:04:18,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-19 23:04:18,106 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 350 transitions. [2020-07-19 23:04:18,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-07-19 23:04:18,119 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:04:18,120 INFO L422 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 72, 71, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 28, 27, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 23:04:18,335 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-19 23:04:18,335 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:04:18,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:04:18,336 INFO L82 PathProgramCache]: Analyzing trace with hash -729387691, now seen corresponding path program 6 times [2020-07-19 23:04:18,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:04:18,337 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882398442] [2020-07-19 23:04:18,338 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@67dfe06e [2020-07-19 23:04:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:23,505 INFO L134 CoverageAnalysis]: Checked inductivity of 43585 backedges. 1068 proven. 5166 refuted. 0 times theorem prover too weak. 37351 trivial. 0 not checked. [2020-07-19 23:04:23,505 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882398442] [2020-07-19 23:04:23,505 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79202902] [2020-07-19 23:04:23,505 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f06fdc9 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:04:23,830 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2f06fdc9 issued 3 check-sat command(s) [2020-07-19 23:04:23,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:04:23,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 2189 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-19 23:04:23,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:04:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 43585 backedges. 1122 proven. 3556 refuted. 0 times theorem prover too weak. 38907 trivial. 0 not checked. [2020-07-19 23:04:24,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 23:04:24,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 25 [2020-07-19 23:04:24,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881274892] [2020-07-19 23:04:24,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-19 23:04:24,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:04:24,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-19 23:04:24,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2020-07-19 23:04:24,482 INFO L87 Difference]: Start difference. First operand 235 states and 350 transitions. Second operand 25 states. [2020-07-19 23:04:26,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:04:26,360 INFO L93 Difference]: Finished difference Result 596 states and 1035 transitions. [2020-07-19 23:04:26,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-07-19 23:04:26,361 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1212 [2020-07-19 23:04:26,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:04:26,366 INFO L225 Difference]: With dead ends: 596 [2020-07-19 23:04:26,366 INFO L226 Difference]: Without dead ends: 295 [2020-07-19 23:04:26,373 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1622 GetRequests, 1564 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=439, Invalid=3101, Unknown=0, NotChecked=0, Total=3540 [2020-07-19 23:04:26,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-07-19 23:04:26,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 229. [2020-07-19 23:04:26,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-07-19 23:04:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 327 transitions. [2020-07-19 23:04:26,399 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 327 transitions. Word has length 1212 [2020-07-19 23:04:26,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:04:26,400 INFO L479 AbstractCegarLoop]: Abstraction has 229 states and 327 transitions. [2020-07-19 23:04:26,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-19 23:04:26,401 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 327 transitions. [2020-07-19 23:04:26,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1485 [2020-07-19 23:04:26,435 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:04:26,436 INFO L422 BasicCegarLoop]: trace histogram [112, 112, 105, 105, 88, 87, 56, 56, 56, 56, 56, 56, 56, 52, 52, 52, 52, 52, 52, 52, 36, 31, 24, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 23:04:26,650 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-07-19 23:04:26,651 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:04:26,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:04:26,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1417705215, now seen corresponding path program 7 times [2020-07-19 23:04:26,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:04:26,653 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444445813] [2020-07-19 23:04:26,653 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@67dfe06e [2020-07-19 23:04:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 23:04:32,294 INFO L134 CoverageAnalysis]: Checked inductivity of 65737 backedges. 2657 proven. 7504 refuted. 0 times theorem prover too weak. 55576 trivial. 0 not checked. [2020-07-19 23:04:32,295 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444445813] [2020-07-19 23:04:32,295 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927881942] [2020-07-19 23:04:32,295 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4b718506 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:04:32,744 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4b718506 issued 4 check-sat command(s) [2020-07-19 23:04:32,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-19 23:04:32,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 3297 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-19 23:04:32,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 23:04:33,658 INFO L134 CoverageAnalysis]: Checked inductivity of 65737 backedges. 1674 proven. 2366 refuted. 0 times theorem prover too weak. 61697 trivial. 0 not checked. [2020-07-19 23:04:33,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 23:04:33,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 12] total 30 [2020-07-19 23:04:33,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860838069] [2020-07-19 23:04:33,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-07-19 23:04:33,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-19 23:04:33,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-07-19 23:04:33,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2020-07-19 23:04:33,662 INFO L87 Difference]: Start difference. First operand 229 states and 327 transitions. Second operand 30 states. [2020-07-19 23:04:36,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 23:04:36,693 INFO L93 Difference]: Finished difference Result 549 states and 849 transitions. [2020-07-19 23:04:36,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2020-07-19 23:04:36,694 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1484 [2020-07-19 23:04:36,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 23:04:36,698 INFO L225 Difference]: With dead ends: 549 [2020-07-19 23:04:36,698 INFO L226 Difference]: Without dead ends: 317 [2020-07-19 23:04:36,704 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2009 GetRequests, 1917 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2609 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=998, Invalid=7744, Unknown=0, NotChecked=0, Total=8742 [2020-07-19 23:04:36,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-07-19 23:04:36,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 257. [2020-07-19 23:04:36,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2020-07-19 23:04:36,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 347 transitions. [2020-07-19 23:04:36,722 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 347 transitions. Word has length 1484 [2020-07-19 23:04:36,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 23:04:36,724 INFO L479 AbstractCegarLoop]: Abstraction has 257 states and 347 transitions. [2020-07-19 23:04:36,724 INFO L480 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-07-19 23:04:36,724 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 347 transitions. [2020-07-19 23:04:36,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-07-19 23:04:36,738 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 23:04:36,738 INFO L422 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 72, 71, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 28, 27, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 23:04:36,951 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 23:04:36,952 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 23:04:36,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 23:04:36,952 INFO L82 PathProgramCache]: Analyzing trace with hash 416823031, now seen corresponding path program 8 times [2020-07-19 23:04:36,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-19 23:04:36,953 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570420870] [2020-07-19 23:04:36,953 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@67dfe06e [2020-07-19 23:04:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-19 23:04:37,394 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-19 23:04:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-19 23:04:37,664 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-19 23:04:37,745 INFO L174 FreeRefinementEngine]: Strategy CAMEL_SMT_AM found a feasible trace [2020-07-19 23:04:37,745 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-19 23:04:37,745 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-19 23:04:37,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 11:04:37 BoogieIcfgContainer [2020-07-19 23:04:37,991 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-19 23:04:37,999 INFO L168 Benchmark]: Toolchain (without parser) took 54172.47 ms. Allocated memory was 145.2 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 102.2 MB in the beginning and 2.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 544.3 MB. Max. memory is 7.1 GB. [2020-07-19 23:04:38,000 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 120.1 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-19 23:04:38,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.61 ms. Allocated memory is still 145.2 MB. Free memory was 101.8 MB in the beginning and 92.1 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-19 23:04:38,008 INFO L168 Benchmark]: Boogie Preprocessor took 28.90 ms. Allocated memory is still 145.2 MB. Free memory was 92.1 MB in the beginning and 90.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-19 23:04:38,008 INFO L168 Benchmark]: RCFGBuilder took 376.07 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 90.7 MB in the beginning and 169.9 MB in the end (delta: -79.2 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-19 23:04:38,011 INFO L168 Benchmark]: TraceAbstraction took 53520.00 ms. Allocated memory was 203.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 169.2 MB in the beginning and 2.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 553.1 MB. Max. memory is 7.1 GB. [2020-07-19 23:04:38,017 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 120.1 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 240.61 ms. Allocated memory is still 145.2 MB. Free memory was 101.8 MB in the beginning and 92.1 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.90 ms. Allocated memory is still 145.2 MB. Free memory was 92.1 MB in the beginning and 90.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 376.07 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 90.7 MB in the beginning and 169.9 MB in the end (delta: -79.2 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 53520.00 ms. Allocated memory was 203.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 169.2 MB in the beginning and 2.2 GB in the end (delta: -2.0 GB). Peak memory consumption was 553.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 10; VAL [x=10] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=9] [L18] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L20] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L18] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L20] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=9, fibo1(n-1)=21, n=9] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=9, fibo1(n-1)=21, fibo1(n-2)=13, n=9] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=10, fibo2(n-1)=34, n=10] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=8] [L18] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L20] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=7, fibo2(n-1)=8, n=7] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=7, fibo2(n-1)=8, fibo2(n-2)=5, n=7] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=8, fibo1(n-1)=13, n=8] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=8, fibo1(n-1)=13, fibo1(n-2)=8, n=8] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=10, fibo2(n-1)=34, fibo2(n-2)=21, n=10] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=55, x=10] [L37] int result = fibo1(x); [L38] COND TRUE result == 55 VAL [result=55, x=10] [L39] __VERIFIER_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 53.2s, OverallIterations: 17, TraceHistogramMax: 117, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 612 SDtfs, 1287 SDslu, 4974 SDs, 0 SdLazy, 10357 SolverSat, 1604 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9160 GetRequests, 8624 SyntacticMatches, 0 SemanticMatches, 536 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6619 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=269occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 456 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 28.5s InterpolantComputationTime, 14575 NumberOfCodeBlocks, 13288 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 13333 ConstructedInterpolants, 0 QuantifiedInterpolants, 16856079 SizeOfPredicates, 96 NumberOfNonLiveVariables, 12706 ConjunctsInSsa, 192 ConjunctsInUnsatCore, 30 InterpolantComputations, 2 PerfectInterpolantSequences, 399554/439008 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...