./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ca069cb8d4103e8fb4700634948424bd87542bc ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:38:00,494 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:38:00,495 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:38:00,503 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:38:00,504 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:38:00,504 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:38:00,505 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:38:00,506 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:38:00,507 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:38:00,508 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:38:00,509 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:38:00,509 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:38:00,509 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:38:00,510 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:38:00,511 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:38:00,511 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:38:00,512 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:38:00,513 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:38:00,514 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:38:00,515 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:38:00,516 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:38:00,517 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:38:00,518 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:38:00,518 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:38:00,519 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:38:00,519 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:38:00,520 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:38:00,520 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:38:00,521 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:38:00,521 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:38:00,522 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:38:00,522 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:38:00,522 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:38:00,522 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:38:00,523 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:38:00,523 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:38:00,524 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 12:38:00,532 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:38:00,533 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:38:00,533 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:38:00,533 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 12:38:00,534 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:38:00,534 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:38:00,534 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:38:00,534 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:38:00,534 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:38:00,535 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:38:00,535 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:38:00,535 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:38:00,535 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:38:00,535 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:38:00,535 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:38:00,535 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:38:00,535 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:38:00,536 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:38:00,536 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:38:00,536 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:38:00,536 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:38:00,536 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:38:00,536 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:38:00,536 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:38:00,537 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:38:00,537 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:38:00,537 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:38:00,537 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:38:00,537 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:38:00,537 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ca069cb8d4103e8fb4700634948424bd87542bc [2018-11-10 12:38:00,560 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:38:00,569 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:38:00,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:38:00,573 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:38:00,574 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:38:00,574 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c [2018-11-10 12:38:00,621 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer/data/6feee30f6/880885d07233430e9c6b7e9b339a21e4/FLAGc0ab89f9a [2018-11-10 12:38:00,936 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:38:00,937 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/sv-benchmarks/c/recursive-simple/fibo_10_false-unreach-call_true-termination.c [2018-11-10 12:38:00,941 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer/data/6feee30f6/880885d07233430e9c6b7e9b339a21e4/FLAGc0ab89f9a [2018-11-10 12:38:00,949 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer/data/6feee30f6/880885d07233430e9c6b7e9b339a21e4 [2018-11-10 12:38:00,951 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:38:00,951 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 12:38:00,952 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:38:00,952 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:38:00,955 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:38:00,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:38:00" (1/1) ... [2018-11-10 12:38:00,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61258a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:00, skipping insertion in model container [2018-11-10 12:38:00,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:38:00" (1/1) ... [2018-11-10 12:38:00,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:38:00,974 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:38:01,069 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:38:01,071 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:38:01,080 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:38:01,089 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:38:01,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:01 WrapperNode [2018-11-10 12:38:01,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:38:01,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:38:01,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:38:01,089 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:38:01,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:01" (1/1) ... [2018-11-10 12:38:01,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:01" (1/1) ... [2018-11-10 12:38:01,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:01" (1/1) ... [2018-11-10 12:38:01,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:01" (1/1) ... [2018-11-10 12:38:01,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:01" (1/1) ... [2018-11-10 12:38:01,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:01" (1/1) ... [2018-11-10 12:38:01,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:01" (1/1) ... [2018-11-10 12:38:01,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:38:01,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:38:01,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:38:01,105 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:38:01,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:38:01,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:38:01,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:38:01,184 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2018-11-10 12:38:01,184 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:38:01,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 12:38:01,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 12:38:01,185 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2018-11-10 12:38:01,185 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:38:01,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:38:01,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:38:01,309 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:38:01,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:38:01 BoogieIcfgContainer [2018-11-10 12:38:01,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:38:01,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:38:01,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:38:01,312 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:38:01,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:38:00" (1/3) ... [2018-11-10 12:38:01,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5267f37b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:38:01, skipping insertion in model container [2018-11-10 12:38:01,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:38:01" (2/3) ... [2018-11-10 12:38:01,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5267f37b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:38:01, skipping insertion in model container [2018-11-10 12:38:01,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:38:01" (3/3) ... [2018-11-10 12:38:01,315 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_10_false-unreach-call_true-termination.c [2018-11-10 12:38:01,324 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:38:01,330 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 12:38:01,339 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 12:38:01,357 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:38:01,358 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:38:01,358 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:38:01,358 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:38:01,358 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:38:01,358 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:38:01,358 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:38:01,358 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:38:01,358 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:38:01,370 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-10 12:38:01,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 12:38:01,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:38:01,376 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:01,378 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:38:01,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:01,383 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2018-11-10 12:38:01,385 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:01,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:01,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:01,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:01,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:38:01,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:38:01,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:38:01,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:38:01,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:38:01,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:38:01,518 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2018-11-10 12:38:01,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:38:01,580 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-10 12:38:01,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:38:01,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-10 12:38:01,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:38:01,588 INFO L225 Difference]: With dead ends: 35 [2018-11-10 12:38:01,588 INFO L226 Difference]: Without dead ends: 21 [2018-11-10 12:38:01,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:38:01,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-10 12:38:01,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-10 12:38:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 12:38:01,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-10 12:38:01,624 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2018-11-10 12:38:01,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:38:01,624 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-10 12:38:01,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:38:01,624 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-10 12:38:01,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 12:38:01,626 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:38:01,626 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:01,626 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:38:01,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:01,626 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2018-11-10 12:38:01,626 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:01,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:01,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:01,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:01,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:01,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:38:01,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:38:01,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:38:01,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 12:38:01,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:38:01,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:38:01,660 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2018-11-10 12:38:01,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:38:01,724 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-10 12:38:01,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:38:01,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-10 12:38:01,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:38:01,725 INFO L225 Difference]: With dead ends: 27 [2018-11-10 12:38:01,725 INFO L226 Difference]: Without dead ends: 23 [2018-11-10 12:38:01,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:38:01,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-10 12:38:01,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-10 12:38:01,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 12:38:01,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-10 12:38:01,730 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2018-11-10 12:38:01,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:38:01,730 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-10 12:38:01,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 12:38:01,730 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-11-10 12:38:01,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 12:38:01,731 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:38:01,731 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:01,731 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:38:01,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:01,732 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2018-11-10 12:38:01,732 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:01,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:01,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:01,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:01,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:01,783 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:38:01,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:38:01,783 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:38:01,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:01,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:01,874 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:38:01,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:38:01,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-10 12:38:01,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:38:01,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:38:01,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:38:01,895 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2018-11-10 12:38:01,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:38:01,982 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-11-10 12:38:01,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:38:01,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-10 12:38:01,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:38:01,983 INFO L225 Difference]: With dead ends: 38 [2018-11-10 12:38:01,984 INFO L226 Difference]: Without dead ends: 23 [2018-11-10 12:38:01,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:38:01,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-10 12:38:01,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-10 12:38:01,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 12:38:01,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-10 12:38:01,990 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2018-11-10 12:38:01,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:38:01,991 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 12:38:01,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:38:01,991 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-10 12:38:01,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 12:38:01,992 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:38:01,992 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:01,992 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:38:01,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:01,992 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2018-11-10 12:38:01,993 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:01,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:01,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:01,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:01,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:02,037 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 12:38:02,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:38:02,038 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:38:02,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:02,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:02,079 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 12:38:02,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:38:02,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 12:38:02,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:38:02,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:38:02,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:38:02,097 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2018-11-10 12:38:02,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:38:02,143 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2018-11-10 12:38:02,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:38:02,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-11-10 12:38:02,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:38:02,145 INFO L225 Difference]: With dead ends: 32 [2018-11-10 12:38:02,145 INFO L226 Difference]: Without dead ends: 28 [2018-11-10 12:38:02,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:38:02,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-10 12:38:02,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-10 12:38:02,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-10 12:38:02,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-11-10 12:38:02,151 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2018-11-10 12:38:02,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:38:02,152 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-10 12:38:02,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:38:02,152 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2018-11-10 12:38:02,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 12:38:02,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:38:02,153 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:02,153 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:38:02,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:02,154 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2018-11-10 12:38:02,154 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:02,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:02,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:02,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:02,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 12:38:02,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:38:02,205 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:38:02,220 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:38:02,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 12:38:02,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:38:02,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 12:38:02,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:38:02,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2018-11-10 12:38:02,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:38:02,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:38:02,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:38:02,302 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 8 states. [2018-11-10 12:38:02,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:38:02,369 INFO L93 Difference]: Finished difference Result 40 states and 60 transitions. [2018-11-10 12:38:02,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:38:02,370 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-10 12:38:02,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:38:02,371 INFO L225 Difference]: With dead ends: 40 [2018-11-10 12:38:02,371 INFO L226 Difference]: Without dead ends: 36 [2018-11-10 12:38:02,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:38:02,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-10 12:38:02,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-10 12:38:02,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 12:38:02,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2018-11-10 12:38:02,379 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 40 [2018-11-10 12:38:02,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:38:02,380 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2018-11-10 12:38:02,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:38:02,380 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2018-11-10 12:38:02,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-10 12:38:02,382 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:38:02,382 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:02,383 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:38:02,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:02,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1474757101, now seen corresponding path program 3 times [2018-11-10 12:38:02,383 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:02,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:02,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:02,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:38:02,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 176 proven. 28 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-11-10 12:38:02,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:38:02,539 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:38:02,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 12:38:02,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-10 12:38:02,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:38:02,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-11-10 12:38:02,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:38:02,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2018-11-10 12:38:02,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 12:38:02,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 12:38:02,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:38:02,622 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. Second operand 12 states. [2018-11-10 12:38:02,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:38:02,810 INFO L93 Difference]: Finished difference Result 76 states and 143 transitions. [2018-11-10 12:38:02,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 12:38:02,810 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-11-10 12:38:02,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:38:02,811 INFO L225 Difference]: With dead ends: 76 [2018-11-10 12:38:02,812 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 12:38:02,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-11-10 12:38:02,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 12:38:02,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-11-10 12:38:02,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-10 12:38:02,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2018-11-10 12:38:02,819 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 96 [2018-11-10 12:38:02,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:38:02,819 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2018-11-10 12:38:02,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 12:38:02,819 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2018-11-10 12:38:02,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 12:38:02,821 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:38:02,821 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:02,821 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:38:02,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:02,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2001184551, now seen corresponding path program 4 times [2018-11-10 12:38:02,821 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:02,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:02,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:02,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:38:02,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:02,869 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-10 12:38:02,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:38:02,870 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:38:02,875 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 12:38:02,886 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 12:38:02,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:38:02,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:02,921 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-10 12:38:02,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:38:02,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2018-11-10 12:38:02,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:38:02,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:38:02,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:38:02,937 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand 8 states. [2018-11-10 12:38:03,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:38:03,030 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2018-11-10 12:38:03,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 12:38:03,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2018-11-10 12:38:03,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:38:03,032 INFO L225 Difference]: With dead ends: 52 [2018-11-10 12:38:03,032 INFO L226 Difference]: Without dead ends: 48 [2018-11-10 12:38:03,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:38:03,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-10 12:38:03,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-10 12:38:03,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 12:38:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 77 transitions. [2018-11-10 12:38:03,042 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 77 transitions. Word has length 68 [2018-11-10 12:38:03,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:38:03,042 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 77 transitions. [2018-11-10 12:38:03,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:38:03,042 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 77 transitions. [2018-11-10 12:38:03,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 12:38:03,044 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:38:03,045 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 14, 8, 8, 8, 8, 8, 8, 8, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:03,045 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:38:03,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:03,046 INFO L82 PathProgramCache]: Analyzing trace with hash 702878917, now seen corresponding path program 5 times [2018-11-10 12:38:03,046 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:03,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:03,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:03,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:38:03,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:03,152 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 213 proven. 64 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2018-11-10 12:38:03,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:38:03,153 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:38:03,159 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 12:38:03,177 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-10 12:38:03,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:38:03,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:03,263 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 422 proven. 118 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-11-10 12:38:03,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:38:03,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2018-11-10 12:38:03,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 12:38:03,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 12:38:03,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:38:03,283 INFO L87 Difference]: Start difference. First operand 48 states and 77 transitions. Second operand 13 states. [2018-11-10 12:38:03,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:38:03,529 INFO L93 Difference]: Finished difference Result 111 states and 206 transitions. [2018-11-10 12:38:03,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 12:38:03,529 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 123 [2018-11-10 12:38:03,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:38:03,530 INFO L225 Difference]: With dead ends: 111 [2018-11-10 12:38:03,531 INFO L226 Difference]: Without dead ends: 69 [2018-11-10 12:38:03,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=548, Unknown=0, NotChecked=0, Total=756 [2018-11-10 12:38:03,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-10 12:38:03,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-11-10 12:38:03,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-10 12:38:03,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2018-11-10 12:38:03,539 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 123 [2018-11-10 12:38:03,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:38:03,540 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2018-11-10 12:38:03,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 12:38:03,540 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2018-11-10 12:38:03,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 12:38:03,542 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:38:03,542 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:03,543 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:38:03,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:03,543 INFO L82 PathProgramCache]: Analyzing trace with hash 259499213, now seen corresponding path program 6 times [2018-11-10 12:38:03,543 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:03,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:03,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:03,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:38:03,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:03,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 328 proven. 115 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2018-11-10 12:38:03,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:38:03,631 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:38:03,636 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 12:38:03,696 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2018-11-10 12:38:03,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:38:03,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:03,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 202 proven. 241 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2018-11-10 12:38:03,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:38:03,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-10 12:38:03,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:38:03,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:38:03,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:38:03,760 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 9 states. [2018-11-10 12:38:03,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:38:03,838 INFO L93 Difference]: Finished difference Result 80 states and 109 transitions. [2018-11-10 12:38:03,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:38:03,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 177 [2018-11-10 12:38:03,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:38:03,840 INFO L225 Difference]: With dead ends: 80 [2018-11-10 12:38:03,840 INFO L226 Difference]: Without dead ends: 76 [2018-11-10 12:38:03,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-10 12:38:03,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-10 12:38:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-10 12:38:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-10 12:38:03,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2018-11-10 12:38:03,849 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 177 [2018-11-10 12:38:03,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:38:03,849 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2018-11-10 12:38:03,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:38:03,849 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2018-11-10 12:38:03,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-11-10 12:38:03,856 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:38:03,856 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 43, 26, 26, 26, 26, 26, 26, 26, 17, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:03,856 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:38:03,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:03,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1341952681, now seen corresponding path program 7 times [2018-11-10 12:38:03,856 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:03,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:03,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:03,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:38:03,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 7715 backedges. 274 proven. 1274 refuted. 0 times theorem prover too weak. 6167 trivial. 0 not checked. [2018-11-10 12:38:04,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:38:04,024 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:38:04,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:04,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:04,175 INFO L134 CoverageAnalysis]: Checked inductivity of 7715 backedges. 240 proven. 1545 refuted. 0 times theorem prover too weak. 5930 trivial. 0 not checked. [2018-11-10 12:38:04,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:38:04,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 11 [2018-11-10 12:38:04,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 12:38:04,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 12:38:04,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:38:04,193 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand 11 states. [2018-11-10 12:38:04,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:38:04,316 INFO L93 Difference]: Finished difference Result 86 states and 128 transitions. [2018-11-10 12:38:04,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 12:38:04,317 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 368 [2018-11-10 12:38:04,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:38:04,318 INFO L225 Difference]: With dead ends: 86 [2018-11-10 12:38:04,318 INFO L226 Difference]: Without dead ends: 82 [2018-11-10 12:38:04,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-11-10 12:38:04,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-10 12:38:04,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2018-11-10 12:38:04,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-10 12:38:04,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 109 transitions. [2018-11-10 12:38:04,327 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 109 transitions. Word has length 368 [2018-11-10 12:38:04,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:38:04,328 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 109 transitions. [2018-11-10 12:38:04,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 12:38:04,328 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 109 transitions. [2018-11-10 12:38:04,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2018-11-10 12:38:04,338 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:38:04,338 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:04,338 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:38:04,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:04,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1932846124, now seen corresponding path program 8 times [2018-11-10 12:38:04,339 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:04,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:04,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:04,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:04,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:04,597 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 440 proven. 2503 refuted. 0 times theorem prover too weak. 16160 trivial. 0 not checked. [2018-11-10 12:38:04,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:38:04,597 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:38:04,603 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:38:04,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 12:38:04,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:38:04,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:04,915 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 401 proven. 2942 refuted. 0 times theorem prover too weak. 15760 trivial. 0 not checked. [2018-11-10 12:38:04,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:38:04,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 12 [2018-11-10 12:38:04,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 12:38:04,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 12:38:04,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:38:04,933 INFO L87 Difference]: Start difference. First operand 76 states and 109 transitions. Second operand 12 states. [2018-11-10 12:38:05,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:38:05,065 INFO L93 Difference]: Finished difference Result 85 states and 130 transitions. [2018-11-10 12:38:05,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 12:38:05,065 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 572 [2018-11-10 12:38:05,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:38:05,067 INFO L225 Difference]: With dead ends: 85 [2018-11-10 12:38:05,067 INFO L226 Difference]: Without dead ends: 81 [2018-11-10 12:38:05,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 578 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2018-11-10 12:38:05,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-10 12:38:05,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-10 12:38:05,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-10 12:38:05,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 125 transitions. [2018-11-10 12:38:05,075 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 125 transitions. Word has length 572 [2018-11-10 12:38:05,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:38:05,076 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 125 transitions. [2018-11-10 12:38:05,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 12:38:05,076 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 125 transitions. [2018-11-10 12:38:05,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 886 [2018-11-10 12:38:05,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:38:05,083 INFO L375 BasicCegarLoop]: trace histogram [129, 129, 104, 64, 64, 64, 64, 64, 64, 64, 40, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:05,083 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:38:05,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:05,083 INFO L82 PathProgramCache]: Analyzing trace with hash 109591711, now seen corresponding path program 9 times [2018-11-10 12:38:05,083 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:05,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:05,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:05,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:38:05,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:05,589 INFO L134 CoverageAnalysis]: Checked inductivity of 46444 backedges. 3144 proven. 1574 refuted. 0 times theorem prover too weak. 41726 trivial. 0 not checked. [2018-11-10 12:38:05,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:38:05,589 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:38:05,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 12:38:05,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-11-10 12:38:05,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:38:05,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:06,033 INFO L134 CoverageAnalysis]: Checked inductivity of 46444 backedges. 779 proven. 5264 refuted. 0 times theorem prover too weak. 40401 trivial. 0 not checked. [2018-11-10 12:38:06,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:38:06,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 13 [2018-11-10 12:38:06,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 12:38:06,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 12:38:06,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:38:06,051 INFO L87 Difference]: Start difference. First operand 81 states and 125 transitions. Second operand 13 states. [2018-11-10 12:38:06,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:38:06,184 INFO L93 Difference]: Finished difference Result 90 states and 148 transitions. [2018-11-10 12:38:06,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 12:38:06,184 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 885 [2018-11-10 12:38:06,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:38:06,186 INFO L225 Difference]: With dead ends: 90 [2018-11-10 12:38:06,186 INFO L226 Difference]: Without dead ends: 86 [2018-11-10 12:38:06,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 890 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-11-10 12:38:06,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-10 12:38:06,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-10 12:38:06,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-10 12:38:06,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 143 transitions. [2018-11-10 12:38:06,195 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 143 transitions. Word has length 885 [2018-11-10 12:38:06,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:38:06,196 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 143 transitions. [2018-11-10 12:38:06,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 12:38:06,197 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 143 transitions. [2018-11-10 12:38:06,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1636 [2018-11-10 12:38:06,208 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:38:06,209 INFO L375 BasicCegarLoop]: trace histogram [239, 239, 194, 119, 119, 119, 119, 119, 119, 119, 75, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:06,209 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:38:06,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:06,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1252276512, now seen corresponding path program 10 times [2018-11-10 12:38:06,210 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:06,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:06,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:06,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:38:06,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:07,267 INFO L134 CoverageAnalysis]: Checked inductivity of 160569 backedges. 7508 proven. 4531 refuted. 0 times theorem prover too weak. 148530 trivial. 0 not checked. [2018-11-10 12:38:07,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:38:07,267 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:38:07,272 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 12:38:07,442 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 12:38:07,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:38:07,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:08,218 INFO L134 CoverageAnalysis]: Checked inductivity of 160569 backedges. 2004 proven. 10027 refuted. 0 times theorem prover too weak. 148538 trivial. 0 not checked. [2018-11-10 12:38:08,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:38:08,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 18 [2018-11-10 12:38:08,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 12:38:08,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 12:38:08,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2018-11-10 12:38:08,247 INFO L87 Difference]: Start difference. First operand 86 states and 143 transitions. Second operand 18 states. [2018-11-10 12:38:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:38:08,609 INFO L93 Difference]: Finished difference Result 216 states and 983 transitions. [2018-11-10 12:38:08,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 12:38:08,609 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1635 [2018-11-10 12:38:08,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:38:08,612 INFO L225 Difference]: With dead ends: 216 [2018-11-10 12:38:08,612 INFO L226 Difference]: Without dead ends: 86 [2018-11-10 12:38:08,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1666 GetRequests, 1640 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=241, Invalid=461, Unknown=0, NotChecked=0, Total=702 [2018-11-10 12:38:08,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-10 12:38:08,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-10 12:38:08,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-10 12:38:08,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-11-10 12:38:08,622 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 1635 [2018-11-10 12:38:08,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:38:08,623 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-11-10 12:38:08,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 12:38:08,623 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-11-10 12:38:08,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2018-11-10 12:38:08,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:38:08,634 INFO L375 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:08,634 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:38:08,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:08,635 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 11 times [2018-11-10 12:38:08,635 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:08,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:08,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:08,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:38:08,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:08,782 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 12:38:08,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:38:08 BoogieIcfgContainer [2018-11-10 12:38:08,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:38:08,859 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:38:08,859 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:38:08,860 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:38:08,860 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:38:01" (3/4) ... [2018-11-10 12:38:08,863 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 12:38:08,959 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_413b094c-c334-48bd-8bf7-88aafdc444bf/bin-2019/uautomizer/witness.graphml [2018-11-10 12:38:08,959 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:38:08,960 INFO L168 Benchmark]: Toolchain (without parser) took 8008.98 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 960.2 MB in the beginning and 810.5 MB in the end (delta: 149.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-11-10 12:38:08,961 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:38:08,962 INFO L168 Benchmark]: CACSL2BoogieTranslator took 137.29 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:38:08,962 INFO L168 Benchmark]: Boogie Preprocessor took 15.43 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 948.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:38:08,962 INFO L168 Benchmark]: RCFGBuilder took 204.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -138.6 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2018-11-10 12:38:08,962 INFO L168 Benchmark]: TraceAbstraction took 7549.27 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 841.3 MB in the end (delta: 245.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-11-10 12:38:08,963 INFO L168 Benchmark]: Witness Printer took 99.97 ms. Allocated memory is still 2.3 GB. Free memory was 841.3 MB in the beginning and 810.5 MB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:38:08,964 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 137.29 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.43 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 948.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 204.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -138.6 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7549.27 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 841.3 MB in the end (delta: 245.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 99.97 ms. Allocated memory is still 2.3 GB. Free memory was 841.3 MB in the beginning and 810.5 MB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 10; VAL [x=10] [L25] CALL, EXPR fibo(x) VAL [\old(n)=10] [L6] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L8] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L6] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L8] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L6] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L8] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=9, fibo(n-1)=21, n=9] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=9, fibo(n-1)=21, fibo(n-2)=13, n=9] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=10, fibo(n-1)=34, n=10] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L6] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L8] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] RET return 1; VAL [\old(n)=1, \result=1, n=1] [L11] EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] RET return 0; VAL [\old(n)=0, \result=0, n=0] [L11] EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L11] RET return fibo(n-1) + fibo(n-2); [L11] EXPR fibo(n-2) VAL [\old(n)=10, fibo(n-1)=34, fibo(n-2)=21, n=10] [L11] RET return fibo(n-1) + fibo(n-2); [L25] EXPR fibo(x) VAL [fibo(x)=55, x=10] [L25] int result = fibo(x); [L26] COND TRUE result == 55 VAL [result=55, x=10] [L27] __VERIFIER_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. UNSAFE Result, 7.5s OverallTime, 14 OverallIterations, 239 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 246 SDtfs, 299 SDslu, 822 SDs, 0 SdLazy, 1241 SolverSat, 399 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4231 GetRequests, 4051 SyntacticMatches, 2 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 22 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 9273 NumberOfCodeBlocks, 8375 NumberOfCodeBlocksAsserted, 89 NumberOfCheckSat, 8037 ConstructedInterpolants, 0 QuantifiedInterpolants, 8948519 SizeOfPredicates, 67 NumberOfNonLiveVariables, 6749 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 443434/473840 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...