./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ca069cb8d4103e8fb4700634948424bd87542bc ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:56:52,362 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:56:52,364 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:56:52,379 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:56:52,381 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:56:52,382 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:56:52,387 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:56:52,389 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:56:52,393 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:56:52,396 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:56:52,398 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:56:52,399 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:56:52,400 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:56:52,401 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:56:52,405 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:56:52,412 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:56:52,414 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:56:52,417 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:56:52,419 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:56:52,421 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:56:52,422 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:56:52,423 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:56:52,425 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:56:52,425 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:56:52,426 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:56:52,426 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:56:52,427 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:56:52,428 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:56:52,429 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:56:52,430 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:56:52,430 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:56:52,430 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:56:52,431 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:56:52,431 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:56:52,432 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:56:52,432 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:56:52,433 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:56:52,447 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:56:52,447 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:56:52,448 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:56:52,448 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:56:52,449 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:56:52,449 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:56:52,449 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:56:52,449 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:56:52,449 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:56:52,449 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:56:52,450 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:56:52,450 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:56:52,450 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:56:52,450 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:56:52,450 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:56:52,450 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:56:52,451 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:56:52,451 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:56:52,451 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:56:52,451 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:56:52,451 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:56:52,451 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:56:52,452 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:56:52,452 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:56:52,452 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:56:52,452 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:56:52,452 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:56:52,452 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:56:52,453 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ca069cb8d4103e8fb4700634948424bd87542bc [2019-01-12 14:56:52,487 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:56:52,500 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:56:52,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:56:52,505 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:56:52,505 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:56:52,506 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c [2019-01-12 14:56:52,564 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d397a901a/14a2b00c9d4b4b5cb4ef6afd3668192c/FLAGfd63ef934 [2019-01-12 14:56:52,980 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:56:52,981 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c [2019-01-12 14:56:52,986 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d397a901a/14a2b00c9d4b4b5cb4ef6afd3668192c/FLAGfd63ef934 [2019-01-12 14:56:53,361 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d397a901a/14a2b00c9d4b4b5cb4ef6afd3668192c [2019-01-12 14:56:53,365 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:56:53,366 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:56:53,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:56:53,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:56:53,374 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:56:53,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:56:53" (1/1) ... [2019-01-12 14:56:53,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4000b869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:53, skipping insertion in model container [2019-01-12 14:56:53,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:56:53" (1/1) ... [2019-01-12 14:56:53,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:56:53,412 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:56:53,648 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:56:53,655 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:56:53,678 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:56:53,694 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:56:53,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:53 WrapperNode [2019-01-12 14:56:53,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:56:53,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:56:53,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:56:53,696 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:56:53,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:53" (1/1) ... [2019-01-12 14:56:53,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:53" (1/1) ... [2019-01-12 14:56:53,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:56:53,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:56:53,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:56:53,738 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:56:53,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:53" (1/1) ... [2019-01-12 14:56:53,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:53" (1/1) ... [2019-01-12 14:56:53,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:53" (1/1) ... [2019-01-12 14:56:53,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:53" (1/1) ... [2019-01-12 14:56:53,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:53" (1/1) ... [2019-01-12 14:56:53,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:53" (1/1) ... [2019-01-12 14:56:53,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:53" (1/1) ... [2019-01-12 14:56:53,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:56:53,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:56:53,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:56:53,764 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:56:53,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:53" (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-01-12 14:56:53,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:56:53,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:56:53,943 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-01-12 14:56:53,943 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-01-12 14:56:54,203 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:56:54,203 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 14:56:54,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:56:54 BoogieIcfgContainer [2019-01-12 14:56:54,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:56:54,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:56:54,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:56:54,217 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:56:54,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:56:53" (1/3) ... [2019-01-12 14:56:54,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6051b2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:56:54, skipping insertion in model container [2019-01-12 14:56:54,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:56:53" (2/3) ... [2019-01-12 14:56:54,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6051b2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:56:54, skipping insertion in model container [2019-01-12 14:56:54,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:56:54" (3/3) ... [2019-01-12 14:56:54,225 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_10_false-unreach-call_true-termination.c [2019-01-12 14:56:54,255 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:56:54,279 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 14:56:54,304 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 14:56:54,366 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:56:54,366 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:56:54,367 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:56:54,367 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:56:54,367 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:56:54,367 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:56:54,367 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:56:54,367 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:56:54,367 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:56:54,390 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-01-12 14:56:54,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 14:56:54,395 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:54,396 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:54,398 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:54,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:54,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1007516703, now seen corresponding path program 1 times [2019-01-12 14:56:54,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:54,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:54,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:54,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:54,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:54,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:56:54,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:56:54,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:56:54,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:56:54,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:56:54,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:56:54,616 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2019-01-12 14:56:54,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:54,775 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-01-12 14:56:54,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:56:54,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 14:56:54,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:54,786 INFO L225 Difference]: With dead ends: 29 [2019-01-12 14:56:54,786 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 14:56:54,790 INFO L631 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-01-12 14:56:54,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 14:56:54,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-12 14:56:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 14:56:54,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-01-12 14:56:54,831 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2019-01-12 14:56:54,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:54,832 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-12 14:56:54,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:56:54,832 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-01-12 14:56:54,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 14:56:54,834 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:54,834 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:54,834 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:54,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:54,835 INFO L82 PathProgramCache]: Analyzing trace with hash -453503986, now seen corresponding path program 1 times [2019-01-12 14:56:54,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:54,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:54,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:54,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:54,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:56:54,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:56:54,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:56:54,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:56:54,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:56:54,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:56:54,898 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2019-01-12 14:56:55,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:55,120 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-01-12 14:56:55,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:56:55,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-12 14:56:55,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:55,122 INFO L225 Difference]: With dead ends: 23 [2019-01-12 14:56:55,123 INFO L226 Difference]: Without dead ends: 19 [2019-01-12 14:56:55,124 INFO L631 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-01-12 14:56:55,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-12 14:56:55,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-01-12 14:56:55,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 14:56:55,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-01-12 14:56:55,131 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-01-12 14:56:55,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:55,132 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-01-12 14:56:55,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:56:55,132 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-01-12 14:56:55,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 14:56:55,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:55,133 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:55,135 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:55,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:55,135 INFO L82 PathProgramCache]: Analyzing trace with hash 511906889, now seen corresponding path program 1 times [2019-01-12 14:56:55,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:55,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:55,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:55,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:55,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:55,321 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 14:56:55,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:55,321 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:56:55,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:55,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 14:56:55,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:55,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-01-12 14:56:55,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 14:56:55,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 14:56:55,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:56:55,500 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 8 states. [2019-01-12 14:56:55,698 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2019-01-12 14:56:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:55,860 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-01-12 14:56:55,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:56:55,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-01-12 14:56:55,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:55,865 INFO L225 Difference]: With dead ends: 34 [2019-01-12 14:56:55,865 INFO L226 Difference]: Without dead ends: 19 [2019-01-12 14:56:55,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:56:55,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-12 14:56:55,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-12 14:56:55,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-12 14:56:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-01-12 14:56:55,879 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2019-01-12 14:56:55,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:55,880 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-01-12 14:56:55,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 14:56:55,882 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-01-12 14:56:55,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 14:56:55,884 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:55,885 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:55,885 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:55,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:55,885 INFO L82 PathProgramCache]: Analyzing trace with hash 178931364, now seen corresponding path program 1 times [2019-01-12 14:56:55,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:55,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:55,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:55,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:55,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:56,041 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 14:56:56,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:56,042 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-01-12 14:56:56,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:56,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:56,107 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 14:56:56,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:56,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-12 14:56:56,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:56:56,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:56:56,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:56:56,133 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 6 states. [2019-01-12 14:56:56,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:56,474 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2019-01-12 14:56:56,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:56:56,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-01-12 14:56:56,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:56,479 INFO L225 Difference]: With dead ends: 28 [2019-01-12 14:56:56,479 INFO L226 Difference]: Without dead ends: 24 [2019-01-12 14:56:56,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:56:56,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-12 14:56:56,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-12 14:56:56,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-12 14:56:56,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-01-12 14:56:56,497 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 23 [2019-01-12 14:56:56,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:56,497 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-01-12 14:56:56,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:56:56,497 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2019-01-12 14:56:56,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 14:56:56,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:56,500 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:56,500 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:56,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:56,501 INFO L82 PathProgramCache]: Analyzing trace with hash 645818342, now seen corresponding path program 2 times [2019-01-12 14:56:56,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:56,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:56,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:56,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:56:56,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:56,624 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-12 14:56:56,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:56,625 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:56:56,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:56:56,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:56:56,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:56,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-12 14:56:56,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:56,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-01-12 14:56:56,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 14:56:56,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 14:56:56,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:56:56,776 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 8 states. [2019-01-12 14:56:57,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:57,032 INFO L93 Difference]: Finished difference Result 36 states and 56 transitions. [2019-01-12 14:56:57,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:56:57,033 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-01-12 14:56:57,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:57,037 INFO L225 Difference]: With dead ends: 36 [2019-01-12 14:56:57,037 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 14:56:57,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:56:57,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 14:56:57,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-01-12 14:56:57,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 14:56:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2019-01-12 14:56:57,058 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 45 transitions. Word has length 36 [2019-01-12 14:56:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:57,058 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 45 transitions. [2019-01-12 14:56:57,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 14:56:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 45 transitions. [2019-01-12 14:56:57,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-12 14:56:57,062 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:57,062 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 8, 5, 5, 5, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:57,063 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:57,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:57,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1193104726, now seen corresponding path program 3 times [2019-01-12 14:56:57,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:57,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:57,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:57,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:57,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:57,282 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 110 proven. 8 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2019-01-12 14:56:57,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:57,283 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-01-12 14:56:57,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:56:57,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-12 14:56:57,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:57,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:57,487 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 130 proven. 12 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-12 14:56:57,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:57,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-01-12 14:56:57,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 14:56:57,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 14:56:57,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-12 14:56:57,508 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand 11 states. [2019-01-12 14:56:57,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:57,827 INFO L93 Difference]: Finished difference Result 61 states and 109 transitions. [2019-01-12 14:56:57,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:56:57,828 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2019-01-12 14:56:57,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:57,830 INFO L225 Difference]: With dead ends: 61 [2019-01-12 14:56:57,830 INFO L226 Difference]: Without dead ends: 34 [2019-01-12 14:56:57,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-01-12 14:56:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-12 14:56:57,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-01-12 14:56:57,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-12 14:56:57,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2019-01-12 14:56:57,842 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 77 [2019-01-12 14:56:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:57,843 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2019-01-12 14:56:57,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 14:56:57,843 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2019-01-12 14:56:57,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-12 14:56:57,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:57,847 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:57,847 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:57,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:57,848 INFO L82 PathProgramCache]: Analyzing trace with hash -91709127, now seen corresponding path program 4 times [2019-01-12 14:56:57,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:57,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:57,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:57,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:57,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 23 proven. 69 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2019-01-12 14:56:58,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:58,214 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-01-12 14:56:58,224 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:56:58,251 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:56:58,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:58,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:58,433 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-01-12 14:56:58,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:58,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2019-01-12 14:56:58,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-12 14:56:58,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-12 14:56:58,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-01-12 14:56:58,455 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 19 states. [2019-01-12 14:56:59,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:56:59,501 INFO L93 Difference]: Finished difference Result 68 states and 148 transitions. [2019-01-12 14:56:59,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-12 14:56:59,502 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2019-01-12 14:56:59,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:56:59,507 INFO L225 Difference]: With dead ends: 68 [2019-01-12 14:56:59,507 INFO L226 Difference]: Without dead ends: 64 [2019-01-12 14:56:59,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=336, Invalid=1304, Unknown=0, NotChecked=0, Total=1640 [2019-01-12 14:56:59,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-12 14:56:59,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 36. [2019-01-12 14:56:59,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-12 14:56:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2019-01-12 14:56:59,527 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 78 [2019-01-12 14:56:59,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:56:59,527 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2019-01-12 14:56:59,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-12 14:56:59,528 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2019-01-12 14:56:59,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-01-12 14:56:59,531 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:56:59,531 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 23, 13, 13, 13, 13, 13, 13, 13, 10, 4, 1, 1, 1, 1, 1, 1] [2019-01-12 14:56:59,531 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:56:59,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:56:59,532 INFO L82 PathProgramCache]: Analyzing trace with hash -481968661, now seen corresponding path program 5 times [2019-01-12 14:56:59,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:56:59,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:56:59,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:59,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:56:59,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:56:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:56:59,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 254 proven. 314 refuted. 0 times theorem prover too weak. 1401 trivial. 0 not checked. [2019-01-12 14:56:59,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:56:59,776 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-01-12 14:56:59,794 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:56:59,874 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-01-12 14:56:59,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:56:59,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:56:59,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 1139 proven. 17 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2019-01-12 14:56:59,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:56:59,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2019-01-12 14:56:59,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 14:56:59,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 14:56:59,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:56:59,961 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 12 states. [2019-01-12 14:57:00,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:00,315 INFO L93 Difference]: Finished difference Result 84 states and 173 transitions. [2019-01-12 14:57:00,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 14:57:00,317 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 188 [2019-01-12 14:57:00,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:00,321 INFO L225 Difference]: With dead ends: 84 [2019-01-12 14:57:00,322 INFO L226 Difference]: Without dead ends: 50 [2019-01-12 14:57:00,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-01-12 14:57:00,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-12 14:57:00,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2019-01-12 14:57:00,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-12 14:57:00,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 73 transitions. [2019-01-12 14:57:00,335 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 73 transitions. Word has length 188 [2019-01-12 14:57:00,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:00,337 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 73 transitions. [2019-01-12 14:57:00,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 14:57:00,337 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 73 transitions. [2019-01-12 14:57:00,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-01-12 14:57:00,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:00,345 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 27, 15, 15, 15, 15, 15, 15, 15, 12, 4, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:00,345 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:00,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:00,346 INFO L82 PathProgramCache]: Analyzing trace with hash 938563531, now seen corresponding path program 6 times [2019-01-12 14:57:00,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:00,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:00,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:00,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:00,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2631 backedges. 217 proven. 331 refuted. 0 times theorem prover too weak. 2083 trivial. 0 not checked. [2019-01-12 14:57:00,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:00,552 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:00,562 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:57:00,728 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-01-12 14:57:00,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:00,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:00,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2631 backedges. 1174 proven. 4 refuted. 0 times theorem prover too weak. 1453 trivial. 0 not checked. [2019-01-12 14:57:00,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:00,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 14:57:00,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 14:57:00,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 14:57:00,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:57:00,834 INFO L87 Difference]: Start difference. First operand 44 states and 73 transitions. Second operand 7 states. [2019-01-12 14:57:01,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:01,039 INFO L93 Difference]: Finished difference Result 84 states and 152 transitions. [2019-01-12 14:57:01,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:57:01,040 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 216 [2019-01-12 14:57:01,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:01,043 INFO L225 Difference]: With dead ends: 84 [2019-01-12 14:57:01,043 INFO L226 Difference]: Without dead ends: 41 [2019-01-12 14:57:01,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:57:01,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-12 14:57:01,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-12 14:57:01,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 14:57:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2019-01-12 14:57:01,054 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 216 [2019-01-12 14:57:01,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:01,055 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2019-01-12 14:57:01,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 14:57:01,055 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2019-01-12 14:57:01,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-12 14:57:01,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:01,059 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:01,059 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:01,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:01,060 INFO L82 PathProgramCache]: Analyzing trace with hash -2413653, now seen corresponding path program 7 times [2019-01-12 14:57:01,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:01,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:01,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:01,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:01,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 76 proven. 241 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2019-01-12 14:57:01,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:01,218 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-01-12 14:57:01,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:01,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 326 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2019-01-12 14:57:01,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:01,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2019-01-12 14:57:01,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 14:57:01,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 14:57:01,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:57:01,430 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. Second operand 9 states. [2019-01-12 14:57:01,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:01,722 INFO L93 Difference]: Finished difference Result 50 states and 73 transitions. [2019-01-12 14:57:01,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:57:01,723 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-01-12 14:57:01,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:01,726 INFO L225 Difference]: With dead ends: 50 [2019-01-12 14:57:01,726 INFO L226 Difference]: Without dead ends: 46 [2019-01-12 14:57:01,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-12 14:57:01,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-12 14:57:01,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-12 14:57:01,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-12 14:57:01,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 69 transitions. [2019-01-12 14:57:01,734 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 69 transitions. Word has length 132 [2019-01-12 14:57:01,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:01,735 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 69 transitions. [2019-01-12 14:57:01,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 14:57:01,735 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 69 transitions. [2019-01-12 14:57:01,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-01-12 14:57:01,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:01,738 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:01,739 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:01,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:01,739 INFO L82 PathProgramCache]: Analyzing trace with hash 938070515, now seen corresponding path program 8 times [2019-01-12 14:57:01,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:01,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:01,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:01,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:01,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:02,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 137 proven. 567 refuted. 0 times theorem prover too weak. 1876 trivial. 0 not checked. [2019-01-12 14:57:02,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:02,006 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-01-12 14:57:02,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:57:02,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:57:02,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:02,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:02,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2019-01-12 14:57:02,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:02,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 10 [2019-01-12 14:57:02,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 14:57:02,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 14:57:02,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:57:02,188 INFO L87 Difference]: Start difference. First operand 46 states and 69 transitions. Second operand 10 states. [2019-01-12 14:57:02,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:02,497 INFO L93 Difference]: Finished difference Result 55 states and 88 transitions. [2019-01-12 14:57:02,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 14:57:02,501 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 214 [2019-01-12 14:57:02,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:02,502 INFO L225 Difference]: With dead ends: 55 [2019-01-12 14:57:02,503 INFO L226 Difference]: Without dead ends: 51 [2019-01-12 14:57:02,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-12 14:57:02,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-12 14:57:02,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-12 14:57:02,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-12 14:57:02,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 84 transitions. [2019-01-12 14:57:02,513 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 84 transitions. Word has length 214 [2019-01-12 14:57:02,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:02,515 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 84 transitions. [2019-01-12 14:57:02,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 14:57:02,515 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 84 transitions. [2019-01-12 14:57:02,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-01-12 14:57:02,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:02,519 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 44, 27, 27, 27, 27, 27, 27, 27, 17, 11, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:02,519 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:02,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:02,520 INFO L82 PathProgramCache]: Analyzing trace with hash -2072375044, now seen corresponding path program 9 times [2019-01-12 14:57:02,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:02,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:02,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:02,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:02,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:02,813 INFO L134 CoverageAnalysis]: Checked inductivity of 8290 backedges. 286 proven. 1324 refuted. 0 times theorem prover too weak. 6680 trivial. 0 not checked. [2019-01-12 14:57:02,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:02,813 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-01-12 14:57:02,824 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:57:02,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-12 14:57:02,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:03,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 8290 backedges. 2911 proven. 189 refuted. 0 times theorem prover too weak. 5190 trivial. 0 not checked. [2019-01-12 14:57:03,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:03,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2019-01-12 14:57:03,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 14:57:03,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 14:57:03,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-01-12 14:57:03,371 INFO L87 Difference]: Start difference. First operand 51 states and 84 transitions. Second operand 16 states. [2019-01-12 14:57:04,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:04,333 INFO L93 Difference]: Finished difference Result 143 states and 288 transitions. [2019-01-12 14:57:04,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-12 14:57:04,334 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 377 [2019-01-12 14:57:04,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:04,337 INFO L225 Difference]: With dead ends: 143 [2019-01-12 14:57:04,337 INFO L226 Difference]: Without dead ends: 91 [2019-01-12 14:57:04,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=402, Invalid=1238, Unknown=0, NotChecked=0, Total=1640 [2019-01-12 14:57:04,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-12 14:57:04,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2019-01-12 14:57:04,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-12 14:57:04,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 120 transitions. [2019-01-12 14:57:04,351 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 120 transitions. Word has length 377 [2019-01-12 14:57:04,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:04,353 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 120 transitions. [2019-01-12 14:57:04,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 14:57:04,353 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 120 transitions. [2019-01-12 14:57:04,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2019-01-12 14:57:04,357 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:04,358 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:04,358 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:04,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:04,358 INFO L82 PathProgramCache]: Analyzing trace with hash 187396788, now seen corresponding path program 10 times [2019-01-12 14:57:04,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:04,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:04,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:04,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:04,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 1412 proven. 592 refuted. 0 times theorem prover too weak. 10383 trivial. 0 not checked. [2019-01-12 14:57:04,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:04,662 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-01-12 14:57:04,671 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:57:04,789 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:57:04,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:04,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 361 proven. 2270 refuted. 0 times theorem prover too weak. 9756 trivial. 0 not checked. [2019-01-12 14:57:05,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:05,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 12 [2019-01-12 14:57:05,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 14:57:05,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 14:57:05,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-12 14:57:05,009 INFO L87 Difference]: Start difference. First operand 86 states and 120 transitions. Second operand 12 states. [2019-01-12 14:57:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:05,216 INFO L93 Difference]: Finished difference Result 95 states and 139 transitions. [2019-01-12 14:57:05,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 14:57:05,218 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 459 [2019-01-12 14:57:05,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:05,222 INFO L225 Difference]: With dead ends: 95 [2019-01-12 14:57:05,222 INFO L226 Difference]: Without dead ends: 91 [2019-01-12 14:57:05,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 463 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-12 14:57:05,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-12 14:57:05,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-12 14:57:05,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-12 14:57:05,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 134 transitions. [2019-01-12 14:57:05,236 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 134 transitions. Word has length 459 [2019-01-12 14:57:05,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:05,237 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 134 transitions. [2019-01-12 14:57:05,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 14:57:05,237 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 134 transitions. [2019-01-12 14:57:05,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 841 [2019-01-12 14:57:05,246 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:05,246 INFO L402 BasicCegarLoop]: trace histogram [123, 123, 99, 61, 61, 61, 61, 61, 61, 61, 38, 24, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:05,247 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:05,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:05,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1498180189, now seen corresponding path program 11 times [2019-01-12 14:57:05,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:05,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:05,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:05,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:05,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:05,910 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-01-12 14:57:06,094 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 6 [2019-01-12 14:57:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 42183 backedges. 2949 proven. 1608 refuted. 0 times theorem prover too weak. 37626 trivial. 0 not checked. [2019-01-12 14:57:06,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:06,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:06,396 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:57:06,641 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 55 check-sat command(s) [2019-01-12 14:57:06,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:06,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:07,112 INFO L134 CoverageAnalysis]: Checked inductivity of 42183 backedges. 21877 proven. 948 refuted. 0 times theorem prover too weak. 19358 trivial. 0 not checked. [2019-01-12 14:57:07,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:07,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 18 [2019-01-12 14:57:07,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 14:57:07,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 14:57:07,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-01-12 14:57:07,150 INFO L87 Difference]: Start difference. First operand 91 states and 134 transitions. Second operand 18 states. [2019-01-12 14:57:08,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:08,137 INFO L93 Difference]: Finished difference Result 194 states and 344 transitions. [2019-01-12 14:57:08,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 14:57:08,138 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 840 [2019-01-12 14:57:08,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:08,148 INFO L225 Difference]: With dead ends: 194 [2019-01-12 14:57:08,148 INFO L226 Difference]: Without dead ends: 109 [2019-01-12 14:57:08,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 869 GetRequests, 838 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=261, Invalid=795, Unknown=0, NotChecked=0, Total=1056 [2019-01-12 14:57:08,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-12 14:57:08,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 94. [2019-01-12 14:57:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-12 14:57:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 137 transitions. [2019-01-12 14:57:08,178 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 137 transitions. Word has length 840 [2019-01-12 14:57:08,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:08,183 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 137 transitions. [2019-01-12 14:57:08,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 14:57:08,183 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 137 transitions. [2019-01-12 14:57:08,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 923 [2019-01-12 14:57:08,198 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:08,199 INFO L402 BasicCegarLoop]: trace histogram [135, 135, 109, 67, 67, 67, 67, 67, 67, 67, 42, 26, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:08,199 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:08,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:08,200 INFO L82 PathProgramCache]: Analyzing trace with hash -904244701, now seen corresponding path program 12 times [2019-01-12 14:57:08,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:08,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:08,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:08,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:08,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:09,024 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 768 proven. 4887 refuted. 0 times theorem prover too weak. 45255 trivial. 0 not checked. [2019-01-12 14:57:09,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:09,025 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:09,038 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:57:09,226 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2019-01-12 14:57:09,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:57:09,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 1363 proven. 4292 refuted. 0 times theorem prover too weak. 45255 trivial. 0 not checked. [2019-01-12 14:57:10,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:10,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-12 14:57:10,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 14:57:10,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 14:57:10,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-12 14:57:10,254 INFO L87 Difference]: Start difference. First operand 94 states and 137 transitions. Second operand 13 states. [2019-01-12 14:57:10,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:10,814 INFO L93 Difference]: Finished difference Result 103 states and 158 transitions. [2019-01-12 14:57:10,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 14:57:10,815 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 922 [2019-01-12 14:57:10,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:10,820 INFO L225 Difference]: With dead ends: 103 [2019-01-12 14:57:10,820 INFO L226 Difference]: Without dead ends: 99 [2019-01-12 14:57:10,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 949 GetRequests, 929 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-01-12 14:57:10,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-12 14:57:10,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-12 14:57:10,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-12 14:57:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 153 transitions. [2019-01-12 14:57:10,834 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 153 transitions. Word has length 922 [2019-01-12 14:57:10,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:10,835 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 153 transitions. [2019-01-12 14:57:10,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 14:57:10,835 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 153 transitions. [2019-01-12 14:57:10,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1713 [2019-01-12 14:57:10,862 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:10,863 INFO L402 BasicCegarLoop]: trace histogram [251, 251, 203, 125, 125, 125, 125, 125, 125, 125, 78, 48, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:10,863 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:10,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:10,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1758612715, now seen corresponding path program 13 times [2019-01-12 14:57:10,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:10,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:10,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:10,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:57:10,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:12,540 INFO L134 CoverageAnalysis]: Checked inductivity of 177003 backedges. 3214 proven. 9446 refuted. 0 times theorem prover too weak. 164343 trivial. 0 not checked. [2019-01-12 14:57:12,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:57:12,541 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:57:12,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:57:13,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:57:14,171 INFO L134 CoverageAnalysis]: Checked inductivity of 177003 backedges. 3226 proven. 9426 refuted. 0 times theorem prover too weak. 164351 trivial. 0 not checked. [2019-01-12 14:57:14,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:57:14,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 17 [2019-01-12 14:57:14,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 14:57:14,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 14:57:14,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-01-12 14:57:14,194 INFO L87 Difference]: Start difference. First operand 99 states and 153 transitions. Second operand 17 states. [2019-01-12 14:57:14,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:57:14,576 INFO L93 Difference]: Finished difference Result 135 states and 296 transitions. [2019-01-12 14:57:14,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 14:57:14,577 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 1712 [2019-01-12 14:57:14,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:57:14,583 INFO L225 Difference]: With dead ends: 135 [2019-01-12 14:57:14,583 INFO L226 Difference]: Without dead ends: 99 [2019-01-12 14:57:14,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1742 GetRequests, 1718 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=395, Unknown=0, NotChecked=0, Total=600 [2019-01-12 14:57:14,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-12 14:57:14,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-12 14:57:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-12 14:57:14,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 133 transitions. [2019-01-12 14:57:14,597 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 133 transitions. Word has length 1712 [2019-01-12 14:57:14,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:57:14,598 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 133 transitions. [2019-01-12 14:57:14,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 14:57:14,599 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 133 transitions. [2019-01-12 14:57:14,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2019-01-12 14:57:14,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:57:14,613 INFO L402 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1] [2019-01-12 14:57:14,614 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:57:14,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:57:14,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1577357454, now seen corresponding path program 14 times [2019-01-12 14:57:14,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:57:14,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:57:14,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:14,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:57:14,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:57:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:57:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:57:14,888 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:57:15,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:57:15 BoogieIcfgContainer [2019-01-12 14:57:15,095 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:57:15,096 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:57:15,096 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:57:15,096 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:57:15,097 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:56:54" (3/4) ... [2019-01-12 14:57:15,099 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:57:15,343 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:57:15,343 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:57:15,345 INFO L168 Benchmark]: Toolchain (without parser) took 21979.59 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 952.7 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-01-12 14:57:15,346 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:57:15,346 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.04 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:57:15,347 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.28 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:57:15,347 INFO L168 Benchmark]: Boogie Preprocessor took 24.50 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:57:15,347 INFO L168 Benchmark]: RCFGBuilder took 447.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -196.9 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-01-12 14:57:15,347 INFO L168 Benchmark]: TraceAbstraction took 20884.38 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.1 GB in the beginning and 811.8 MB in the end (delta: 320.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-01-12 14:57:15,348 INFO L168 Benchmark]: Witness Printer took 247.76 ms. Allocated memory was 2.5 GB in the beginning and 2.7 GB in the end (delta: 257.9 MB). Free memory was 811.8 MB in the beginning and 2.6 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:57:15,350 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 327.04 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.28 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.50 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 447.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -196.9 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20884.38 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.1 GB in the beginning and 811.8 MB in the end (delta: 320.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 247.76 ms. Allocated memory was 2.5 GB in the beginning and 2.7 GB in the end (delta: 257.9 MB). Free memory was 811.8 MB in the beginning and 2.6 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 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; [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) [L25] int result = fibo(x); [L26] COND TRUE result == 55 [L27] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. UNSAFE Result, 20.7s OverallTime, 17 OverallIterations, 251 TraceHistogramMax, 7.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 255 SDtfs, 512 SDslu, 745 SDs, 0 SdLazy, 1822 SolverSat, 627 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5607 GetRequests, 5334 SyntacticMatches, 2 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1179 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=15, 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, 16 MinimizatonAttempts, 62 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 11819 NumberOfCodeBlocks, 10299 NumberOfCodeBlocksAsserted, 156 NumberOfCheckSat, 10581 ConstructedInterpolants, 0 QuantifiedInterpolants, 11208581 SizeOfPredicates, 84 NumberOfNonLiveVariables, 8363 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 30 InterpolantComputations, 2 PerfectInterpolantSequences, 561320/599084 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...