./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0818ccf-dd76-42a7-8cfd-27d21b655e13/bin/ukojak-verify-CZk0znPC7b/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0818ccf-dd76-42a7-8cfd-27d21b655e13/bin/ukojak-verify-CZk0znPC7b/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0818ccf-dd76-42a7-8cfd-27d21b655e13/bin/ukojak-verify-CZk0znPC7b/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0818ccf-dd76-42a7-8cfd-27d21b655e13/bin/ukojak-verify-CZk0znPC7b/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0818ccf-dd76-42a7-8cfd-27d21b655e13/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0818ccf-dd76-42a7-8cfd-27d21b655e13/bin/ukojak-verify-CZk0znPC7b --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad793266928b7f31f4ee1b23974468bb9f6761486c9c1aae6fbee8a7b7aca3db --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-05 22:21:20,208 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-05 22:21:20,259 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0818ccf-dd76-42a7-8cfd-27d21b655e13/bin/ukojak-verify-CZk0znPC7b/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-12-05 22:21:20,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-05 22:21:20,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-12-05 22:21:20,282 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-05 22:21:20,282 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-05 22:21:20,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-12-05 22:21:20,283 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-05 22:21:20,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-05 22:21:20,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-05 22:21:20,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-05 22:21:20,283 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-05 22:21:20,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-05 22:21:20,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-05 22:21:20,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-05 22:21:20,284 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-05 22:21:20,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-05 22:21:20,284 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-05 22:21:20,284 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-05 22:21:20,284 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-05 22:21:20,284 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-05 22:21:20,284 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-05 22:21:20,284 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-12-05 22:21:20,284 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-12-05 22:21:20,284 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-12-05 22:21:20,284 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-05 22:21:20,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 22:21:20,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-05 22:21:20,285 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-05 22:21:20,285 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-05 22:21:20,285 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-12-05 22:21:20,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-05 22:21:20,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0818ccf-dd76-42a7-8cfd-27d21b655e13/bin/ukojak-verify-CZk0znPC7b Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak 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 -> ad793266928b7f31f4ee1b23974468bb9f6761486c9c1aae6fbee8a7b7aca3db [2024-12-05 22:21:20,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-05 22:21:20,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-05 22:21:20,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-05 22:21:20,514 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-05 22:21:20,514 INFO L274 PluginConnector]: CDTParser initialized [2024-12-05 22:21:20,516 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0818ccf-dd76-42a7-8cfd-27d21b655e13/bin/ukojak-verify-CZk0znPC7b/../../sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2024-12-05 22:21:23,198 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0818ccf-dd76-42a7-8cfd-27d21b655e13/bin/ukojak-verify-CZk0znPC7b/data/de652c758/4d0267089e2b4daea1933e575190363e/FLAG14ea687dd [2024-12-05 22:21:23,366 INFO L384 CDTParser]: Found 1 translation units. [2024-12-05 22:21:23,367 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0818ccf-dd76-42a7-8cfd-27d21b655e13/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c [2024-12-05 22:21:23,374 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0818ccf-dd76-42a7-8cfd-27d21b655e13/bin/ukojak-verify-CZk0znPC7b/data/de652c758/4d0267089e2b4daea1933e575190363e/FLAG14ea687dd [2024-12-05 22:21:23,389 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0818ccf-dd76-42a7-8cfd-27d21b655e13/bin/ukojak-verify-CZk0znPC7b/data/de652c758/4d0267089e2b4daea1933e575190363e [2024-12-05 22:21:23,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-05 22:21:23,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-05 22:21:23,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-05 22:21:23,395 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-05 22:21:23,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-05 22:21:23,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:21:23" (1/1) ... [2024-12-05 22:21:23,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42798d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:21:23, skipping insertion in model container [2024-12-05 22:21:23,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:21:23" (1/1) ... [2024-12-05 22:21:23,415 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-05 22:21:23,557 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0818ccf-dd76-42a7-8cfd-27d21b655e13/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c[949,962] [2024-12-05 22:21:23,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 22:21:23,569 INFO L200 MainTranslator]: Completed pre-run [2024-12-05 22:21:23,581 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0818ccf-dd76-42a7-8cfd-27d21b655e13/sv-benchmarks/c/recursive-simple/fibo_2calls_10-2.c[949,962] [2024-12-05 22:21:23,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-05 22:21:23,595 INFO L204 MainTranslator]: Completed translation [2024-12-05 22:21:23,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:21:23 WrapperNode [2024-12-05 22:21:23,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-05 22:21:23,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-05 22:21:23,597 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-05 22:21:23,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-05 22:21:23,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:21:23" (1/1) ... [2024-12-05 22:21:23,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:21:23" (1/1) ... [2024-12-05 22:21:23,621 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-12-05 22:21:23,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-05 22:21:23,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-05 22:21:23,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-05 22:21:23,622 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-05 22:21:23,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:21:23" (1/1) ... [2024-12-05 22:21:23,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:21:23" (1/1) ... [2024-12-05 22:21:23,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:21:23" (1/1) ... [2024-12-05 22:21:23,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:21:23" (1/1) ... [2024-12-05 22:21:23,631 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:21:23" (1/1) ... [2024-12-05 22:21:23,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:21:23" (1/1) ... [2024-12-05 22:21:23,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:21:23" (1/1) ... [2024-12-05 22:21:23,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:21:23" (1/1) ... [2024-12-05 22:21:23,635 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:21:23" (1/1) ... [2024-12-05 22:21:23,636 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-05 22:21:23,637 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-05 22:21:23,637 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-05 22:21:23,637 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-05 22:21:23,638 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:21:23" (1/1) ... [2024-12-05 22:21:23,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-12-05 22:21:23,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0818ccf-dd76-42a7-8cfd-27d21b655e13/bin/ukojak-verify-CZk0znPC7b/z3 [2024-12-05 22:21:23,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0818ccf-dd76-42a7-8cfd-27d21b655e13/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-12-05 22:21:23,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0818ccf-dd76-42a7-8cfd-27d21b655e13/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-12-05 22:21:23,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-05 22:21:23,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-05 22:21:23,690 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2024-12-05 22:21:23,690 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2024-12-05 22:21:23,690 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2024-12-05 22:21:23,690 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2024-12-05 22:21:23,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-05 22:21:23,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-05 22:21:23,737 INFO L234 CfgBuilder]: Building ICFG [2024-12-05 22:21:23,738 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-05 22:21:23,847 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-12-05 22:21:23,847 INFO L283 CfgBuilder]: Performing block encoding [2024-12-05 22:21:23,865 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-05 22:21:23,865 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-05 22:21:23,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:21:23 BoogieIcfgContainer [2024-12-05 22:21:23,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-05 22:21:23,867 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-12-05 22:21:23,867 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-12-05 22:21:23,875 INFO L274 PluginConnector]: CodeCheck initialized [2024-12-05 22:21:23,875 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:21:23" (1/1) ... [2024-12-05 22:21:23,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-05 22:21:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:23,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 26 states and 33 transitions. [2024-12-05 22:21:23,923 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-12-05 22:21:23,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-12-05 22:21:23,926 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:23,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:24,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:21:24,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 30 states and 39 transitions. [2024-12-05 22:21:24,174 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2024-12-05 22:21:24,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-12-05 22:21:24,174 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:24,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:24,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-05 22:21:24,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:24,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 34 states and 46 transitions. [2024-12-05 22:21:24,435 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2024-12-05 22:21:24,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-12-05 22:21:24,436 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:24,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 22:21:24,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:24,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 36 states and 50 transitions. [2024-12-05 22:21:24,703 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2024-12-05 22:21:24,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-12-05 22:21:24,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:24,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-12-05 22:21:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 43 states and 66 transitions. [2024-12-05 22:21:25,401 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 66 transitions. [2024-12-05 22:21:25,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-12-05 22:21:25,402 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:25,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:25,563 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 22:21:25,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:25,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 45 states and 69 transitions. [2024-12-05 22:21:25,910 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 69 transitions. [2024-12-05 22:21:25,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-12-05 22:21:25,911 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:25,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:26,187 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-12-05 22:21:26,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:26,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 45 states and 66 transitions. [2024-12-05 22:21:26,818 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2024-12-05 22:21:26,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-12-05 22:21:26,820 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:26,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:27,022 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-05 22:21:28,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 57 states and 95 transitions. [2024-12-05 22:21:28,168 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 95 transitions. [2024-12-05 22:21:28,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-12-05 22:21:28,170 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:28,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:28,250 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-12-05 22:21:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:28,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 57 states and 94 transitions. [2024-12-05 22:21:28,461 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 94 transitions. [2024-12-05 22:21:28,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-12-05 22:21:28,463 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:28,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:28,904 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-12-05 22:21:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:30,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 62 states and 104 transitions. [2024-12-05 22:21:30,307 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2024-12-05 22:21:30,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-12-05 22:21:30,308 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:30,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 9 proven. 62 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-12-05 22:21:31,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:31,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 74 states and 132 transitions. [2024-12-05 22:21:31,753 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 132 transitions. [2024-12-05 22:21:31,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-12-05 22:21:31,754 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:31,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 15 proven. 54 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-12-05 22:21:32,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:32,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 76 states and 134 transitions. [2024-12-05 22:21:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 134 transitions. [2024-12-05 22:21:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-12-05 22:21:32,137 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:32,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 36 proven. 151 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2024-12-05 22:21:33,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:33,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 86 states and 162 transitions. [2024-12-05 22:21:33,475 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 162 transitions. [2024-12-05 22:21:33,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-12-05 22:21:33,478 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:33,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:33,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 51 proven. 299 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2024-12-05 22:21:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 88 states and 164 transitions. [2024-12-05 22:21:34,024 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 164 transitions. [2024-12-05 22:21:34,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-12-05 22:21:34,027 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:34,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:34,198 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 44 proven. 193 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2024-12-05 22:21:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:34,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 90 states and 166 transitions. [2024-12-05 22:21:34,510 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 166 transitions. [2024-12-05 22:21:34,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-12-05 22:21:34,513 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:34,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:34,850 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 51 proven. 218 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2024-12-05 22:21:36,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:36,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 102 states and 199 transitions. [2024-12-05 22:21:36,279 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 199 transitions. [2024-12-05 22:21:36,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-12-05 22:21:36,280 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:36,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:36,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1603 backedges. 66 proven. 401 refuted. 0 times theorem prover too weak. 1136 trivial. 0 not checked. [2024-12-05 22:21:36,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:36,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 104 states and 201 transitions. [2024-12-05 22:21:36,793 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 201 transitions. [2024-12-05 22:21:36,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2024-12-05 22:21:36,796 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:36,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:37,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4405 backedges. 159 proven. 800 refuted. 0 times theorem prover too weak. 3446 trivial. 0 not checked. [2024-12-05 22:21:38,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:38,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 114 states and 235 transitions. [2024-12-05 22:21:38,701 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 235 transitions. [2024-12-05 22:21:38,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2024-12-05 22:21:38,704 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:38,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:39,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4405 backedges. 446 proven. 479 refuted. 0 times theorem prover too weak. 3480 trivial. 0 not checked. [2024-12-05 22:21:40,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:40,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 116 states and 235 transitions. [2024-12-05 22:21:40,461 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 235 transitions. [2024-12-05 22:21:40,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2024-12-05 22:21:40,471 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:40,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:41,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8169 backedges. 773 proven. 904 refuted. 0 times theorem prover too weak. 6492 trivial. 0 not checked. [2024-12-05 22:21:41,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 116 states and 234 transitions. [2024-12-05 22:21:41,843 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 234 transitions. [2024-12-05 22:21:41,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2024-12-05 22:21:41,846 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:41,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:42,235 INFO L134 CoverageAnalysis]: Checked inductivity of 7252 backedges. 208 proven. 1067 refuted. 0 times theorem prover too weak. 5977 trivial. 0 not checked. [2024-12-05 22:21:42,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 118 states and 236 transitions. [2024-12-05 22:21:42,630 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 236 transitions. [2024-12-05 22:21:42,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2024-12-05 22:21:42,638 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:42,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:43,254 INFO L134 CoverageAnalysis]: Checked inductivity of 12466 backedges. 233 proven. 1458 refuted. 0 times theorem prover too weak. 10775 trivial. 0 not checked. [2024-12-05 22:21:43,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 120 states and 238 transitions. [2024-12-05 22:21:43,611 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 238 transitions. [2024-12-05 22:21:43,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2024-12-05 22:21:43,614 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:43,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 8499 backedges. 873 proven. 1206 refuted. 0 times theorem prover too weak. 6420 trivial. 0 not checked. [2024-12-05 22:21:45,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 122 states and 238 transitions. [2024-12-05 22:21:45,357 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 238 transitions. [2024-12-05 22:21:45,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2024-12-05 22:21:45,367 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:45,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:46,259 INFO L134 CoverageAnalysis]: Checked inductivity of 15766 backedges. 257 proven. 1926 refuted. 0 times theorem prover too weak. 13583 trivial. 0 not checked. [2024-12-05 22:21:48,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 134 states and 273 transitions. [2024-12-05 22:21:48,099 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 273 transitions. [2024-12-05 22:21:48,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1085 [2024-12-05 22:21:48,105 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:48,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:49,360 INFO L134 CoverageAnalysis]: Checked inductivity of 35191 backedges. 396 proven. 2939 refuted. 0 times theorem prover too weak. 31856 trivial. 0 not checked. [2024-12-05 22:21:49,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:49,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 136 states and 275 transitions. [2024-12-05 22:21:49,726 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 275 transitions. [2024-12-05 22:21:49,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1193 [2024-12-05 22:21:49,733 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:49,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:51,506 INFO L134 CoverageAnalysis]: Checked inductivity of 42589 backedges. 503 proven. 3673 refuted. 0 times theorem prover too weak. 38413 trivial. 0 not checked. [2024-12-05 22:21:53,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:53,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 146 states and 311 transitions. [2024-12-05 22:21:53,200 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 311 transitions. [2024-12-05 22:21:53,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1759 [2024-12-05 22:21:53,212 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:53,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:56,032 INFO L134 CoverageAnalysis]: Checked inductivity of 93854 backedges. 746 proven. 5471 refuted. 0 times theorem prover too weak. 87637 trivial. 0 not checked. [2024-12-05 22:21:56,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 148 states and 313 transitions. [2024-12-05 22:21:56,436 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 313 transitions. [2024-12-05 22:21:56,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1103 [2024-12-05 22:21:56,442 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:56,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:21:57,545 INFO L134 CoverageAnalysis]: Checked inductivity of 36354 backedges. 749 proven. 3084 refuted. 0 times theorem prover too weak. 32521 trivial. 0 not checked. [2024-12-05 22:21:58,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:21:58,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 150 states and 315 transitions. [2024-12-05 22:21:58,041 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 315 transitions. [2024-12-05 22:21:58,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2989 [2024-12-05 22:21:58,093 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:21:58,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:21:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:22:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 270167 backedges. 1162 proven. 9646 refuted. 0 times theorem prover too weak. 259359 trivial. 0 not checked. [2024-12-05 22:22:05,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:22:05,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 152 states and 317 transitions. [2024-12-05 22:22:05,993 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 317 transitions. [2024-12-05 22:22:06,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1358 [2024-12-05 22:22:06,001 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:22:06,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:22:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:22:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 55273 backedges. 815 proven. 2904 refuted. 0 times theorem prover too weak. 51554 trivial. 0 not checked. [2024-12-05 22:22:07,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:22:07,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 152 states and 315 transitions. [2024-12-05 22:22:07,800 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 315 transitions. [2024-12-05 22:22:07,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2177 [2024-12-05 22:22:07,819 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:22:07,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:22:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:22:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 142957 backedges. 1418 proven. 6415 refuted. 0 times theorem prover too weak. 135124 trivial. 0 not checked. [2024-12-05 22:22:11,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:22:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 154 states and 317 transitions. [2024-12-05 22:22:11,231 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 317 transitions. [2024-12-05 22:22:11,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2462 [2024-12-05 22:22:11,255 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:22:11,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:22:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:22:17,719 INFO L134 CoverageAnalysis]: Checked inductivity of 183162 backedges. 1374 proven. 7827 refuted. 0 times theorem prover too weak. 173961 trivial. 0 not checked. [2024-12-05 22:22:21,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:22:21,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 151 states and 246 transitions. [2024-12-05 22:22:21,241 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 246 transitions. [2024-12-05 22:22:21,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2393 [2024-12-05 22:22:21,279 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:22:21,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:22:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:22:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 172801 backedges. 1330 proven. 5654 refuted. 0 times theorem prover too weak. 165817 trivial. 0 not checked. [2024-12-05 22:22:27,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:22:27,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 153 states and 241 transitions. [2024-12-05 22:22:27,035 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 241 transitions. [2024-12-05 22:22:27,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1248 [2024-12-05 22:22:27,042 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:22:27,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:22:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:22:28,345 INFO L134 CoverageAnalysis]: Checked inductivity of 46537 backedges. 902 proven. 2496 refuted. 0 times theorem prover too weak. 43139 trivial. 0 not checked. [2024-12-05 22:22:28,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:22:28,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 153 states and 240 transitions. [2024-12-05 22:22:28,748 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 240 transitions. [2024-12-05 22:22:28,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1318 [2024-12-05 22:22:28,756 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:22:28,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:22:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:22:31,121 INFO L134 CoverageAnalysis]: Checked inductivity of 51907 backedges. 1496 proven. 3302 refuted. 0 times theorem prover too weak. 47109 trivial. 0 not checked. [2024-12-05 22:22:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:22:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 153 states and 236 transitions. [2024-12-05 22:22:31,578 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 236 transitions. [2024-12-05 22:22:31,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1100 [2024-12-05 22:22:31,588 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:22:31,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:22:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:22:33,442 INFO L134 CoverageAnalysis]: Checked inductivity of 36012 backedges. 2893 proven. 2048 refuted. 0 times theorem prover too weak. 31071 trivial. 0 not checked. [2024-12-05 22:22:33,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:22:33,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 153 states and 235 transitions. [2024-12-05 22:22:33,982 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 235 transitions. [2024-12-05 22:22:33,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2024-12-05 22:22:33,989 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:22:33,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:22:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:22:35,192 INFO L134 CoverageAnalysis]: Checked inductivity of 43597 backedges. 2596 proven. 678 refuted. 0 times theorem prover too weak. 40323 trivial. 0 not checked. [2024-12-05 22:22:35,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:22:35,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 153 states and 234 transitions. [2024-12-05 22:22:35,623 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 234 transitions. [2024-12-05 22:22:35,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1849 [2024-12-05 22:22:35,637 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:22:35,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:22:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:22:38,670 INFO L134 CoverageAnalysis]: Checked inductivity of 102769 backedges. 2089 proven. 3263 refuted. 0 times theorem prover too weak. 97417 trivial. 0 not checked. [2024-12-05 22:22:39,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:22:39,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 153 states and 229 transitions. [2024-12-05 22:22:39,147 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 229 transitions. [2024-12-05 22:22:39,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1331 [2024-12-05 22:22:39,155 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:22:39,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:22:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:22:41,231 INFO L134 CoverageAnalysis]: Checked inductivity of 52936 backedges. 2638 proven. 1693 refuted. 0 times theorem prover too weak. 48605 trivial. 0 not checked. [2024-12-05 22:22:41,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:22:41,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 153 states and 227 transitions. [2024-12-05 22:22:41,701 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 227 transitions. [2024-12-05 22:22:41,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1045 [2024-12-05 22:22:41,709 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:22:41,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:22:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-05 22:22:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 32449 backedges. 1054 proven. 941 refuted. 0 times theorem prover too weak. 30454 trivial. 0 not checked. [2024-12-05 22:22:42,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-12-05 22:22:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 153 states and 224 transitions. [2024-12-05 22:22:42,816 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 224 transitions. [2024-12-05 22:22:42,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2024-12-05 22:22:42,823 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-12-05 22:22:42,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-05 22:22:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 22:22:42,958 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 22:22:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 22:22:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 22:22:43,711 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-05 22:22:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-05 22:22:44,064 WARN L473 CodeCheckObserver]: This program is UNSAFE, Check terminated with 40 iterations. [2024-12-05 22:22:44,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 05.12 10:22:44 ImpRootNode [2024-12-05 22:22:44,192 INFO L131 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2024-12-05 22:22:44,192 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-12-05 22:22:44,192 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-12-05 22:22:44,193 INFO L274 PluginConnector]: Witness Printer initialized [2024-12-05 22:22:44,193 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:21:23" (3/4) ... [2024-12-05 22:22:44,194 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-12-05 22:22:44,341 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 676. [2024-12-05 22:22:44,560 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0818ccf-dd76-42a7-8cfd-27d21b655e13/bin/ukojak-verify-CZk0znPC7b/witness.graphml [2024-12-05 22:22:44,561 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0818ccf-dd76-42a7-8cfd-27d21b655e13/bin/ukojak-verify-CZk0znPC7b/witness.yml [2024-12-05 22:22:44,562 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-12-05 22:22:44,563 INFO L158 Benchmark]: Toolchain (without parser) took 81169.36ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 92.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 870.1MB. Max. memory is 16.1GB. [2024-12-05 22:22:44,563 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 22:22:44,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.48ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 81.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 22:22:44,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.67ms. Allocated memory is still 117.4MB. Free memory was 81.4MB in the beginning and 80.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 22:22:44,564 INFO L158 Benchmark]: Boogie Preprocessor took 14.42ms. Allocated memory is still 117.4MB. Free memory was 80.4MB in the beginning and 79.7MB in the end (delta: 623.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-05 22:22:44,564 INFO L158 Benchmark]: RCFGBuilder took 229.50ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 69.4MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 22:22:44,564 INFO L158 Benchmark]: CodeCheck took 80324.81ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 69.4MB in the beginning and 547.6MB in the end (delta: -478.2MB). Peak memory consumption was 836.6MB. Max. memory is 16.1GB. [2024-12-05 22:22:44,565 INFO L158 Benchmark]: Witness Printer took 369.41ms. Allocated memory is still 1.4GB. Free memory was 547.6MB in the beginning and 1.3GB in the end (delta: -792.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-05 22:22:44,566 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 80.2s, OverallIterations: 40, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9101 SdHoareTripleChecker+Valid, 53.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6261 mSDsluCounter, 10772 SdHoareTripleChecker+Invalid, 45.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7350 mSDsCounter, 13716 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48400 IncrementalHoareTripleChecker+Invalid, 62116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13716 mSolverCounterUnsat, 3422 mSDtfsCounter, 48400 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83088 GetRequests, 81081 SyntacticMatches, 1579 SemanticMatches, 428 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106060 ImplicationChecksByTransitivity, 28.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.4s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 47.5s InterpolantComputationTime, 31877 NumberOfCodeBlocks, 31877 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 30630 ConstructedInterpolants, 0 QuantifiedInterpolants, 34440 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 2 PerfectInterpolantSequences, 1393251/1464552 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 10; VAL [x=10] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=10] [L10] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L12] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=9] [L20] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L22] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=9, n=9] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=7] [L10] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L12] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=9, n=9] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=10, n=10] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=8] [L20] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L22] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=7] [L10] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L12] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=8, n=8] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=8, n=8] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=10, n=10] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [x=10] [L39] int result = fibo1(x); [L40] COND TRUE result == 55 VAL [x=10] [L41] reach_error() VAL [x=10] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.48ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 81.4MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.67ms. Allocated memory is still 117.4MB. Free memory was 81.4MB in the beginning and 80.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.42ms. Allocated memory is still 117.4MB. Free memory was 80.4MB in the beginning and 79.7MB in the end (delta: 623.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 229.50ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 69.4MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * CodeCheck took 80324.81ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 69.4MB in the beginning and 547.6MB in the end (delta: -478.2MB). Peak memory consumption was 836.6MB. Max. memory is 16.1GB. * Witness Printer took 369.41ms. Allocated memory is still 1.4GB. Free memory was 547.6MB in the beginning and 1.3GB in the end (delta: -792.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. RESULT: Ultimate proved your program to be incorrect! [2024-12-05 22:22:44,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0818ccf-dd76-42a7-8cfd-27d21b655e13/bin/ukojak-verify-CZk0znPC7b/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE