/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks NOT_INCREMENTALLY -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-20 10:51:01,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 10:51:01,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 10:51:01,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 10:51:01,514 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 10:51:01,515 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 10:51:01,517 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 10:51:01,519 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 10:51:01,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 10:51:01,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 10:51:01,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 10:51:01,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 10:51:01,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 10:51:01,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 10:51:01,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 10:51:01,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 10:51:01,533 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 10:51:01,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 10:51:01,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 10:51:01,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 10:51:01,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 10:51:01,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 10:51:01,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 10:51:01,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 10:51:01,551 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 10:51:01,551 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 10:51:01,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 10:51:01,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 10:51:01,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 10:51:01,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 10:51:01,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 10:51:01,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 10:51:01,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 10:51:01,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 10:51:01,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 10:51:01,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 10:51:01,561 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 10:51:01,562 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 10:51:01,562 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 10:51:01,563 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 10:51:01,564 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 10:51:01,566 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-20 10:51:01,583 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 10:51:01,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 10:51:01,586 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 10:51:01,586 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 10:51:01,587 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 10:51:01,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 10:51:01,587 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 10:51:01,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 10:51:01,588 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 10:51:01,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 10:51:01,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 10:51:01,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 10:51:01,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 10:51:01,589 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 10:51:01,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 10:51:01,589 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 10:51:01,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 10:51:01,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 10:51:01,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 10:51:01,590 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 10:51:01,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 10:51:01,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 10:51:01,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 10:51:01,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 10:51:01,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 10:51:01,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 10:51:01,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:01,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 10:51:01,592 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 10:51:01,592 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> NOT_INCREMENTALLY [2020-07-20 10:51:01,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 10:51:01,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 10:51:01,984 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 10:51:01,986 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 10:51:01,987 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 10:51:01,988 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-07-20 10:51:02,107 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a0a21ff/fe56e99c22b141bcb438b7ae38c94fd0/FLAGb75dad058 [2020-07-20 10:51:02,779 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 10:51:02,780 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-07-20 10:51:02,787 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a0a21ff/fe56e99c22b141bcb438b7ae38c94fd0/FLAGb75dad058 [2020-07-20 10:51:03,130 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a0a21ff/fe56e99c22b141bcb438b7ae38c94fd0 [2020-07-20 10:51:03,142 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 10:51:03,146 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 10:51:03,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 10:51:03,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 10:51:03,152 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 10:51:03,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:51:03" (1/1) ... [2020-07-20 10:51:03,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7808bba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:51:03, skipping insertion in model container [2020-07-20 10:51:03,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:51:03" (1/1) ... [2020-07-20 10:51:03,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 10:51:03,190 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 10:51:03,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 10:51:03,402 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 10:51:03,425 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 10:51:03,450 INFO L208 MainTranslator]: Completed translation [2020-07-20 10:51:03,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:51:03 WrapperNode [2020-07-20 10:51:03,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 10:51:03,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 10:51:03,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 10:51:03,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 10:51:03,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:51:03" (1/1) ... [2020-07-20 10:51:03,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:51:03" (1/1) ... [2020-07-20 10:51:03,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:51:03" (1/1) ... [2020-07-20 10:51:03,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:51:03" (1/1) ... [2020-07-20 10:51:03,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:51:03" (1/1) ... [2020-07-20 10:51:03,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:51:03" (1/1) ... [2020-07-20 10:51:03,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:51:03" (1/1) ... [2020-07-20 10:51:03,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 10:51:03,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 10:51:03,502 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 10:51:03,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 10:51:03,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:51:03" (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-20 10:51:03,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 10:51:03,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 10:51:03,719 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-07-20 10:51:03,719 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 10:51:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 10:51:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 10:51:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-07-20 10:51:03,720 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 10:51:03,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 10:51:03,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 10:51:03,990 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 10:51:03,991 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-20 10:51:03,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:51:03 BoogieIcfgContainer [2020-07-20 10:51:03,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 10:51:03,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 10:51:03,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 10:51:04,001 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 10:51:04,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 10:51:03" (1/3) ... [2020-07-20 10:51:04,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbf7fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:51:04, skipping insertion in model container [2020-07-20 10:51:04,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:51:03" (2/3) ... [2020-07-20 10:51:04,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbf7fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:51:04, skipping insertion in model container [2020-07-20 10:51:04,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:51:03" (3/3) ... [2020-07-20 10:51:04,006 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-07-20 10:51:04,017 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 10:51:04,025 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 10:51:04,039 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 10:51:04,063 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 10:51:04,064 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 10:51:04,064 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 10:51:04,064 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 10:51:04,064 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 10:51:04,065 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 10:51:04,065 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 10:51:04,065 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 10:51:04,082 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-20 10:51:04,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-20 10:51:04,089 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:51:04,090 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:51:04,091 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:51:04,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:51:04,098 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-07-20 10:51:04,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:51:04,108 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [171677810] [2020-07-20 10:51:04,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:51:04,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 10:51:04,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:51:04,296 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-20 10:51:04,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 10:51:04,298 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [171677810] [2020-07-20 10:51:04,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 10:51:04,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 10:51:04,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152242592] [2020-07-20 10:51:04,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 10:51:04,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:51:04,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 10:51:04,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 10:51:04,332 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-07-20 10:51:04,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:51:04,445 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-20 10:51:04,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 10:51:04,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-20 10:51:04,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:51:04,462 INFO L225 Difference]: With dead ends: 35 [2020-07-20 10:51:04,462 INFO L226 Difference]: Without dead ends: 21 [2020-07-20 10:51:04,466 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-20 10:51:04,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-20 10:51:04,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-20 10:51:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-20 10:51:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-20 10:51:04,521 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-20 10:51:04,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:51:04,522 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-20 10:51:04,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 10:51:04,522 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-20 10:51:04,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-20 10:51:04,525 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:51:04,525 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:51:04,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:04,743 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:51:04,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:51:04,745 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-07-20 10:51:04,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:51:04,746 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1400922340] [2020-07-20 10:51:04,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:51:04,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 10:51:04,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:51:04,831 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-20 10:51:04,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 10:51:04,832 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1400922340] [2020-07-20 10:51:04,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 10:51:04,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 10:51:04,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491686517] [2020-07-20 10:51:04,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 10:51:04,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:51:04,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 10:51:04,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 10:51:04,836 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-20 10:51:04,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:51:04,915 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-20 10:51:04,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 10:51:04,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-20 10:51:04,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:51:04,918 INFO L225 Difference]: With dead ends: 27 [2020-07-20 10:51:04,918 INFO L226 Difference]: Without dead ends: 23 [2020-07-20 10:51:04,920 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-20 10:51:04,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-20 10:51:04,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-20 10:51:04,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-20 10:51:04,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-20 10:51:04,930 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-20 10:51:04,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:51:04,930 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-20 10:51:04,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 10:51:04,931 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-20 10:51:04,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-20 10:51:04,932 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:51:04,933 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:51:05,145 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:05,146 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:51:05,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:51:05,147 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-07-20 10:51:05,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:51:05,148 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [124508230] [2020-07-20 10:51:05,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:51:05,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 10:51:05,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:51:05,253 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-20 10:51:05,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:51:05,463 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:05,519 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-20 10:51:05,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [124508230] [2020-07-20 10:51:05,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:51:05,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-20 10:51:05,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641470667] [2020-07-20 10:51:05,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 10:51:05,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:51:05,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 10:51:05,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 10:51:05,523 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-07-20 10:51:05,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:51:05,696 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2020-07-20 10:51:05,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 10:51:05,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-20 10:51:05,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:51:05,700 INFO L225 Difference]: With dead ends: 32 [2020-07-20 10:51:05,700 INFO L226 Difference]: Without dead ends: 28 [2020-07-20 10:51:05,701 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-20 10:51:05,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-20 10:51:05,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-20 10:51:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-20 10:51:05,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-20 10:51:05,713 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 26 [2020-07-20 10:51:05,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:51:05,714 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-20 10:51:05,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 10:51:05,714 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-20 10:51:05,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-20 10:51:05,717 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:51:05,717 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:51:05,927 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:05,929 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:51:05,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:51:05,930 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-07-20 10:51:05,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:51:05,931 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [160738619] [2020-07-20 10:51:05,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:51:05,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 10:51:05,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:51:06,043 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-20 10:51:06,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:51:06,311 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:06,390 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-20 10:51:06,391 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [160738619] [2020-07-20 10:51:06,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:51:06,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-20 10:51:06,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328460351] [2020-07-20 10:51:06,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 10:51:06,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:51:06,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 10:51:06,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 10:51:06,398 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 9 states. [2020-07-20 10:51:06,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:51:06,577 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2020-07-20 10:51:06,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 10:51:06,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-20 10:51:06,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:51:06,586 INFO L225 Difference]: With dead ends: 37 [2020-07-20 10:51:06,586 INFO L226 Difference]: Without dead ends: 33 [2020-07-20 10:51:06,589 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-20 10:51:06,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-20 10:51:06,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2020-07-20 10:51:06,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-20 10:51:06,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-20 10:51:06,612 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 27 [2020-07-20 10:51:06,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:51:06,613 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-20 10:51:06,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 10:51:06,613 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-20 10:51:06,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-20 10:51:06,618 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:51:06,618 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:51:06,832 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:06,834 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:51:06,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:51:06,835 INFO L82 PathProgramCache]: Analyzing trace with hash -2027372739, now seen corresponding path program 2 times [2020-07-20 10:51:06,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:51:06,836 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1480133595] [2020-07-20 10:51:06,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:51:06,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 10:51:06,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:51:06,935 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-20 10:51:06,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:51:07,230 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:07,234 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:07,303 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:07,305 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:07,366 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-20 10:51:07,368 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1480133595] [2020-07-20 10:51:07,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:51:07,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-20 10:51:07,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813593865] [2020-07-20 10:51:07,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 10:51:07,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:51:07,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 10:51:07,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-20 10:51:07,372 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 11 states. [2020-07-20 10:51:07,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:51:07,581 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2020-07-20 10:51:07,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 10:51:07,582 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-07-20 10:51:07,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:51:07,584 INFO L225 Difference]: With dead ends: 42 [2020-07-20 10:51:07,584 INFO L226 Difference]: Without dead ends: 38 [2020-07-20 10:51:07,585 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-20 10:51:07,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-20 10:51:07,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2020-07-20 10:51:07,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-20 10:51:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-20 10:51:07,597 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 39 [2020-07-20 10:51:07,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:51:07,598 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-20 10:51:07,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 10:51:07,598 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-20 10:51:07,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-20 10:51:07,600 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:51:07,600 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:51:07,816 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:07,816 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:51:07,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:51:07,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 2 times [2020-07-20 10:51:07,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:51:07,819 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [160698158] [2020-07-20 10:51:07,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:51:07,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 10:51:07,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:51:07,920 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-20 10:51:07,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:51:08,172 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:08,225 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:08,226 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:08,288 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-20 10:51:08,289 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [160698158] [2020-07-20 10:51:08,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:51:08,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-20 10:51:08,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001637628] [2020-07-20 10:51:08,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 10:51:08,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:51:08,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 10:51:08,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-20 10:51:08,297 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 11 states. [2020-07-20 10:51:08,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:51:08,481 INFO L93 Difference]: Finished difference Result 47 states and 84 transitions. [2020-07-20 10:51:08,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 10:51:08,482 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2020-07-20 10:51:08,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:51:08,488 INFO L225 Difference]: With dead ends: 47 [2020-07-20 10:51:08,491 INFO L226 Difference]: Without dead ends: 43 [2020-07-20 10:51:08,493 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-20 10:51:08,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-20 10:51:08,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2020-07-20 10:51:08,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-20 10:51:08,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-20 10:51:08,523 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 41 [2020-07-20 10:51:08,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:51:08,524 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-20 10:51:08,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 10:51:08,524 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-20 10:51:08,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-20 10:51:08,531 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:51:08,531 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:51:08,746 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:08,747 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:51:08,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:51:08,748 INFO L82 PathProgramCache]: Analyzing trace with hash -767819153, now seen corresponding path program 3 times [2020-07-20 10:51:08,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:51:08,749 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1338070299] [2020-07-20 10:51:08,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:51:08,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 10:51:08,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:51:08,862 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 17 proven. 79 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-07-20 10:51:08,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:51:09,416 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:09,529 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:09,533 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:09,581 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:09,582 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:09,641 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 17 proven. 91 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2020-07-20 10:51:09,641 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1338070299] [2020-07-20 10:51:09,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:51:09,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2020-07-20 10:51:09,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720284827] [2020-07-20 10:51:09,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-20 10:51:09,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:51:09,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-20 10:51:09,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-20 10:51:09,644 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 13 states. [2020-07-20 10:51:09,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:51:09,843 INFO L93 Difference]: Finished difference Result 52 states and 102 transitions. [2020-07-20 10:51:09,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 10:51:09,844 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2020-07-20 10:51:09,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:51:09,846 INFO L225 Difference]: With dead ends: 52 [2020-07-20 10:51:09,846 INFO L226 Difference]: Without dead ends: 48 [2020-07-20 10:51:09,848 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 111 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-07-20 10:51:09,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-20 10:51:09,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2020-07-20 10:51:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-20 10:51:09,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-20 10:51:09,862 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 65 [2020-07-20 10:51:09,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:51:09,863 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-20 10:51:09,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-20 10:51:09,863 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-20 10:51:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-07-20 10:51:09,865 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:51:09,866 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:51:10,078 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:10,079 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:51:10,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:51:10,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1474757101, now seen corresponding path program 3 times [2020-07-20 10:51:10,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:51:10,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2067161194] [2020-07-20 10:51:10,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:51:10,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 10:51:10,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:51:10,211 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-07-20 10:51:10,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:51:10,692 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:10,806 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:10,808 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:10,856 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:10,908 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 181 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2020-07-20 10:51:10,908 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2067161194] [2020-07-20 10:51:10,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:51:10,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2020-07-20 10:51:10,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621977308] [2020-07-20 10:51:10,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-20 10:51:10,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:51:10,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-20 10:51:10,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-20 10:51:10,914 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 13 states. [2020-07-20 10:51:11,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:51:11,083 INFO L93 Difference]: Finished difference Result 57 states and 122 transitions. [2020-07-20 10:51:11,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 10:51:11,086 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2020-07-20 10:51:11,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:51:11,094 INFO L225 Difference]: With dead ends: 57 [2020-07-20 10:51:11,094 INFO L226 Difference]: Without dead ends: 53 [2020-07-20 10:51:11,098 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 172 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-07-20 10:51:11,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-20 10:51:11,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2020-07-20 10:51:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-20 10:51:11,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-20 10:51:11,134 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 96 [2020-07-20 10:51:11,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:51:11,136 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-20 10:51:11,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-20 10:51:11,136 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-20 10:51:11,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-07-20 10:51:11,142 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:51:11,144 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:51:11,359 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:11,361 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:51:11,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:51:11,362 INFO L82 PathProgramCache]: Analyzing trace with hash 838335741, now seen corresponding path program 4 times [2020-07-20 10:51:11,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:51:11,363 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1589424918] [2020-07-20 10:51:11,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:51:11,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-20 10:51:11,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:51:11,554 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 244 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2020-07-20 10:51:11,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:51:12,210 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:12,212 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:12,405 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:12,497 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:12,545 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:12,595 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 266 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2020-07-20 10:51:12,596 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1589424918] [2020-07-20 10:51:12,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:51:12,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2020-07-20 10:51:12,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72044719] [2020-07-20 10:51:12,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-20 10:51:12,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:51:12,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-20 10:51:12,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-07-20 10:51:12,599 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 15 states. [2020-07-20 10:51:12,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:51:12,958 INFO L93 Difference]: Finished difference Result 62 states and 144 transitions. [2020-07-20 10:51:12,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 10:51:12,959 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 117 [2020-07-20 10:51:12,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:51:12,962 INFO L225 Difference]: With dead ends: 62 [2020-07-20 10:51:12,962 INFO L226 Difference]: Without dead ends: 58 [2020-07-20 10:51:12,963 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 211 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-07-20 10:51:12,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-20 10:51:12,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2020-07-20 10:51:12,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-20 10:51:12,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2020-07-20 10:51:12,991 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 73 transitions. Word has length 117 [2020-07-20 10:51:12,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:51:12,992 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 73 transitions. [2020-07-20 10:51:12,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-20 10:51:12,992 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 73 transitions. [2020-07-20 10:51:12,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-07-20 10:51:12,998 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:51:12,999 INFO L422 BasicCegarLoop]: trace histogram [27, 27, 21, 13, 13, 13, 13, 13, 13, 13, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:51:13,212 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:13,214 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:51:13,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:51:13,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2072922826, now seen corresponding path program 4 times [2020-07-20 10:51:13,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:51:13,216 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2142428537] [2020-07-20 10:51:13,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:51:13,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-20 10:51:13,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:51:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 86 proven. 506 refuted. 0 times theorem prover too weak. 1334 trivial. 0 not checked. [2020-07-20 10:51:13,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:51:14,191 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:14,411 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:14,496 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:14,498 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:14,559 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:14,560 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 86 proven. 532 refuted. 0 times theorem prover too weak. 1308 trivial. 0 not checked. [2020-07-20 10:51:14,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2142428537] [2020-07-20 10:51:14,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:51:14,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2020-07-20 10:51:14,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671075950] [2020-07-20 10:51:14,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-20 10:51:14,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:51:14,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-20 10:51:14,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-07-20 10:51:14,630 INFO L87 Difference]: Start difference. First operand 41 states and 73 transitions. Second operand 15 states. [2020-07-20 10:51:14,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:51:14,826 INFO L93 Difference]: Finished difference Result 67 states and 168 transitions. [2020-07-20 10:51:14,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 10:51:14,827 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 190 [2020-07-20 10:51:14,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:51:14,830 INFO L225 Difference]: With dead ends: 67 [2020-07-20 10:51:14,831 INFO L226 Difference]: Without dead ends: 63 [2020-07-20 10:51:14,832 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 356 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-07-20 10:51:14,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-20 10:51:14,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2020-07-20 10:51:14,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-20 10:51:14,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2020-07-20 10:51:14,847 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 73 transitions. Word has length 190 [2020-07-20 10:51:14,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:51:14,848 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 73 transitions. [2020-07-20 10:51:14,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-20 10:51:14,848 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 73 transitions. [2020-07-20 10:51:14,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-07-20 10:51:14,852 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:51:14,853 INFO L422 BasicCegarLoop]: trace histogram [43, 43, 22, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:51:15,067 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:15,069 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:51:15,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:51:15,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1082984306, now seen corresponding path program 5 times [2020-07-20 10:51:15,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:51:15,071 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1931524821] [2020-07-20 10:51:15,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:51:15,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-20 10:51:15,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:51:15,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4662 backedges. 159 proven. 967 refuted. 0 times theorem prover too weak. 3536 trivial. 0 not checked. [2020-07-20 10:51:15,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:51:16,854 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:17,203 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:17,347 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:17,436 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:17,510 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:17,511 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:17,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4662 backedges. 159 proven. 1002 refuted. 0 times theorem prover too weak. 3501 trivial. 0 not checked. [2020-07-20 10:51:17,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1931524821] [2020-07-20 10:51:17,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:51:17,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 17 [2020-07-20 10:51:17,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684550345] [2020-07-20 10:51:17,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-20 10:51:17,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:51:17,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-20 10:51:17,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-20 10:51:17,620 INFO L87 Difference]: Start difference. First operand 41 states and 73 transitions. Second operand 17 states. [2020-07-20 10:51:17,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:51:17,832 INFO L93 Difference]: Finished difference Result 72 states and 194 transitions. [2020-07-20 10:51:17,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 10:51:17,832 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 286 [2020-07-20 10:51:17,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:51:17,836 INFO L225 Difference]: With dead ends: 72 [2020-07-20 10:51:17,836 INFO L226 Difference]: Without dead ends: 68 [2020-07-20 10:51:17,837 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 545 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2020-07-20 10:51:17,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-20 10:51:17,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2020-07-20 10:51:17,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-20 10:51:17,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2020-07-20 10:51:17,866 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 286 [2020-07-20 10:51:17,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:51:17,867 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2020-07-20 10:51:17,869 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-20 10:51:17,869 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2020-07-20 10:51:17,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2020-07-20 10:51:17,876 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:51:17,877 INFO L422 BasicCegarLoop]: trace histogram [43, 43, 34, 21, 21, 21, 21, 21, 21, 21, 13, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:51:18,089 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:18,090 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:51:18,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:51:18,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1006419304, now seen corresponding path program 5 times [2020-07-20 10:51:18,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:51:18,092 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2097866810] [2020-07-20 10:51:18,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:51:18,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-20 10:51:18,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:51:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 159 proven. 1055 refuted. 0 times theorem prover too weak. 3799 trivial. 0 not checked. [2020-07-20 10:51:18,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:51:19,767 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:20,152 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:20,318 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:20,412 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:20,413 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:20,463 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:20,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 159 proven. 1095 refuted. 0 times theorem prover too weak. 3759 trivial. 0 not checked. [2020-07-20 10:51:20,546 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2097866810] [2020-07-20 10:51:20,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:51:20,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 17 [2020-07-20 10:51:20,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56889532] [2020-07-20 10:51:20,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-20 10:51:20,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:51:20,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-20 10:51:20,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-20 10:51:20,549 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand 17 states. [2020-07-20 10:51:20,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:51:20,799 INFO L93 Difference]: Finished difference Result 77 states and 222 transitions. [2020-07-20 10:51:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 10:51:20,800 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 299 [2020-07-20 10:51:20,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:51:20,804 INFO L225 Difference]: With dead ends: 77 [2020-07-20 10:51:20,805 INFO L226 Difference]: Without dead ends: 73 [2020-07-20 10:51:20,806 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 570 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2020-07-20 10:51:20,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-20 10:51:20,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2020-07-20 10:51:20,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-20 10:51:20,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2020-07-20 10:51:20,824 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 299 [2020-07-20 10:51:20,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:51:20,825 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2020-07-20 10:51:20,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-20 10:51:20,826 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2020-07-20 10:51:20,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2020-07-20 10:51:20,831 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:51:20,831 INFO L422 BasicCegarLoop]: trace histogram [77, 77, 39, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:51:21,044 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:21,045 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:51:21,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:51:21,046 INFO L82 PathProgramCache]: Analyzing trace with hash 785285043, now seen corresponding path program 6 times [2020-07-20 10:51:21,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:51:21,047 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2114064249] [2020-07-20 10:51:21,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:51:21,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-20 10:51:21,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:51:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 15219 backedges. 391 proven. 2126 refuted. 0 times theorem prover too weak. 12702 trivial. 0 not checked. [2020-07-20 10:51:21,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:51:23,610 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:24,135 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:24,538 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:24,751 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:24,752 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:24,854 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:24,908 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:24,909 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 15219 backedges. 391 proven. 2177 refuted. 0 times theorem prover too weak. 12651 trivial. 0 not checked. [2020-07-20 10:51:25,144 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2114064249] [2020-07-20 10:51:25,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:51:25,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 19 [2020-07-20 10:51:25,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191645932] [2020-07-20 10:51:25,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-20 10:51:25,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:51:25,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-20 10:51:25,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2020-07-20 10:51:25,146 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand 19 states. [2020-07-20 10:51:25,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:51:25,673 INFO L93 Difference]: Finished difference Result 82 states and 252 transitions. [2020-07-20 10:51:25,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 10:51:25,674 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 507 [2020-07-20 10:51:25,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:51:25,680 INFO L225 Difference]: With dead ends: 82 [2020-07-20 10:51:25,680 INFO L226 Difference]: Without dead ends: 78 [2020-07-20 10:51:25,682 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1021 GetRequests, 983 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2020-07-20 10:51:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-20 10:51:25,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 51. [2020-07-20 10:51:25,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-20 10:51:25,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 109 transitions. [2020-07-20 10:51:25,702 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 109 transitions. Word has length 507 [2020-07-20 10:51:25,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:51:25,703 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 109 transitions. [2020-07-20 10:51:25,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-20 10:51:25,704 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 109 transitions. [2020-07-20 10:51:25,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2020-07-20 10:51:25,709 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:51:25,709 INFO L422 BasicCegarLoop]: trace histogram [65, 65, 53, 32, 32, 32, 32, 32, 32, 32, 21, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:51:25,934 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:25,935 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:51:25,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:51:25,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1350718391, now seen corresponding path program 6 times [2020-07-20 10:51:25,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:51:25,937 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1915556278] [2020-07-20 10:51:25,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:51:26,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-20 10:51:26,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:51:26,364 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 333 proven. 1918 refuted. 0 times theorem prover too weak. 9431 trivial. 0 not checked. [2020-07-20 10:51:26,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:51:28,315 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:28,961 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:28,962 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:29,330 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:29,332 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:29,521 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:29,604 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:29,605 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:29,649 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 333 proven. 1975 refuted. 0 times theorem prover too weak. 9374 trivial. 0 not checked. [2020-07-20 10:51:29,770 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1915556278] [2020-07-20 10:51:29,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:51:29,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 19 [2020-07-20 10:51:29,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723814223] [2020-07-20 10:51:29,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-20 10:51:29,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:51:29,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-20 10:51:29,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2020-07-20 10:51:29,773 INFO L87 Difference]: Start difference. First operand 51 states and 109 transitions. Second operand 19 states. [2020-07-20 10:51:30,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:51:30,057 INFO L93 Difference]: Finished difference Result 87 states and 284 transitions. [2020-07-20 10:51:30,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 10:51:30,057 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 450 [2020-07-20 10:51:30,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:51:30,061 INFO L225 Difference]: With dead ends: 87 [2020-07-20 10:51:30,062 INFO L226 Difference]: Without dead ends: 83 [2020-07-20 10:51:30,063 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 906 GetRequests, 868 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2020-07-20 10:51:30,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-20 10:51:30,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 51. [2020-07-20 10:51:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-20 10:51:30,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 109 transitions. [2020-07-20 10:51:30,077 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 109 transitions. Word has length 450 [2020-07-20 10:51:30,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:51:30,078 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 109 transitions. [2020-07-20 10:51:30,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-20 10:51:30,079 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 109 transitions. [2020-07-20 10:51:30,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2020-07-20 10:51:30,092 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:51:30,093 INFO L422 BasicCegarLoop]: trace histogram [163, 163, 82, 81, 81, 81, 81, 81, 81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:51:30,307 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:30,308 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:51:30,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:51:30,309 INFO L82 PathProgramCache]: Analyzing trace with hash 40336450, now seen corresponding path program 7 times [2020-07-20 10:51:30,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:51:30,310 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [584671558] [2020-07-20 10:51:30,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:51:30,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 2380 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-20 10:51:30,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:51:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 69012 backedges. 797 proven. 5632 refuted. 0 times theorem prover too weak. 62583 trivial. 0 not checked. [2020-07-20 10:51:31,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:51:35,505 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:35,507 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:36,831 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:37,402 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:37,403 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:37,768 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:37,769 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:37,945 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:37,947 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:38,062 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:38,063 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:38,127 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:38,716 INFO L134 CoverageAnalysis]: Checked inductivity of 69012 backedges. 797 proven. 5702 refuted. 0 times theorem prover too weak. 62513 trivial. 0 not checked. [2020-07-20 10:51:38,717 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [584671558] [2020-07-20 10:51:38,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:51:38,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 21 [2020-07-20 10:51:38,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409622514] [2020-07-20 10:51:38,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-20 10:51:38,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:51:38,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-20 10:51:38,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2020-07-20 10:51:38,721 INFO L87 Difference]: Start difference. First operand 51 states and 109 transitions. Second operand 21 states. [2020-07-20 10:51:39,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:51:39,585 INFO L93 Difference]: Finished difference Result 92 states and 318 transitions. [2020-07-20 10:51:39,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 10:51:39,586 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1066 [2020-07-20 10:51:39,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:51:39,592 INFO L225 Difference]: With dead ends: 92 [2020-07-20 10:51:39,593 INFO L226 Difference]: Without dead ends: 88 [2020-07-20 10:51:39,594 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2140 GetRequests, 2097 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2020-07-20 10:51:39,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-20 10:51:39,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 56. [2020-07-20 10:51:39,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-20 10:51:39,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 130 transitions. [2020-07-20 10:51:39,619 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 130 transitions. Word has length 1066 [2020-07-20 10:51:39,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:51:39,621 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 130 transitions. [2020-07-20 10:51:39,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-20 10:51:39,622 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 130 transitions. [2020-07-20 10:51:39,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2020-07-20 10:51:39,629 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:51:39,629 INFO L422 BasicCegarLoop]: trace histogram [95, 95, 79, 47, 47, 47, 47, 47, 47, 47, 32, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:51:39,843 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:39,844 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:51:39,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:51:39,845 INFO L82 PathProgramCache]: Analyzing trace with hash -312379166, now seen corresponding path program 7 times [2020-07-20 10:51:39,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:51:39,845 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1131276697] [2020-07-20 10:51:39,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:51:40,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 1458 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-20 10:51:40,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:51:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 25265 backedges. 501 proven. 3394 refuted. 0 times theorem prover too weak. 21370 trivial. 0 not checked. [2020-07-20 10:51:40,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:51:43,458 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:43,459 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:44,363 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:44,965 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:44,968 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:45,248 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:45,249 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:45,445 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:45,561 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:45,637 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:46,278 INFO L134 CoverageAnalysis]: Checked inductivity of 25265 backedges. 501 proven. 3471 refuted. 0 times theorem prover too weak. 21293 trivial. 0 not checked. [2020-07-20 10:51:46,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1131276697] [2020-07-20 10:51:46,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:51:46,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 21 [2020-07-20 10:51:46,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235921669] [2020-07-20 10:51:46,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-20 10:51:46,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:51:46,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-20 10:51:46,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2020-07-20 10:51:46,286 INFO L87 Difference]: Start difference. First operand 56 states and 130 transitions. Second operand 21 states. [2020-07-20 10:51:46,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:51:46,897 INFO L93 Difference]: Finished difference Result 97 states and 354 transitions. [2020-07-20 10:51:46,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 10:51:46,898 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 656 [2020-07-20 10:51:46,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:51:46,906 INFO L225 Difference]: With dead ends: 97 [2020-07-20 10:51:46,906 INFO L226 Difference]: Without dead ends: 93 [2020-07-20 10:51:46,908 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1319 GetRequests, 1276 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2020-07-20 10:51:46,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-07-20 10:51:46,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 56. [2020-07-20 10:51:46,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-20 10:51:46,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 130 transitions. [2020-07-20 10:51:46,931 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 130 transitions. Word has length 656 [2020-07-20 10:51:46,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:51:46,933 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 130 transitions. [2020-07-20 10:51:46,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-20 10:51:46,933 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 130 transitions. [2020-07-20 10:51:46,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1275 [2020-07-20 10:51:46,954 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:51:46,955 INFO L422 BasicCegarLoop]: trace histogram [195, 195, 98, 97, 97, 97, 97, 97, 97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:51:47,168 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:47,169 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:51:47,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:51:47,170 INFO L82 PathProgramCache]: Analyzing trace with hash 971855614, now seen corresponding path program 8 times [2020-07-20 10:51:47,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:51:47,171 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1623842194] [2020-07-20 10:51:47,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:51:47,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 2844 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-20 10:51:47,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:51:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 98940 backedges. 1168 proven. 7570 refuted. 0 times theorem prover too weak. 90202 trivial. 0 not checked. [2020-07-20 10:51:48,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:51:53,229 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:55,181 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:56,076 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:56,616 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:56,616 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:56,934 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:56,935 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:57,157 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:57,252 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:57,253 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:57,307 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:57,308 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:51:58,062 INFO L134 CoverageAnalysis]: Checked inductivity of 98940 backedges. 1168 proven. 7662 refuted. 0 times theorem prover too weak. 90110 trivial. 0 not checked. [2020-07-20 10:51:58,063 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1623842194] [2020-07-20 10:51:58,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:51:58,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 23 [2020-07-20 10:51:58,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541907625] [2020-07-20 10:51:58,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-20 10:51:58,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:51:58,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-20 10:51:58,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2020-07-20 10:51:58,067 INFO L87 Difference]: Start difference. First operand 56 states and 130 transitions. Second operand 23 states. [2020-07-20 10:51:58,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:51:58,854 INFO L93 Difference]: Finished difference Result 102 states and 392 transitions. [2020-07-20 10:51:58,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 10:51:58,855 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1274 [2020-07-20 10:51:58,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:51:58,861 INFO L225 Difference]: With dead ends: 102 [2020-07-20 10:51:58,861 INFO L226 Difference]: Without dead ends: 98 [2020-07-20 10:51:58,863 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2557 GetRequests, 2509 SyntacticMatches, 18 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2020-07-20 10:51:58,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-20 10:51:58,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 61. [2020-07-20 10:51:58,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-20 10:51:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 153 transitions. [2020-07-20 10:51:58,880 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 153 transitions. Word has length 1274 [2020-07-20 10:51:58,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:51:58,882 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 153 transitions. [2020-07-20 10:51:58,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-20 10:51:58,882 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 153 transitions. [2020-07-20 10:51:58,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1821 [2020-07-20 10:51:58,917 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:51:58,918 INFO L422 BasicCegarLoop]: trace histogram [267, 267, 211, 133, 133, 133, 133, 133, 133, 133, 78, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:51:59,132 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:59,133 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:51:59,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:51:59,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1926911020, now seen corresponding path program 8 times [2020-07-20 10:51:59,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:51:59,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1888755207] [2020-07-20 10:51:59,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:51:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:51:59,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 4044 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-20 10:51:59,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:52:01,341 INFO L134 CoverageAnalysis]: Checked inductivity of 199311 backedges. 1523 proven. 11417 refuted. 0 times theorem prover too weak. 186371 trivial. 0 not checked. [2020-07-20 10:52:01,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:52:07,910 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:09,923 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:09,924 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:11,163 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:11,164 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:11,733 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:12,157 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:12,158 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:12,381 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:12,478 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:12,535 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:13,970 INFO L134 CoverageAnalysis]: Checked inductivity of 199311 backedges. 1523 proven. 11517 refuted. 0 times theorem prover too weak. 186271 trivial. 0 not checked. [2020-07-20 10:52:13,971 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1888755207] [2020-07-20 10:52:13,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:52:13,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 22 [2020-07-20 10:52:13,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691815845] [2020-07-20 10:52:13,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-20 10:52:13,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:52:13,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-20 10:52:13,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2020-07-20 10:52:13,975 INFO L87 Difference]: Start difference. First operand 61 states and 153 transitions. Second operand 22 states. [2020-07-20 10:52:14,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:52:14,796 INFO L93 Difference]: Finished difference Result 107 states and 432 transitions. [2020-07-20 10:52:14,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 10:52:14,797 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1820 [2020-07-20 10:52:14,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:52:14,804 INFO L225 Difference]: With dead ends: 107 [2020-07-20 10:52:14,804 INFO L226 Difference]: Without dead ends: 103 [2020-07-20 10:52:14,805 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3648 GetRequests, 3600 SyntacticMatches, 19 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2020-07-20 10:52:14,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-20 10:52:14,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 61. [2020-07-20 10:52:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-20 10:52:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 153 transitions. [2020-07-20 10:52:14,822 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 153 transitions. Word has length 1820 [2020-07-20 10:52:14,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:52:14,824 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 153 transitions. [2020-07-20 10:52:14,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-20 10:52:14,824 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 153 transitions. [2020-07-20 10:52:14,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2029 [2020-07-20 10:52:14,862 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:52:14,863 INFO L422 BasicCegarLoop]: trace histogram [311, 311, 156, 155, 155, 155, 155, 155, 155, 155, 155, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:52:15,076 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:52:15,077 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:52:15,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:52:15,079 INFO L82 PathProgramCache]: Analyzing trace with hash -2013442466, now seen corresponding path program 9 times [2020-07-20 10:52:15,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:52:15,079 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1945483466] [2020-07-20 10:52:15,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:52:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:52:15,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 4526 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-20 10:52:15,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:52:18,044 INFO L134 CoverageAnalysis]: Checked inductivity of 252495 backedges. 2059 proven. 13739 refuted. 0 times theorem prover too weak. 236697 trivial. 0 not checked. [2020-07-20 10:52:18,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:52:25,013 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:28,554 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:30,479 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:31,380 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:31,381 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:32,023 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:32,024 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:32,331 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:32,332 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:32,536 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:32,638 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:32,696 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:34,351 INFO L134 CoverageAnalysis]: Checked inductivity of 252495 backedges. 2059 proven. 13856 refuted. 0 times theorem prover too weak. 236580 trivial. 0 not checked. [2020-07-20 10:52:34,352 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1945483466] [2020-07-20 10:52:34,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:52:34,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 24 [2020-07-20 10:52:34,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224784044] [2020-07-20 10:52:34,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-20 10:52:34,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:52:34,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-20 10:52:34,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-07-20 10:52:34,356 INFO L87 Difference]: Start difference. First operand 61 states and 153 transitions. Second operand 24 states. [2020-07-20 10:52:35,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:52:35,459 INFO L93 Difference]: Finished difference Result 112 states and 474 transitions. [2020-07-20 10:52:35,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 10:52:35,460 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 2028 [2020-07-20 10:52:35,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:52:35,467 INFO L225 Difference]: With dead ends: 112 [2020-07-20 10:52:35,467 INFO L226 Difference]: Without dead ends: 108 [2020-07-20 10:52:35,469 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4066 GetRequests, 4013 SyntacticMatches, 21 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=385, Invalid=737, Unknown=0, NotChecked=0, Total=1122 [2020-07-20 10:52:35,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-07-20 10:52:35,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 66. [2020-07-20 10:52:35,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-20 10:52:35,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 178 transitions. [2020-07-20 10:52:35,486 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 178 transitions. Word has length 2028 [2020-07-20 10:52:35,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:52:35,488 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 178 transitions. [2020-07-20 10:52:35,489 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-20 10:52:35,489 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 178 transitions. [2020-07-20 10:52:35,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3355 [2020-07-20 10:52:35,584 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:52:35,586 INFO L422 BasicCegarLoop]: trace histogram [491, 491, 401, 245, 245, 245, 245, 245, 245, 245, 156, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:52:35,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:52:35,787 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:52:35,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:52:35,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1199798370, now seen corresponding path program 9 times [2020-07-20 10:52:35,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:52:35,790 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2129053673] [2020-07-20 10:52:35,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:52:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:52:37,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 7448 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-20 10:52:37,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:52:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 680940 backedges. 3664 proven. 24319 refuted. 0 times theorem prover too weak. 652957 trivial. 0 not checked. [2020-07-20 10:52:42,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:52:52,542 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:58,645 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:52:58,646 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:53:01,608 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:53:03,224 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:53:03,857 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:53:04,134 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:53:04,325 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:53:04,458 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:53:04,459 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:53:04,538 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:53:04,626 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:53:08,831 INFO L134 CoverageAnalysis]: Checked inductivity of 680940 backedges. 3674 proven. 24426 refuted. 0 times theorem prover too weak. 652840 trivial. 0 not checked. [2020-07-20 10:53:08,832 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2129053673] [2020-07-20 10:53:08,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:53:08,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 24 [2020-07-20 10:53:08,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295295864] [2020-07-20 10:53:08,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-20 10:53:08,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:53:08,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-20 10:53:08,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-07-20 10:53:08,838 INFO L87 Difference]: Start difference. First operand 66 states and 178 transitions. Second operand 24 states. [2020-07-20 10:53:09,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:53:09,500 INFO L93 Difference]: Finished difference Result 289 states and 3051 transitions. [2020-07-20 10:53:09,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 10:53:09,502 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 3354 [2020-07-20 10:53:09,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:53:09,514 INFO L225 Difference]: With dead ends: 289 [2020-07-20 10:53:09,514 INFO L226 Difference]: Without dead ends: 85 [2020-07-20 10:53:09,531 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6717 GetRequests, 6664 SyntacticMatches, 21 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=385, Invalid=737, Unknown=0, NotChecked=0, Total=1122 [2020-07-20 10:53:09,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-07-20 10:53:09,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-07-20 10:53:09,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-20 10:53:09,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 140 transitions. [2020-07-20 10:53:09,556 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 140 transitions. Word has length 3354 [2020-07-20 10:53:09,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:53:09,557 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 140 transitions. [2020-07-20 10:53:09,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-20 10:53:09,558 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 140 transitions. [2020-07-20 10:53:09,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1489 [2020-07-20 10:53:09,582 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:53:09,583 INFO L422 BasicCegarLoop]: trace histogram [215, 215, 191, 107, 107, 107, 107, 107, 107, 107, 84, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:53:09,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:53:09,798 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:53:09,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:53:09,799 INFO L82 PathProgramCache]: Analyzing trace with hash 114559272, now seen corresponding path program 10 times [2020-07-20 10:53:09,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:53:09,800 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1084822855] [2020-07-20 10:53:09,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:53:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 10:53:10,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 3302 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-20 10:53:10,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 10:53:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 132849 backedges. 1654 proven. 8876 refuted. 0 times theorem prover too weak. 122319 trivial. 0 not checked. [2020-07-20 10:53:11,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 10:53:17,215 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:53:19,437 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:53:20,713 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:53:21,543 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:53:22,015 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:53:22,016 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:53:22,250 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:53:22,251 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:53:22,354 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:53:22,354 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:53:22,409 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:53:22,410 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:53:22,446 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:53:22,471 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 10:53:23,357 INFO L134 CoverageAnalysis]: Checked inductivity of 132849 backedges. 1678 proven. 8946 refuted. 0 times theorem prover too weak. 122225 trivial. 0 not checked. [2020-07-20 10:53:23,358 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1084822855] [2020-07-20 10:53:23,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 10:53:23,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 22 [2020-07-20 10:53:23,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046768177] [2020-07-20 10:53:23,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-20 10:53:23,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 10:53:23,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-20 10:53:23,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2020-07-20 10:53:23,361 INFO L87 Difference]: Start difference. First operand 85 states and 140 transitions. Second operand 22 states. [2020-07-20 10:53:24,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 10:53:24,007 INFO L93 Difference]: Finished difference Result 294 states and 697 transitions. [2020-07-20 10:53:24,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 10:53:24,008 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1488 [2020-07-20 10:53:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 10:53:24,015 INFO L225 Difference]: With dead ends: 294 [2020-07-20 10:53:24,015 INFO L226 Difference]: Without dead ends: 93 [2020-07-20 10:53:24,031 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2984 GetRequests, 2936 SyntacticMatches, 19 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2020-07-20 10:53:24,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-07-20 10:53:24,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2020-07-20 10:53:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-07-20 10:53:24,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 117 transitions. [2020-07-20 10:53:24,054 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 117 transitions. Word has length 1488 [2020-07-20 10:53:24,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 10:53:24,055 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 117 transitions. [2020-07-20 10:53:24,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-20 10:53:24,056 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 117 transitions. [2020-07-20 10:53:24,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-07-20 10:53:24,075 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 10:53:24,076 INFO L422 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 10:53:24,290 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:53:24,291 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 10:53:24,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 10:53:24,292 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 11 times [2020-07-20 10:53:24,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 10:53:24,292 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1686012778] [2020-07-20 10:53:24,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:53:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 10:53:25,010 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 10:53:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 10:53:25,264 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 10:53:25,493 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-20 10:53:25,494 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 10:53:25,707 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 10:53:25,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 10:53:25 BoogieIcfgContainer [2020-07-20 10:53:25,950 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 10:53:25,953 INFO L168 Benchmark]: Toolchain (without parser) took 142808.06 ms. Allocated memory was 144.7 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 101.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2020-07-20 10:53:25,954 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 144.7 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-20 10:53:25,955 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.09 ms. Allocated memory is still 144.7 MB. Free memory was 101.4 MB in the beginning and 92.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-07-20 10:53:25,955 INFO L168 Benchmark]: Boogie Preprocessor took 48.95 ms. Allocated memory is still 144.7 MB. Free memory was 92.1 MB in the beginning and 90.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-20 10:53:25,958 INFO L168 Benchmark]: RCFGBuilder took 493.72 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 90.8 MB in the beginning and 170.8 MB in the end (delta: -80.0 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-20 10:53:25,958 INFO L168 Benchmark]: TraceAbstraction took 141953.04 ms. Allocated memory was 202.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 170.1 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2020-07-20 10:53:25,964 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.34 ms. Allocated memory is still 144.7 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 304.09 ms. Allocated memory is still 144.7 MB. Free memory was 101.4 MB in the beginning and 92.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.95 ms. Allocated memory is still 144.7 MB. Free memory was 92.1 MB in the beginning and 90.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 493.72 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 90.8 MB in the beginning and 170.8 MB in the end (delta: -80.0 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 141953.04 ms. Allocated memory was 202.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 170.1 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 10; VAL [x=10] [L25] CALL, EXPR fibo(x) VAL [\old(n)=10] [L6] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L8] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L6] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L8] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L6] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L8] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=9, fibo(n-1)=21, n=9] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=9, fibo(n-1)=21, fibo(n-2)=13, n=9] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=10, fibo(n-1)=34, n=10] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L6] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L8] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=10, fibo(n-1)=34, fibo(n-2)=21, n=10] [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) VAL [fibo(x)=55, x=10] [L25] int result = fibo(x); [L26] COND TRUE result == 55 VAL [result=55, x=10] [L27] __VERIFIER_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 141.6s, OverallIterations: 22, TraceHistogramMax: 491, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 374 SDtfs, 1820 SDslu, 1831 SDs, 0 SdLazy, 2343 SolverSat, 4378 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27797 GetRequests, 27147 SyntacticMatches, 238 SemanticMatches, 412 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2326 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 407 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 119.5s InterpolantComputationTime, 15068 NumberOfCodeBlocks, 15068 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 27645 ConstructedInterpolants, 0 QuantifiedInterpolants, 54663847 SizeOfPredicates, 140 NumberOfNonLiveVariables, 30859 ConjunctsInSsa, 280 ConjunctsInUnsatCore, 40 InterpolantComputations, 2 PerfectInterpolantSequences, 2832402/2997438 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...