java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:12:59,115 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:12:59,118 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:12:59,134 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:12:59,135 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:12:59,136 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:12:59,137 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:12:59,139 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:12:59,140 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:12:59,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:12:59,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:12:59,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:12:59,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:12:59,145 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:12:59,145 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:12:59,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:12:59,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:12:59,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:12:59,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:12:59,152 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:12:59,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:12:59,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:12:59,155 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:12:59,156 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:12:59,158 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:12:59,158 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:12:59,159 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:12:59,160 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:12:59,160 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:12:59,161 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:12:59,161 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:12:59,162 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:12:59,163 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:12:59,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:12:59,166 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:12:59,166 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:12:59,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:12:59,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:12:59,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:12:59,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:12:59,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:12:59,171 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 06:12:59,197 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:12:59,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:12:59,199 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:12:59,199 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:12:59,199 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:12:59,200 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:12:59,200 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:12:59,200 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:12:59,200 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:12:59,200 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:12:59,201 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:12:59,201 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:12:59,201 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:12:59,201 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:12:59,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:12:59,202 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:12:59,202 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:12:59,202 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:12:59,202 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:12:59,202 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:12:59,203 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:12:59,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:12:59,203 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:12:59,203 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:12:59,204 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:12:59,204 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:12:59,204 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:12:59,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:12:59,204 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:12:59,231 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:12:59,246 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:12:59,252 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:12:59,253 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:12:59,254 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:12:59,254 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2019-09-08 06:12:59,314 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dbaee78b/d7302d1afddb4cceadfe8730c234bbbc/FLAG567cf4eab [2019-09-08 06:12:59,769 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:12:59,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2019-09-08 06:12:59,777 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dbaee78b/d7302d1afddb4cceadfe8730c234bbbc/FLAG567cf4eab [2019-09-08 06:13:00,200 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dbaee78b/d7302d1afddb4cceadfe8730c234bbbc [2019-09-08 06:13:00,212 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:13:00,213 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:13:00,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:13:00,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:13:00,218 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:13:00,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:13:00" (1/1) ... [2019-09-08 06:13:00,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b8c5937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:13:00, skipping insertion in model container [2019-09-08 06:13:00,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:13:00" (1/1) ... [2019-09-08 06:13:00,229 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:13:00,245 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:13:00,400 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:13:00,406 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:13:00,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:13:00,443 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:13:00,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:13:00 WrapperNode [2019-09-08 06:13:00,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:13:00,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:13:00,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:13:00,444 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:13:00,454 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:13:00" (1/1) ... [2019-09-08 06:13:00,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:13:00" (1/1) ... [2019-09-08 06:13:00,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:13:00" (1/1) ... [2019-09-08 06:13:00,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:13:00" (1/1) ... [2019-09-08 06:13:00,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:13:00" (1/1) ... [2019-09-08 06:13:00,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:13:00" (1/1) ... [2019-09-08 06:13:00,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:13:00" (1/1) ... [2019-09-08 06:13:00,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:13:00,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:13:00,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:13:00,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:13:00,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:13:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:13:00,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:13:00,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:13:00,613 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-09-08 06:13:00,613 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:13:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:13:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:13:00,613 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-09-08 06:13:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:13:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:13:00,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:13:00,772 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:13:00,773 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 06:13:00,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:13:00 BoogieIcfgContainer [2019-09-08 06:13:00,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:13:00,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:13:00,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:13:00,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:13:00,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:13:00" (1/3) ... [2019-09-08 06:13:00,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f47ba56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:13:00, skipping insertion in model container [2019-09-08 06:13:00,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:13:00" (2/3) ... [2019-09-08 06:13:00,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f47ba56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:13:00, skipping insertion in model container [2019-09-08 06:13:00,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:13:00" (3/3) ... [2019-09-08 06:13:00,783 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2019-09-08 06:13:00,794 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:13:00,805 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:13:00,844 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:13:00,906 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:13:00,908 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:13:00,909 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:13:00,909 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:13:00,909 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:13:00,909 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:13:00,909 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:13:00,909 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:13:00,910 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:13:00,929 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-09-08 06:13:00,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-08 06:13:00,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:00,934 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:00,936 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:00,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:00,940 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2019-09-08 06:13:00,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:00,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:00,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:00,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:13:00,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:01,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:13:01,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:13:01,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:13:01,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:13:01,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:13:01,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:13:01,118 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2019-09-08 06:13:01,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:01,233 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2019-09-08 06:13:01,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:13:01,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-08 06:13:01,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:01,245 INFO L225 Difference]: With dead ends: 35 [2019-09-08 06:13:01,246 INFO L226 Difference]: Without dead ends: 21 [2019-09-08 06:13:01,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:13:01,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-08 06:13:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-08 06:13:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-08 06:13:01,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-09-08 06:13:01,291 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2019-09-08 06:13:01,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:01,291 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-09-08 06:13:01,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:13:01,292 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-09-08 06:13:01,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 06:13:01,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:01,294 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:01,294 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:01,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:01,295 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2019-09-08 06:13:01,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:01,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:01,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:01,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:13:01,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:01,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:13:01,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:13:01,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:13:01,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:13:01,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:13:01,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:13:01,343 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2019-09-08 06:13:01,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:01,368 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2019-09-08 06:13:01,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:13:01,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-08 06:13:01,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:01,371 INFO L225 Difference]: With dead ends: 27 [2019-09-08 06:13:01,372 INFO L226 Difference]: Without dead ends: 23 [2019-09-08 06:13:01,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:13:01,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-08 06:13:01,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-09-08 06:13:01,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-08 06:13:01,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-09-08 06:13:01,385 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2019-09-08 06:13:01,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:01,386 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-09-08 06:13:01,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:13:01,386 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-09-08 06:13:01,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-08 06:13:01,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:01,388 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:01,388 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:01,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:01,389 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2019-09-08 06:13:01,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:01,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:01,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:01,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:13:01,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 06:13:01,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:01,497 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:13:01,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:01,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 06:13:01,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 06:13:01,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:01,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-09-08 06:13:01,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:13:01,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:13:01,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:13:01,642 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2019-09-08 06:13:01,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:01,768 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2019-09-08 06:13:01,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 06:13:01,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-09-08 06:13:01,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:01,770 INFO L225 Difference]: With dead ends: 38 [2019-09-08 06:13:01,770 INFO L226 Difference]: Without dead ends: 23 [2019-09-08 06:13:01,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:13:01,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-08 06:13:01,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-08 06:13:01,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-08 06:13:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-09-08 06:13:01,781 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2019-09-08 06:13:01,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:01,781 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-09-08 06:13:01,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:13:01,782 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-09-08 06:13:01,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-08 06:13:01,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:01,785 INFO L399 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] [2019-09-08 06:13:01,786 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:01,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:01,786 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2019-09-08 06:13:01,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:01,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:01,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:01,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:13:01,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:01,877 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 06:13:01,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:01,879 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:01,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:13:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:01,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 06:13:01,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 06:13:01,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:01,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-08 06:13:01,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:13:01,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:13:01,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:13:01,938 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2019-09-08 06:13:02,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:02,016 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2019-09-08 06:13:02,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:13:02,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-09-08 06:13:02,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:02,019 INFO L225 Difference]: With dead ends: 32 [2019-09-08 06:13:02,019 INFO L226 Difference]: Without dead ends: 28 [2019-09-08 06:13:02,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:13:02,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-08 06:13:02,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-08 06:13:02,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-08 06:13:02,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-09-08 06:13:02,040 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2019-09-08 06:13:02,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:02,040 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-09-08 06:13:02,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:13:02,040 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2019-09-08 06:13:02,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 06:13:02,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:02,043 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:02,043 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:02,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:02,046 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2019-09-08 06:13:02,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:02,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:02,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:02,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:13:02,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 06:13:02,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:02,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:13:02,225 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:02,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:13:02,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:02,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 06:13:02,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:02,327 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 06:13:02,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:02,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2019-09-08 06:13:02,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 06:13:02,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 06:13:02,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 06:13:02,332 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 13 states. [2019-09-08 06:13:02,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:02,721 INFO L93 Difference]: Finished difference Result 66 states and 99 transitions. [2019-09-08 06:13:02,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 06:13:02,722 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-09-08 06:13:02,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:02,724 INFO L225 Difference]: With dead ends: 66 [2019-09-08 06:13:02,724 INFO L226 Difference]: Without dead ends: 44 [2019-09-08 06:13:02,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-08 06:13:02,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-08 06:13:02,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-09-08 06:13:02,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-08 06:13:02,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2019-09-08 06:13:02,737 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 40 [2019-09-08 06:13:02,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:02,737 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2019-09-08 06:13:02,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 06:13:02,738 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2019-09-08 06:13:02,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 06:13:02,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:02,740 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:02,740 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:02,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:02,741 INFO L82 PathProgramCache]: Analyzing trace with hash 2001184551, now seen corresponding path program 3 times [2019-09-08 06:13:02,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:02,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:02,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:02,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:02,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:02,827 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-08 06:13:02,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:02,828 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:02,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 06:13:02,877 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-08 06:13:02,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:02,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 06:13:02,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:02,911 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-08 06:13:02,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:02,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-08 06:13:02,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:13:02,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:13:02,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:13:02,919 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 7 states. [2019-09-08 06:13:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:03,019 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2019-09-08 06:13:03,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:13:03,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-09-08 06:13:03,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:03,023 INFO L225 Difference]: With dead ends: 49 [2019-09-08 06:13:03,023 INFO L226 Difference]: Without dead ends: 45 [2019-09-08 06:13:03,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-08 06:13:03,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-08 06:13:03,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-09-08 06:13:03,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-08 06:13:03,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2019-09-08 06:13:03,045 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 68 [2019-09-08 06:13:03,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:03,045 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2019-09-08 06:13:03,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:13:03,046 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2019-09-08 06:13:03,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 06:13:03,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:03,049 INFO L399 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] [2019-09-08 06:13:03,050 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:03,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:03,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1474757101, now seen corresponding path program 4 times [2019-09-08 06:13:03,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:03,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:03,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:03,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:03,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:03,209 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 46 proven. 109 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-08 06:13:03,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:03,210 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:03,221 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 06:13:03,253 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 06:13:03,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:03,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 06:13:03,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:03,294 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:13:03,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:03,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2019-09-08 06:13:03,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:13:03,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:13:03,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:13:03,301 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 8 states. [2019-09-08 06:13:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:03,429 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-09-08 06:13:03,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 06:13:03,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-09-08 06:13:03,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:03,432 INFO L225 Difference]: With dead ends: 54 [2019-09-08 06:13:03,432 INFO L226 Difference]: Without dead ends: 50 [2019-09-08 06:13:03,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:13:03,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-08 06:13:03,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-09-08 06:13:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-08 06:13:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-09-08 06:13:03,442 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 96 [2019-09-08 06:13:03,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:03,443 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-09-08 06:13:03,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:13:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-09-08 06:13:03,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 06:13:03,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:03,448 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 18, 10, 10, 10, 10, 10, 10, 10, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:03,448 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:03,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:03,449 INFO L82 PathProgramCache]: Analyzing trace with hash 818443429, now seen corresponding path program 5 times [2019-09-08 06:13:03,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:03,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:03,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:03,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:03,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 71 proven. 368 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2019-09-08 06:13:03,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:03,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:03,628 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 06:13:03,668 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-09-08 06:13:03,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:03,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 06:13:03,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:03,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 710 proven. 17 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:13:03,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:03,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2019-09-08 06:13:03,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 06:13:03,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 06:13:03,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-09-08 06:13:03,764 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 13 states. [2019-09-08 06:13:04,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:04,211 INFO L93 Difference]: Finished difference Result 112 states and 191 transitions. [2019-09-08 06:13:04,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 06:13:04,211 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 151 [2019-09-08 06:13:04,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:04,214 INFO L225 Difference]: With dead ends: 112 [2019-09-08 06:13:04,214 INFO L226 Difference]: Without dead ends: 67 [2019-09-08 06:13:04,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2019-09-08 06:13:04,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-09-08 06:13:04,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2019-09-08 06:13:04,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-08 06:13:04,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2019-09-08 06:13:04,227 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 151 [2019-09-08 06:13:04,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:04,227 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2019-09-08 06:13:04,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 06:13:04,227 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2019-09-08 06:13:04,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 06:13:04,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:04,230 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:04,231 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:04,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:04,231 INFO L82 PathProgramCache]: Analyzing trace with hash 259499213, now seen corresponding path program 6 times [2019-09-08 06:13:04,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:04,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:04,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:04,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:04,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:04,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 152 proven. 389 refuted. 0 times theorem prover too weak. 1113 trivial. 0 not checked. [2019-09-08 06:13:04,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:04,395 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:13:04,421 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:04,491 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-09-08 06:13:04,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:04,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 06:13:04,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:04,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 202 proven. 241 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2019-09-08 06:13:04,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:04,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-09-08 06:13:04,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 06:13:04,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 06:13:04,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-08 06:13:04,592 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand 10 states. [2019-09-08 06:13:04,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:04,752 INFO L93 Difference]: Finished difference Result 73 states and 101 transitions. [2019-09-08 06:13:04,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 06:13:04,753 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2019-09-08 06:13:04,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:04,755 INFO L225 Difference]: With dead ends: 73 [2019-09-08 06:13:04,755 INFO L226 Difference]: Without dead ends: 69 [2019-09-08 06:13:04,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-09-08 06:13:04,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-08 06:13:04,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-09-08 06:13:04,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-08 06:13:04,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 96 transitions. [2019-09-08 06:13:04,767 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 96 transitions. Word has length 177 [2019-09-08 06:13:04,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:04,768 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 96 transitions. [2019-09-08 06:13:04,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 06:13:04,768 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 96 transitions. [2019-09-08 06:13:04,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-09-08 06:13:04,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:04,775 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 43, 26, 26, 26, 26, 26, 26, 26, 17, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:04,775 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:04,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:04,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1341952681, now seen corresponding path program 7 times [2019-09-08 06:13:04,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:04,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:04,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:04,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:04,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:05,136 INFO L134 CoverageAnalysis]: Checked inductivity of 7715 backedges. 240 proven. 1545 refuted. 0 times theorem prover too weak. 5930 trivial. 0 not checked. [2019-09-08 06:13:05,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:05,141 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:05,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:13:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:05,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 06:13:05,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:05,453 INFO L134 CoverageAnalysis]: Checked inductivity of 7715 backedges. 240 proven. 1545 refuted. 0 times theorem prover too weak. 5930 trivial. 0 not checked. [2019-09-08 06:13:05,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:05,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-09-08 06:13:05,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 06:13:05,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 06:13:05,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-08 06:13:05,470 INFO L87 Difference]: Start difference. First operand 69 states and 96 transitions. Second operand 11 states. [2019-09-08 06:13:05,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:05,634 INFO L93 Difference]: Finished difference Result 78 states and 115 transitions. [2019-09-08 06:13:05,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:13:05,635 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 368 [2019-09-08 06:13:05,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:05,642 INFO L225 Difference]: With dead ends: 78 [2019-09-08 06:13:05,642 INFO L226 Difference]: Without dead ends: 74 [2019-09-08 06:13:05,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-09-08 06:13:05,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-08 06:13:05,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-09-08 06:13:05,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-09-08 06:13:05,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 110 transitions. [2019-09-08 06:13:05,668 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 110 transitions. Word has length 368 [2019-09-08 06:13:05,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:05,669 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 110 transitions. [2019-09-08 06:13:05,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 06:13:05,673 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 110 transitions. [2019-09-08 06:13:05,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2019-09-08 06:13:05,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:05,706 INFO L399 BasicCegarLoop]: trace histogram [103, 103, 83, 51, 51, 51, 51, 51, 51, 51, 32, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:05,707 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:05,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:05,708 INFO L82 PathProgramCache]: Analyzing trace with hash -2041458804, now seen corresponding path program 8 times [2019-09-08 06:13:05,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:05,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:05,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:05,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:13:05,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 29515 backedges. 486 proven. 3745 refuted. 0 times theorem prover too weak. 25284 trivial. 0 not checked. [2019-09-08 06:13:06,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:06,288 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:06,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 06:13:06,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:13:06,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:06,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 1574 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 06:13:06,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:06,792 INFO L134 CoverageAnalysis]: Checked inductivity of 29515 backedges. 486 proven. 3745 refuted. 0 times theorem prover too weak. 25284 trivial. 0 not checked. [2019-09-08 06:13:06,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:06,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-09-08 06:13:06,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 06:13:06,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 06:13:06,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:13:06,799 INFO L87 Difference]: Start difference. First operand 74 states and 110 transitions. Second operand 12 states. [2019-09-08 06:13:07,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:07,062 INFO L93 Difference]: Finished difference Result 83 states and 131 transitions. [2019-09-08 06:13:07,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 06:13:07,062 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 708 [2019-09-08 06:13:07,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:07,070 INFO L225 Difference]: With dead ends: 83 [2019-09-08 06:13:07,070 INFO L226 Difference]: Without dead ends: 79 [2019-09-08 06:13:07,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 716 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-09-08 06:13:07,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-08 06:13:07,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-09-08 06:13:07,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-08 06:13:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 126 transitions. [2019-09-08 06:13:07,100 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 126 transitions. Word has length 708 [2019-09-08 06:13:07,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:07,105 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 126 transitions. [2019-09-08 06:13:07,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 06:13:07,105 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 126 transitions. [2019-09-08 06:13:07,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 926 [2019-09-08 06:13:07,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:07,118 INFO L399 BasicCegarLoop]: trace histogram [135, 135, 108, 67, 67, 67, 67, 67, 67, 67, 41, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:07,119 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:07,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:07,119 INFO L82 PathProgramCache]: Analyzing trace with hash 307237480, now seen corresponding path program 9 times [2019-09-08 06:13:07,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:07,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:07,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:07,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:07,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:07,871 INFO L134 CoverageAnalysis]: Checked inductivity of 50802 backedges. 873 proven. 4774 refuted. 0 times theorem prover too weak. 45155 trivial. 0 not checked. [2019-09-08 06:13:07,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:07,871 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:07,890 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 06:13:08,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-09-08 06:13:08,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:08,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 06:13:08,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:08,652 INFO L134 CoverageAnalysis]: Checked inductivity of 50802 backedges. 14028 proven. 71 refuted. 0 times theorem prover too weak. 36703 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:13:08,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:08,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2019-09-08 06:13:08,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 06:13:08,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 06:13:08,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2019-09-08 06:13:08,659 INFO L87 Difference]: Start difference. First operand 79 states and 126 transitions. Second operand 18 states. [2019-09-08 06:13:09,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:09,649 INFO L93 Difference]: Finished difference Result 192 states and 397 transitions. [2019-09-08 06:13:09,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 06:13:09,649 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 925 [2019-09-08 06:13:09,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:09,652 INFO L225 Difference]: With dead ends: 192 [2019-09-08 06:13:09,652 INFO L226 Difference]: Without dead ends: 123 [2019-09-08 06:13:09,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 978 GetRequests, 927 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=661, Invalid=2095, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 06:13:09,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-08 06:13:09,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 114. [2019-09-08 06:13:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-08 06:13:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2019-09-08 06:13:09,672 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 925 [2019-09-08 06:13:09,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:09,673 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2019-09-08 06:13:09,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 06:13:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2019-09-08 06:13:09,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1499 [2019-09-08 06:13:09,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:09,688 INFO L399 BasicCegarLoop]: trace histogram [219, 219, 177, 109, 109, 109, 109, 109, 109, 109, 68, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:13:09,689 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:09,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:09,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1905168074, now seen corresponding path program 10 times [2019-09-08 06:13:09,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:09,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:09,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:09,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:09,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:13:11,130 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 5891 proven. 3916 refuted. 0 times theorem prover too weak. 124797 trivial. 0 not checked. [2019-09-08 06:13:11,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:13:11,131 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:13:11,141 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 06:13:11,438 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 06:13:11,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:13:11,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 2668 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 06:13:11,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:13:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 6523 proven. 4455 refuted. 0 times theorem prover too weak. 123626 trivial. 0 not checked. [2019-09-08 06:13:12,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:13:12,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 17 [2019-09-08 06:13:12,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 06:13:12,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 06:13:12,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-09-08 06:13:12,891 INFO L87 Difference]: Start difference. First operand 114 states and 169 transitions. Second operand 17 states. [2019-09-08 06:13:13,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:13:13,145 INFO L93 Difference]: Finished difference Result 188 states and 325 transitions. [2019-09-08 06:13:13,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 06:13:13,145 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1498 [2019-09-08 06:13:13,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:13:13,151 INFO L225 Difference]: With dead ends: 188 [2019-09-08 06:13:13,151 INFO L226 Difference]: Without dead ends: 156 [2019-09-08 06:13:13,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1526 GetRequests, 1502 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=205, Invalid=395, Unknown=0, NotChecked=0, Total=600 [2019-09-08 06:13:13,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-09-08 06:13:13,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2019-09-08 06:13:13,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-08 06:13:13,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 237 transitions. [2019-09-08 06:13:13,188 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 237 transitions. Word has length 1498 [2019-09-08 06:13:13,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:13:13,193 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 237 transitions. [2019-09-08 06:13:13,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 06:13:13,193 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 237 transitions. [2019-09-08 06:13:13,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2019-09-08 06:13:13,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:13:13,211 INFO L399 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] [2019-09-08 06:13:13,212 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:13:13,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:13:13,212 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 11 times [2019-09-08 06:13:13,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:13:13,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:13:13,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:13,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:13:13,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:13:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 06:13:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 06:13:14,201 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-08 06:13:14,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 06:13:14 BoogieIcfgContainer [2019-09-08 06:13:14,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 06:13:14,361 INFO L168 Benchmark]: Toolchain (without parser) took 14146.55 ms. Allocated memory was 134.2 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 90.7 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-09-08 06:13:14,362 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 134.2 MB. Free memory was 108.8 MB in the beginning and 108.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 06:13:14,363 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.57 ms. Allocated memory is still 134.2 MB. Free memory was 90.3 MB in the beginning and 81.3 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-09-08 06:13:14,364 INFO L168 Benchmark]: Boogie Preprocessor took 112.08 ms. Allocated memory was 134.2 MB in the beginning and 200.8 MB in the end (delta: 66.6 MB). Free memory was 81.3 MB in the beginning and 178.2 MB in the end (delta: -96.8 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2019-09-08 06:13:14,365 INFO L168 Benchmark]: RCFGBuilder took 218.20 ms. Allocated memory is still 200.8 MB. Free memory was 178.2 MB in the beginning and 166.9 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-09-08 06:13:14,366 INFO L168 Benchmark]: TraceAbstraction took 13582.69 ms. Allocated memory was 200.8 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 166.3 MB in the beginning and 1.1 GB in the end (delta: -973.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-09-08 06:13:14,374 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41 ms. Allocated memory is still 134.2 MB. Free memory was 108.8 MB in the beginning and 108.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 229.57 ms. Allocated memory is still 134.2 MB. Free memory was 90.3 MB in the beginning and 81.3 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 112.08 ms. Allocated memory was 134.2 MB in the beginning and 200.8 MB in the end (delta: 66.6 MB). Free memory was 81.3 MB in the beginning and 178.2 MB in the end (delta: -96.8 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 218.20 ms. Allocated memory is still 200.8 MB. Free memory was 178.2 MB in the beginning and 166.9 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13582.69 ms. Allocated memory was 200.8 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 166.3 MB in the beginning and 1.1 GB in the end (delta: -973.8 MB). Peak memory consumption was 1.1 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. UNSAFE Result, 13.4s OverallTime, 14 OverallIterations, 219 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 262 SDtfs, 449 SDslu, 963 SDs, 0 SdLazy, 1485 SolverSat, 516 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4336 GetRequests, 4124 SyntacticMatches, 2 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 22 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 9407 NumberOfCodeBlocks, 8393 NumberOfCodeBlocksAsserted, 85 NumberOfCheckSat, 8171 ConstructedInterpolants, 0 QuantifiedInterpolants, 8540393 SizeOfPredicates, 61 NumberOfNonLiveVariables, 6652 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 427116/452302 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...