./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_10-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_10-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ca069cb8d4103e8fb4700634948424bd87542bc ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:28:34,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:28:34,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:28:34,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:28:34,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:28:34,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:28:34,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:28:34,375 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:28:34,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:28:34,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:28:34,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:28:34,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:28:34,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:28:34,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:28:34,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:28:34,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:28:34,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:28:34,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:28:34,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:28:34,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:28:34,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:28:34,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:28:34,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:28:34,406 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:28:34,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:28:34,415 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:28:34,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:28:34,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:28:34,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:28:34,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:28:34,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:28:34,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:28:34,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:28:34,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:28:34,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:28:34,427 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:28:34,428 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:28:34,428 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:28:34,429 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:28:34,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:28:34,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:28:34,434 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:28:34,457 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:28:34,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:28:34,460 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:28:34,460 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:28:34,460 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:28:34,461 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:28:34,461 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:28:34,461 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:28:34,462 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:28:34,462 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:28:34,463 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:28:34,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:28:34,464 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:28:34,464 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:28:34,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:28:34,465 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:28:34,465 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:28:34,466 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:28:34,466 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:28:34,466 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:28:34,467 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:28:34,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:28:34,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:28:34,468 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:28:34,468 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:28:34,468 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:28:34,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:28:34,469 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:28:34,469 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:28:34,469 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ca069cb8d4103e8fb4700634948424bd87542bc [2019-11-28 17:28:34,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:28:34,868 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:28:34,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:28:34,874 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:28:34,875 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:28:34,876 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_10-1.c [2019-11-28 17:28:34,956 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7568f130f/c8b45d7096ef43cc8b350af51f7741c5/FLAG416e37154 [2019-11-28 17:28:35,371 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:28:35,372 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2019-11-28 17:28:35,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7568f130f/c8b45d7096ef43cc8b350af51f7741c5/FLAG416e37154 [2019-11-28 17:28:35,750 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7568f130f/c8b45d7096ef43cc8b350af51f7741c5 [2019-11-28 17:28:35,754 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:28:35,756 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:28:35,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:28:35,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:28:35,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:28:35,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:28:35" (1/1) ... [2019-11-28 17:28:35,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a288275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:35, skipping insertion in model container [2019-11-28 17:28:35,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:28:35" (1/1) ... [2019-11-28 17:28:35,778 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:28:35,799 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:28:36,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:28:36,058 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:28:36,081 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:28:36,098 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:28:36,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:36 WrapperNode [2019-11-28 17:28:36,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:28:36,100 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:28:36,101 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:28:36,101 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:28:36,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:36" (1/1) ... [2019-11-28 17:28:36,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:36" (1/1) ... [2019-11-28 17:28:36,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:28:36,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:28:36,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:28:36,146 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:28:36,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:36" (1/1) ... [2019-11-28 17:28:36,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:36" (1/1) ... [2019-11-28 17:28:36,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:36" (1/1) ... [2019-11-28 17:28:36,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:36" (1/1) ... [2019-11-28 17:28:36,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:36" (1/1) ... [2019-11-28 17:28:36,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:36" (1/1) ... [2019-11-28 17:28:36,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:36" (1/1) ... [2019-11-28 17:28:36,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:28:36,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:28:36,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:28:36,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:28:36,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:28:36,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:28:36,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:28:36,315 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-11-28 17:28:36,315 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-11-28 17:28:36,514 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:28:36,514 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 17:28:36,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:28:36 BoogieIcfgContainer [2019-11-28 17:28:36,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:28:36,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:28:36,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:28:36,522 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:28:36,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:28:35" (1/3) ... [2019-11-28 17:28:36,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a9c299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:28:36, skipping insertion in model container [2019-11-28 17:28:36,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:28:36" (2/3) ... [2019-11-28 17:28:36,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a9c299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:28:36, skipping insertion in model container [2019-11-28 17:28:36,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:28:36" (3/3) ... [2019-11-28 17:28:36,526 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2019-11-28 17:28:36,538 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:28:36,545 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:28:36,558 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 17:28:36,586 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:28:36,587 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:28:36,587 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:28:36,587 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:28:36,588 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:28:36,588 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:28:36,588 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:28:36,589 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:28:36,607 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-28 17:28:36,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 17:28:36,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:36,616 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:36,617 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:36,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:36,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1007516703, now seen corresponding path program 1 times [2019-11-28 17:28:36,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:36,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714709920] [2019-11-28 17:28:36,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:28:36,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714709920] [2019-11-28 17:28:36,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:28:36,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 17:28:36,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279707042] [2019-11-28 17:28:36,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 17:28:36,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:36,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 17:28:36,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:28:36,916 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 7 states. [2019-11-28 17:28:37,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:37,058 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-11-28 17:28:37,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:28:37,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-28 17:28:37,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:37,069 INFO L225 Difference]: With dead ends: 29 [2019-11-28 17:28:37,069 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 17:28:37,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:28:37,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 17:28:37,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 17:28:37,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 17:28:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-28 17:28:37,113 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2019-11-28 17:28:37,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:37,113 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-28 17:28:37,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 17:28:37,114 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-28 17:28:37,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 17:28:37,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:37,116 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:37,116 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:37,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:37,117 INFO L82 PathProgramCache]: Analyzing trace with hash -453503986, now seen corresponding path program 1 times [2019-11-28 17:28:37,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:37,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997210168] [2019-11-28 17:28:37,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:28:37,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997210168] [2019-11-28 17:28:37,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:28:37,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 17:28:37,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062866930] [2019-11-28 17:28:37,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 17:28:37,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:37,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 17:28:37,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:28:37,226 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 7 states. [2019-11-28 17:28:37,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:37,332 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-11-28 17:28:37,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:28:37,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-11-28 17:28:37,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:37,337 INFO L225 Difference]: With dead ends: 23 [2019-11-28 17:28:37,337 INFO L226 Difference]: Without dead ends: 19 [2019-11-28 17:28:37,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:28:37,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-28 17:28:37,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-11-28 17:28:37,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 17:28:37,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-28 17:28:37,348 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-11-28 17:28:37,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:37,348 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-28 17:28:37,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 17:28:37,350 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-28 17:28:37,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:28:37,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:37,352 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:37,352 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:37,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:37,353 INFO L82 PathProgramCache]: Analyzing trace with hash 511906889, now seen corresponding path program 1 times [2019-11-28 17:28:37,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:37,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407272217] [2019-11-28 17:28:37,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:37,515 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 17:28:37,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407272217] [2019-11-28 17:28:37,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722471841] [2019-11-28 17:28:37,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:37,568 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:28:37,578 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:37,719 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 17:28:37,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:37,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 10 [2019-11-28 17:28:37,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510101449] [2019-11-28 17:28:37,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 17:28:37,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:37,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 17:28:37,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:28:37,722 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 10 states. [2019-11-28 17:28:37,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:37,865 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2019-11-28 17:28:37,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:28:37,865 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-28 17:28:37,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:37,867 INFO L225 Difference]: With dead ends: 41 [2019-11-28 17:28:37,867 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 17:28:37,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:28:37,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 17:28:37,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-11-28 17:28:37,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 17:28:37,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-11-28 17:28:37,877 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 22 [2019-11-28 17:28:37,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:37,878 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-28 17:28:37,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 17:28:37,878 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-11-28 17:28:37,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 17:28:37,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:37,880 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:38,085 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:38,087 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:38,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:38,089 INFO L82 PathProgramCache]: Analyzing trace with hash 178931364, now seen corresponding path program 1 times [2019-11-28 17:28:38,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:38,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665379023] [2019-11-28 17:28:38,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:38,284 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 17:28:38,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665379023] [2019-11-28 17:28:38,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258628571] [2019-11-28 17:28:38,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:38,320 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:28:38,323 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:38,379 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 17:28:38,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:38,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 10 [2019-11-28 17:28:38,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966789973] [2019-11-28 17:28:38,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 17:28:38,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:38,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 17:28:38,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:28:38,387 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 10 states. [2019-11-28 17:28:38,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:38,558 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2019-11-28 17:28:38,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:28:38,559 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-28 17:28:38,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:38,561 INFO L225 Difference]: With dead ends: 47 [2019-11-28 17:28:38,562 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 17:28:38,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:28:38,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 17:28:38,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-11-28 17:28:38,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 17:28:38,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-11-28 17:28:38,576 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 23 [2019-11-28 17:28:38,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:38,577 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-11-28 17:28:38,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 17:28:38,577 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-11-28 17:28:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 17:28:38,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:38,580 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:38,783 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:38,784 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:38,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:38,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1840059703, now seen corresponding path program 2 times [2019-11-28 17:28:38,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:38,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150386524] [2019-11-28 17:28:38,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:38,974 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-28 17:28:38,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150386524] [2019-11-28 17:28:38,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373432409] [2019-11-28 17:28:38,976 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:39,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:28:39,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:39,013 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 17:28:39,016 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-28 17:28:39,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:39,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-11-28 17:28:39,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012553616] [2019-11-28 17:28:39,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 17:28:39,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:39,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 17:28:39,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:28:39,059 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 12 states. [2019-11-28 17:28:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:39,262 INFO L93 Difference]: Finished difference Result 67 states and 101 transitions. [2019-11-28 17:28:39,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 17:28:39,263 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-11-28 17:28:39,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:39,264 INFO L225 Difference]: With dead ends: 67 [2019-11-28 17:28:39,265 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 17:28:39,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-11-28 17:28:39,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 17:28:39,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-11-28 17:28:39,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 17:28:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-11-28 17:28:39,274 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 35 [2019-11-28 17:28:39,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:39,275 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-11-28 17:28:39,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 17:28:39,275 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-11-28 17:28:39,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 17:28:39,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:39,277 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:39,481 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:39,482 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:39,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:39,483 INFO L82 PathProgramCache]: Analyzing trace with hash 624826665, now seen corresponding path program 2 times [2019-11-28 17:28:39,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:39,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451939999] [2019-11-28 17:28:39,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:39,705 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-28 17:28:39,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451939999] [2019-11-28 17:28:39,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636717993] [2019-11-28 17:28:39,706 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:39,742 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:28:39,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:39,743 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 17:28:39,746 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-28 17:28:39,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:39,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 12 [2019-11-28 17:28:39,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467186495] [2019-11-28 17:28:39,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 17:28:39,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:39,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 17:28:39,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:28:39,781 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 12 states. [2019-11-28 17:28:39,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:39,925 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2019-11-28 17:28:39,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:28:39,926 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-11-28 17:28:39,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:39,928 INFO L225 Difference]: With dead ends: 52 [2019-11-28 17:28:39,928 INFO L226 Difference]: Without dead ends: 48 [2019-11-28 17:28:39,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-28 17:28:39,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-28 17:28:39,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-11-28 17:28:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 17:28:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2019-11-28 17:28:39,940 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 37 [2019-11-28 17:28:39,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:39,940 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2019-11-28 17:28:39,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 17:28:39,941 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2019-11-28 17:28:39,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-28 17:28:39,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:39,944 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 8, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:40,156 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:40,156 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:40,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:40,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1133813247, now seen corresponding path program 3 times [2019-11-28 17:28:40,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:40,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386210307] [2019-11-28 17:28:40,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:40,533 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 73 proven. 128 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-11-28 17:28:40,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386210307] [2019-11-28 17:28:40,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725470004] [2019-11-28 17:28:40,534 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:40,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-28 17:28:40,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:40,589 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 17:28:40,593 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 12 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-28 17:28:40,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:40,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2019-11-28 17:28:40,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140412939] [2019-11-28 17:28:40,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 17:28:40,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:40,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 17:28:40,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-11-28 17:28:40,647 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand 16 states. [2019-11-28 17:28:40,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:40,878 INFO L93 Difference]: Finished difference Result 94 states and 142 transitions. [2019-11-28 17:28:40,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 17:28:40,878 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2019-11-28 17:28:40,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:40,880 INFO L225 Difference]: With dead ends: 94 [2019-11-28 17:28:40,880 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 17:28:40,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2019-11-28 17:28:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 17:28:40,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-11-28 17:28:40,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 17:28:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2019-11-28 17:28:40,893 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 89 [2019-11-28 17:28:40,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:40,893 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2019-11-28 17:28:40,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 17:28:40,894 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2019-11-28 17:28:40,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-28 17:28:40,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:40,896 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:41,099 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:41,100 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:41,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:41,100 INFO L82 PathProgramCache]: Analyzing trace with hash -91709127, now seen corresponding path program 4 times [2019-11-28 17:28:41,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:41,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151259651] [2019-11-28 17:28:41,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:41,524 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 57 proven. 117 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-11-28 17:28:41,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151259651] [2019-11-28 17:28:41,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399780443] [2019-11-28 17:28:41,526 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:41,594 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 17:28:41,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:41,595 INFO L264 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 17:28:41,614 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-11-28 17:28:41,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:41,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 19 [2019-11-28 17:28:41,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508309316] [2019-11-28 17:28:41,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 17:28:41,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:41,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 17:28:41,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-11-28 17:28:41,684 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 19 states. [2019-11-28 17:28:42,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:42,023 INFO L93 Difference]: Finished difference Result 93 states and 137 transitions. [2019-11-28 17:28:42,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 17:28:42,025 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2019-11-28 17:28:42,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:42,028 INFO L225 Difference]: With dead ends: 93 [2019-11-28 17:28:42,029 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 17:28:42,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-11-28 17:28:42,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 17:28:42,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2019-11-28 17:28:42,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 17:28:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2019-11-28 17:28:42,043 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 78 [2019-11-28 17:28:42,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:42,044 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2019-11-28 17:28:42,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 17:28:42,044 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2019-11-28 17:28:42,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-28 17:28:42,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:42,047 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:42,251 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:42,252 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:42,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:42,252 INFO L82 PathProgramCache]: Analyzing trace with hash -2413653, now seen corresponding path program 5 times [2019-11-28 17:28:42,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:42,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167140659] [2019-11-28 17:28:42,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:42,732 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 166 proven. 339 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2019-11-28 17:28:42,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167140659] [2019-11-28 17:28:42,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480136521] [2019-11-28 17:28:42,733 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:42,806 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-11-28 17:28:42,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:42,808 INFO L264 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 17:28:42,813 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:42,938 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 187 proven. 336 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2019-11-28 17:28:42,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:42,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 25 [2019-11-28 17:28:42,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926245178] [2019-11-28 17:28:42,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 17:28:42,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:42,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 17:28:42,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2019-11-28 17:28:42,942 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand 25 states. [2019-11-28 17:28:43,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:43,517 INFO L93 Difference]: Finished difference Result 111 states and 175 transitions. [2019-11-28 17:28:43,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 17:28:43,517 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 132 [2019-11-28 17:28:43,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:43,519 INFO L225 Difference]: With dead ends: 111 [2019-11-28 17:28:43,519 INFO L226 Difference]: Without dead ends: 70 [2019-11-28 17:28:43,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=286, Invalid=1046, Unknown=0, NotChecked=0, Total=1332 [2019-11-28 17:28:43,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-28 17:28:43,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2019-11-28 17:28:43,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 17:28:43,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2019-11-28 17:28:43,535 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 132 [2019-11-28 17:28:43,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:43,536 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2019-11-28 17:28:43,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 17:28:43,536 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2019-11-28 17:28:43,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-28 17:28:43,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:43,542 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:43,745 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:43,746 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:43,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:43,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2009245247, now seen corresponding path program 6 times [2019-11-28 17:28:43,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:43,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823780168] [2019-11-28 17:28:43,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:44,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2019-11-28 17:28:44,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823780168] [2019-11-28 17:28:44,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526030501] [2019-11-28 17:28:44,165 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:44,246 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-11-28 17:28:44,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:44,247 INFO L264 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 17:28:44,255 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 202 proven. 241 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2019-11-28 17:28:44,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:44,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 18 [2019-11-28 17:28:44,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516003381] [2019-11-28 17:28:44,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 17:28:44,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:44,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 17:28:44,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-11-28 17:28:44,306 INFO L87 Difference]: Start difference. First operand 66 states and 85 transitions. Second operand 18 states. [2019-11-28 17:28:44,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:44,553 INFO L93 Difference]: Finished difference Result 182 states and 262 transitions. [2019-11-28 17:28:44,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 17:28:44,554 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 173 [2019-11-28 17:28:44,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:44,558 INFO L225 Difference]: With dead ends: 182 [2019-11-28 17:28:44,558 INFO L226 Difference]: Without dead ends: 178 [2019-11-28 17:28:44,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-11-28 17:28:44,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-28 17:28:44,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2019-11-28 17:28:44,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-28 17:28:44,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 239 transitions. [2019-11-28 17:28:44,583 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 239 transitions. Word has length 173 [2019-11-28 17:28:44,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:44,584 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 239 transitions. [2019-11-28 17:28:44,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 17:28:44,584 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 239 transitions. [2019-11-28 17:28:44,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-11-28 17:28:44,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:44,590 INFO L410 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:44,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:44,795 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:44,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:44,796 INFO L82 PathProgramCache]: Analyzing trace with hash 503828745, now seen corresponding path program 7 times [2019-11-28 17:28:44,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:44,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508283271] [2019-11-28 17:28:44,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:46,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 885 proven. 1801 refuted. 0 times theorem prover too weak. 4434 trivial. 0 not checked. [2019-11-28 17:28:46,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508283271] [2019-11-28 17:28:46,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885451141] [2019-11-28 17:28:46,296 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:46,412 INFO L264 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 17:28:46,420 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1491 refuted. 0 times theorem prover too weak. 5415 trivial. 0 not checked. [2019-11-28 17:28:46,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:46,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 11] total 32 [2019-11-28 17:28:46,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155806667] [2019-11-28 17:28:46,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-28 17:28:46,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:46,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-28 17:28:46,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-11-28 17:28:46,523 INFO L87 Difference]: Start difference. First operand 166 states and 239 transitions. Second operand 32 states. [2019-11-28 17:28:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:47,438 INFO L93 Difference]: Finished difference Result 274 states and 469 transitions. [2019-11-28 17:28:47,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-28 17:28:47,439 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 350 [2019-11-28 17:28:47,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:47,441 INFO L225 Difference]: With dead ends: 274 [2019-11-28 17:28:47,442 INFO L226 Difference]: Without dead ends: 118 [2019-11-28 17:28:47,444 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=483, Invalid=1967, Unknown=0, NotChecked=0, Total=2450 [2019-11-28 17:28:47,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-28 17:28:47,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2019-11-28 17:28:47,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 17:28:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 140 transitions. [2019-11-28 17:28:47,457 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 140 transitions. Word has length 350 [2019-11-28 17:28:47,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:47,458 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 140 transitions. [2019-11-28 17:28:47,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-28 17:28:47,458 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 140 transitions. [2019-11-28 17:28:47,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2019-11-28 17:28:47,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:47,467 INFO L410 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:47,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:47,679 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:47,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:47,679 INFO L82 PathProgramCache]: Analyzing trace with hash 187396788, now seen corresponding path program 8 times [2019-11-28 17:28:47,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:47,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289496047] [2019-11-28 17:28:47,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 361 proven. 2270 refuted. 0 times theorem prover too weak. 9756 trivial. 0 not checked. [2019-11-28 17:28:49,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289496047] [2019-11-28 17:28:49,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912342351] [2019-11-28 17:28:49,238 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:49,379 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:28:49,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:49,382 INFO L264 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 17:28:49,389 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:49,533 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 361 proven. 2270 refuted. 0 times theorem prover too weak. 9756 trivial. 0 not checked. [2019-11-28 17:28:49,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:49,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 22 [2019-11-28 17:28:49,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867867563] [2019-11-28 17:28:49,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-28 17:28:49,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:49,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 17:28:49,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2019-11-28 17:28:49,536 INFO L87 Difference]: Start difference. First operand 100 states and 140 transitions. Second operand 22 states. [2019-11-28 17:28:49,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:49,873 INFO L93 Difference]: Finished difference Result 365 states and 563 transitions. [2019-11-28 17:28:49,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 17:28:49,873 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 459 [2019-11-28 17:28:49,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:49,880 INFO L225 Difference]: With dead ends: 365 [2019-11-28 17:28:49,881 INFO L226 Difference]: Without dead ends: 361 [2019-11-28 17:28:49,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2019-11-28 17:28:49,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-28 17:28:49,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 343. [2019-11-28 17:28:49,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-28 17:28:49,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 525 transitions. [2019-11-28 17:28:49,927 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 525 transitions. Word has length 459 [2019-11-28 17:28:49,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:49,929 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 525 transitions. [2019-11-28 17:28:49,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-28 17:28:49,929 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 525 transitions. [2019-11-28 17:28:49,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 923 [2019-11-28 17:28:49,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:49,974 INFO L410 BasicCegarLoop]: trace histogram [135, 135, 109, 67, 67, 67, 67, 67, 67, 67, 42, 26, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:50,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:50,183 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:50,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:50,184 INFO L82 PathProgramCache]: Analyzing trace with hash -904244701, now seen corresponding path program 9 times [2019-11-28 17:28:50,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:50,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989650506] [2019-11-28 17:28:50,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:28:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 3524 proven. 7380 refuted. 0 times theorem prover too weak. 40006 trivial. 0 not checked. [2019-11-28 17:28:54,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989650506] [2019-11-28 17:28:54,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750335775] [2019-11-28 17:28:54,786 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:55,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-11-28 17:28:55,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:28:55,042 INFO L264 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 17:28:55,077 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:28:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 50910 backedges. 724 proven. 5622 refuted. 0 times theorem prover too weak. 44564 trivial. 0 not checked. [2019-11-28 17:28:55,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:28:55,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 13] total 40 [2019-11-28 17:28:55,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513404509] [2019-11-28 17:28:55,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-28 17:28:55,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:28:55,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-28 17:28:55,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1264, Unknown=0, NotChecked=0, Total=1560 [2019-11-28 17:28:55,635 INFO L87 Difference]: Start difference. First operand 343 states and 525 transitions. Second operand 40 states. [2019-11-28 17:28:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:28:57,093 INFO L93 Difference]: Finished difference Result 501 states and 882 transitions. [2019-11-28 17:28:57,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-11-28 17:28:57,093 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 922 [2019-11-28 17:28:57,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:28:57,102 INFO L225 Difference]: With dead ends: 501 [2019-11-28 17:28:57,102 INFO L226 Difference]: Without dead ends: 168 [2019-11-28 17:28:57,107 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1253 GetRequests, 1189 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=795, Invalid=3495, Unknown=0, NotChecked=0, Total=4290 [2019-11-28 17:28:57,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-28 17:28:57,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 134. [2019-11-28 17:28:57,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-28 17:28:57,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 199 transitions. [2019-11-28 17:28:57,126 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 199 transitions. Word has length 922 [2019-11-28 17:28:57,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:28:57,127 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 199 transitions. [2019-11-28 17:28:57,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-28 17:28:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 199 transitions. [2019-11-28 17:28:57,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2019-11-28 17:28:57,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:28:57,144 INFO L410 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1] [2019-11-28 17:28:57,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:28:57,359 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:28:57,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:28:57,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1577357454, now seen corresponding path program 10 times [2019-11-28 17:28:57,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:28:57,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800627392] [2019-11-28 17:28:57,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:28:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:28:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:28:58,209 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:28:58,209 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:28:58,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:28:58 BoogieIcfgContainer [2019-11-28 17:28:58,460 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:28:58,461 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:28:58,461 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:28:58,462 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:28:58,463 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:28:36" (3/4) ... [2019-11-28 17:28:58,466 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:28:58,692 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:28:58,693 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:28:58,695 INFO L168 Benchmark]: Toolchain (without parser) took 22939.23 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 961.7 MB in the beginning and 1.8 GB in the end (delta: -799.1 MB). Peak memory consumption was 467.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:58,696 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:28:58,696 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.92 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:58,697 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.60 ms. Allocated memory is still 1.0 GB. Free memory is still 951.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:28:58,697 INFO L168 Benchmark]: Boogie Preprocessor took 100.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:58,697 INFO L168 Benchmark]: RCFGBuilder took 270.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:58,698 INFO L168 Benchmark]: TraceAbstraction took 21942.96 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -669.7 MB). Peak memory consumption was 452.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:58,698 INFO L168 Benchmark]: Witness Printer took 231.78 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:28:58,701 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.92 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.60 ms. Allocated memory is still 1.0 GB. Free memory is still 951.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 100.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 270.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21942.96 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -669.7 MB). Peak memory consumption was 452.8 MB. Max. memory is 11.5 GB. * Witness Printer took 231.78 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 10; [L25] CALL, EXPR fibo(x) VAL [\old(n)=10] [L6] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L8] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L6] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L8] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L6] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L8] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=9, fibo(n-1)=21, n=9] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=9, fibo(n-1)=21, fibo(n-2)=13, n=9] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=10, fibo(n-1)=34, n=10] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L6] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L8] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=10, fibo(n-1)=34, fibo(n-2)=21, n=10] [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) [L25] int result = fibo(x); [L26] COND TRUE result == 55 [L27] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Result: UNSAFE, OverallTime: 21.6s, OverallIterations: 14, TraceHistogramMax: 177, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 234 SDtfs, 881 SDslu, 1148 SDs, 0 SdLazy, 3476 SolverSat, 1190 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3265 GetRequests, 2981 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2445 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=343occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 114 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 5867 NumberOfCodeBlocks, 5182 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 4635 ConstructedInterpolants, 0 QuantifiedInterpolants, 3359135 SizeOfPredicates, 63 NumberOfNonLiveVariables, 3649 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 124862/147640 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...