./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 30f4e4ab 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.24-30f4e4a [2019-11-28 00:24:25,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:24:25,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:24:25,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:24:25,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:24:25,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:24:25,634 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:24:25,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:24:25,644 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:24:25,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:24:25,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:24:25,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:24:25,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:24:25,653 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:24:25,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:24:25,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:24:25,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:24:25,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:24:25,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:24:25,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:24:25,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:24:25,674 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:24:25,676 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:24:25,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:24:25,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:24:25,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:24:25,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:24:25,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:24:25,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:24:25,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:24:25,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:24:25,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:24:25,688 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:24:25,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:24:25,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:24:25,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:24:25,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:24:25,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:24:25,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:24:25,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:24:25,695 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:24:25,696 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:24:25,724 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:24:25,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:24:25,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:24:25,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:24:25,726 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:24:25,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:24:25,727 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:24:25,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:24:25,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:24:25,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:24:25,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:24:25,730 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:24:25,730 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:24:25,730 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:24:25,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:24:25,731 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:24:25,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:24:25,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:24:25,731 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:24:25,732 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:24:25,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:24:25,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:24:25,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:24:25,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:24:25,733 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:24:25,733 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:24:25,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:24:25,733 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:24:25,734 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 00:24:26,075 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:24:26,089 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:24:26,094 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:24:26,095 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:24:26,096 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:24:26,097 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 00:24:26,165 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7edaee2f/df7173b1fe0745e587f03251bf7aff61/FLAGcaf70dfea [2019-11-28 00:24:26,616 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:24:26,617 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2019-11-28 00:24:26,623 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7edaee2f/df7173b1fe0745e587f03251bf7aff61/FLAGcaf70dfea [2019-11-28 00:24:27,041 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7edaee2f/df7173b1fe0745e587f03251bf7aff61 [2019-11-28 00:24:27,045 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:24:27,046 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:24:27,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:24:27,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:24:27,051 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:24:27,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:24:27" (1/1) ... [2019-11-28 00:24:27,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@342c6add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:27, skipping insertion in model container [2019-11-28 00:24:27,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:24:27" (1/1) ... [2019-11-28 00:24:27,062 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:24:27,083 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:24:27,260 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:24:27,263 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:24:27,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:24:27,286 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:24:27,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:27 WrapperNode [2019-11-28 00:24:27,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:24:27,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:24:27,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:24:27,288 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:24:27,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:27" (1/1) ... [2019-11-28 00:24:27,300 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:27" (1/1) ... [2019-11-28 00:24:27,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:24:27,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:24:27,318 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:24:27,318 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:24:27,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:27" (1/1) ... [2019-11-28 00:24:27,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:27" (1/1) ... [2019-11-28 00:24:27,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:27" (1/1) ... [2019-11-28 00:24:27,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:27" (1/1) ... [2019-11-28 00:24:27,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:27" (1/1) ... [2019-11-28 00:24:27,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:27" (1/1) ... [2019-11-28 00:24:27,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:27" (1/1) ... [2019-11-28 00:24:27,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:24:27,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:24:27,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:24:27,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:24:27,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:27" (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 00:24:27,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:24:27,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:24:27,466 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-11-28 00:24:27,466 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-11-28 00:24:27,620 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:24:27,620 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:24:27,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:24:27 BoogieIcfgContainer [2019-11-28 00:24:27,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:24:27,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:24:27,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:24:27,626 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:24:27,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:24:27" (1/3) ... [2019-11-28 00:24:27,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330c90b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:24:27, skipping insertion in model container [2019-11-28 00:24:27,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:27" (2/3) ... [2019-11-28 00:24:27,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330c90b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:24:27, skipping insertion in model container [2019-11-28 00:24:27,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:24:27" (3/3) ... [2019-11-28 00:24:27,630 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2019-11-28 00:24:27,641 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:24:27,648 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 00:24:27,664 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 00:24:27,697 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:24:27,697 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:24:27,697 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:24:27,698 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:24:27,698 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:24:27,698 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:24:27,698 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:24:27,698 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:24:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-28 00:24:27,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 00:24:27,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:27,728 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:27,728 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:27,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:27,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1007516703, now seen corresponding path program 1 times [2019-11-28 00:24:27,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:27,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044212218] [2019-11-28 00:24:27,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:27,966 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 00:24:27,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044212218] [2019-11-28 00:24:27,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:24:27,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 00:24:27,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339790151] [2019-11-28 00:24:27,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 00:24:27,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:27,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 00:24:27,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:24:27,986 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 7 states. [2019-11-28 00:24:28,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:28,125 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-11-28 00:24:28,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:24:28,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-28 00:24:28,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:28,137 INFO L225 Difference]: With dead ends: 29 [2019-11-28 00:24:28,137 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 00:24:28,140 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 00:24:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 00:24:28,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 00:24:28,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 00:24:28,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-28 00:24:28,180 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2019-11-28 00:24:28,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:28,180 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-28 00:24:28,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 00:24:28,181 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-28 00:24:28,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 00:24:28,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:28,182 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:28,183 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:28,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:28,183 INFO L82 PathProgramCache]: Analyzing trace with hash -453503986, now seen corresponding path program 1 times [2019-11-28 00:24:28,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:28,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078960080] [2019-11-28 00:24:28,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,278 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 00:24:28,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078960080] [2019-11-28 00:24:28,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:24:28,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 00:24:28,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072010282] [2019-11-28 00:24:28,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 00:24:28,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:28,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 00:24:28,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:24:28,284 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 7 states. [2019-11-28 00:24:28,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:28,391 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-11-28 00:24:28,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:24:28,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-11-28 00:24:28,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:28,394 INFO L225 Difference]: With dead ends: 23 [2019-11-28 00:24:28,394 INFO L226 Difference]: Without dead ends: 19 [2019-11-28 00:24:28,395 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 00:24:28,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-28 00:24:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-11-28 00:24:28,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 00:24:28,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-28 00:24:28,404 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-11-28 00:24:28,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:28,405 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-28 00:24:28,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 00:24:28,405 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-28 00:24:28,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:24:28,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:28,407 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 00:24:28,407 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:28,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:28,407 INFO L82 PathProgramCache]: Analyzing trace with hash 511906889, now seen corresponding path program 1 times [2019-11-28 00:24:28,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:28,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090910710] [2019-11-28 00:24:28,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,569 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 00:24:28,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090910710] [2019-11-28 00:24:28,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52056093] [2019-11-28 00:24:28,570 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 00:24:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:28,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:24:28,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:28,702 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 00:24:28,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:28,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 10 [2019-11-28 00:24:28,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599739254] [2019-11-28 00:24:28,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 00:24:28,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:28,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 00:24:28,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:24:28,705 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 10 states. [2019-11-28 00:24:28,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:28,836 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2019-11-28 00:24:28,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:24:28,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-28 00:24:28,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:28,840 INFO L225 Difference]: With dead ends: 41 [2019-11-28 00:24:28,840 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 00:24:28,841 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 00:24:28,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 00:24:28,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-11-28 00:24:28,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 00:24:28,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-11-28 00:24:28,857 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 22 [2019-11-28 00:24:28,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:28,858 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-28 00:24:28,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 00:24:28,859 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-11-28 00:24:28,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 00:24:28,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:28,863 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 00:24:29,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:29,067 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:29,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:29,069 INFO L82 PathProgramCache]: Analyzing trace with hash 178931364, now seen corresponding path program 1 times [2019-11-28 00:24:29,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:29,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114894290] [2019-11-28 00:24:29,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:29,227 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 00:24:29,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114894290] [2019-11-28 00:24:29,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276469805] [2019-11-28 00:24:29,228 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 00:24:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:29,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:24:29,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:29,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 00:24:29,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:29,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 10 [2019-11-28 00:24:29,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312939397] [2019-11-28 00:24:29,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 00:24:29,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:29,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 00:24:29,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:24:29,287 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 10 states. [2019-11-28 00:24:29,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:29,429 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2019-11-28 00:24:29,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:24:29,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-28 00:24:29,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:29,434 INFO L225 Difference]: With dead ends: 47 [2019-11-28 00:24:29,434 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 00:24:29,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:24:29,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 00:24:29,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-11-28 00:24:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 00:24:29,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-11-28 00:24:29,450 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 23 [2019-11-28 00:24:29,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:29,451 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-11-28 00:24:29,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 00:24:29,451 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-11-28 00:24:29,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 00:24:29,453 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:29,454 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 00:24:29,660 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:29,661 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:29,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:29,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1840059703, now seen corresponding path program 2 times [2019-11-28 00:24:29,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:29,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056607073] [2019-11-28 00:24:29,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:29,849 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 00:24:29,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056607073] [2019-11-28 00:24:29,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032643310] [2019-11-28 00:24:29,850 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 00:24:29,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:24:29,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:29,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:24:29,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:29,945 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 00:24:29,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:29,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-11-28 00:24:29,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602222237] [2019-11-28 00:24:29,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 00:24:29,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:29,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 00:24:29,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:24:29,949 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 12 states. [2019-11-28 00:24:30,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:30,158 INFO L93 Difference]: Finished difference Result 67 states and 101 transitions. [2019-11-28 00:24:30,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 00:24:30,159 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-11-28 00:24:30,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:30,162 INFO L225 Difference]: With dead ends: 67 [2019-11-28 00:24:30,162 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 00:24:30,165 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 00:24:30,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 00:24:30,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-11-28 00:24:30,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 00:24:30,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-11-28 00:24:30,182 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 35 [2019-11-28 00:24:30,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:30,185 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-11-28 00:24:30,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 00:24:30,186 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-11-28 00:24:30,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 00:24:30,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:30,188 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 00:24:30,391 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:30,392 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:30,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:30,393 INFO L82 PathProgramCache]: Analyzing trace with hash 624826665, now seen corresponding path program 2 times [2019-11-28 00:24:30,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:30,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36500962] [2019-11-28 00:24:30,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:30,598 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 00:24:30,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36500962] [2019-11-28 00:24:30,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183171196] [2019-11-28 00:24:30,606 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 00:24:30,646 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:24:30,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:30,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:24:30,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:30,684 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 00:24:30,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:30,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 12 [2019-11-28 00:24:30,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738649271] [2019-11-28 00:24:30,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 00:24:30,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:30,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 00:24:30,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:24:30,687 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 12 states. [2019-11-28 00:24:30,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:30,851 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2019-11-28 00:24:30,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 00:24:30,851 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-11-28 00:24:30,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:30,853 INFO L225 Difference]: With dead ends: 52 [2019-11-28 00:24:30,853 INFO L226 Difference]: Without dead ends: 48 [2019-11-28 00:24:30,856 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 00:24:30,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-28 00:24:30,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-11-28 00:24:30,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 00:24:30,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2019-11-28 00:24:30,879 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 37 [2019-11-28 00:24:30,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:30,879 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2019-11-28 00:24:30,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 00:24:30,879 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2019-11-28 00:24:30,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-28 00:24:30,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:30,886 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 00:24:31,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:31,089 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:31,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:31,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1133813247, now seen corresponding path program 3 times [2019-11-28 00:24:31,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:31,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346177] [2019-11-28 00:24:31,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:31,487 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 00:24:31,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346177] [2019-11-28 00:24:31,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253296459] [2019-11-28 00:24:31,488 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 00:24:31,534 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-11-28 00:24:31,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:31,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:24:31,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:31,618 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 00:24:31,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:31,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2019-11-28 00:24:31,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609772157] [2019-11-28 00:24:31,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 00:24:31,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:31,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 00:24:31,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-11-28 00:24:31,621 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand 16 states. [2019-11-28 00:24:31,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:31,886 INFO L93 Difference]: Finished difference Result 94 states and 142 transitions. [2019-11-28 00:24:31,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 00:24:31,887 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2019-11-28 00:24:31,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:31,888 INFO L225 Difference]: With dead ends: 94 [2019-11-28 00:24:31,888 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 00:24:31,895 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 00:24:31,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 00:24:31,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-11-28 00:24:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 00:24:31,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2019-11-28 00:24:31,913 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 89 [2019-11-28 00:24:31,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:31,914 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2019-11-28 00:24:31,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 00:24:31,914 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2019-11-28 00:24:31,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-28 00:24:31,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:31,918 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 00:24:32,121 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:32,122 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:32,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:32,123 INFO L82 PathProgramCache]: Analyzing trace with hash -91709127, now seen corresponding path program 4 times [2019-11-28 00:24:32,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:32,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290617084] [2019-11-28 00:24:32,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:32,525 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 00:24:32,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290617084] [2019-11-28 00:24:32,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269519295] [2019-11-28 00:24:32,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 00:24:32,613 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:24:32,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:32,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 00:24:32,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:32,690 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 00:24:32,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:32,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 19 [2019-11-28 00:24:32,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091031454] [2019-11-28 00:24:32,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 00:24:32,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:32,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 00:24:32,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-11-28 00:24:32,697 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 19 states. [2019-11-28 00:24:33,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:33,015 INFO L93 Difference]: Finished difference Result 93 states and 137 transitions. [2019-11-28 00:24:33,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 00:24:33,017 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2019-11-28 00:24:33,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:33,019 INFO L225 Difference]: With dead ends: 93 [2019-11-28 00:24:33,020 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 00:24:33,023 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 00:24:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 00:24:33,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2019-11-28 00:24:33,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 00:24:33,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2019-11-28 00:24:33,038 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 78 [2019-11-28 00:24:33,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:33,039 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2019-11-28 00:24:33,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 00:24:33,039 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2019-11-28 00:24:33,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-28 00:24:33,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:33,043 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 00:24:33,246 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:33,247 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:33,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:33,248 INFO L82 PathProgramCache]: Analyzing trace with hash -2413653, now seen corresponding path program 5 times [2019-11-28 00:24:33,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:33,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127120229] [2019-11-28 00:24:33,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:33,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:33,721 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 00:24:33,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127120229] [2019-11-28 00:24:33,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138829237] [2019-11-28 00:24:33,722 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 00:24:33,789 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-11-28 00:24:33,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:33,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 00:24:33,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:33,887 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 00:24:33,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:33,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 25 [2019-11-28 00:24:33,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099081142] [2019-11-28 00:24:33,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 00:24:33,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:33,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 00:24:33,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2019-11-28 00:24:33,890 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand 25 states. [2019-11-28 00:24:34,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:34,342 INFO L93 Difference]: Finished difference Result 111 states and 175 transitions. [2019-11-28 00:24:34,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 00:24:34,342 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 132 [2019-11-28 00:24:34,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:34,345 INFO L225 Difference]: With dead ends: 111 [2019-11-28 00:24:34,345 INFO L226 Difference]: Without dead ends: 70 [2019-11-28 00:24:34,347 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 00:24:34,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-28 00:24:34,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2019-11-28 00:24:34,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 00:24:34,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2019-11-28 00:24:34,357 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 132 [2019-11-28 00:24:34,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:34,358 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2019-11-28 00:24:34,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 00:24:34,358 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2019-11-28 00:24:34,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-28 00:24:34,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:34,360 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 00:24:34,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:34,565 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:34,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:34,566 INFO L82 PathProgramCache]: Analyzing trace with hash -2009245247, now seen corresponding path program 6 times [2019-11-28 00:24:34,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:34,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417307988] [2019-11-28 00:24:34,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:34,965 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 00:24:34,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417307988] [2019-11-28 00:24:34,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599767559] [2019-11-28 00:24:34,966 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 00:24:35,082 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-11-28 00:24:35,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:35,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 00:24:35,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:35,128 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 00:24:35,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:35,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 18 [2019-11-28 00:24:35,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916657806] [2019-11-28 00:24:35,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 00:24:35,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:35,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 00:24:35,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-11-28 00:24:35,131 INFO L87 Difference]: Start difference. First operand 66 states and 85 transitions. Second operand 18 states. [2019-11-28 00:24:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:35,341 INFO L93 Difference]: Finished difference Result 182 states and 262 transitions. [2019-11-28 00:24:35,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 00:24:35,342 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 173 [2019-11-28 00:24:35,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:35,345 INFO L225 Difference]: With dead ends: 182 [2019-11-28 00:24:35,346 INFO L226 Difference]: Without dead ends: 178 [2019-11-28 00:24:35,346 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 00:24:35,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-28 00:24:35,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2019-11-28 00:24:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-28 00:24:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 239 transitions. [2019-11-28 00:24:35,370 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 239 transitions. Word has length 173 [2019-11-28 00:24:35,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:35,371 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 239 transitions. [2019-11-28 00:24:35,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 00:24:35,371 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 239 transitions. [2019-11-28 00:24:35,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-11-28 00:24:35,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:35,377 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 00:24:35,581 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:35,582 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:35,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:35,583 INFO L82 PathProgramCache]: Analyzing trace with hash 503828745, now seen corresponding path program 7 times [2019-11-28 00:24:35,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:35,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213959223] [2019-11-28 00:24:35,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,874 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 00:24:36,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213959223] [2019-11-28 00:24:36,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430260773] [2019-11-28 00:24:36,875 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 00:24:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:36,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 00:24:36,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:37,103 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 00:24:37,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:37,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 11] total 32 [2019-11-28 00:24:37,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750614218] [2019-11-28 00:24:37,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-28 00:24:37,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:37,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-28 00:24:37,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-11-28 00:24:37,108 INFO L87 Difference]: Start difference. First operand 166 states and 239 transitions. Second operand 32 states. [2019-11-28 00:24:37,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:37,963 INFO L93 Difference]: Finished difference Result 274 states and 469 transitions. [2019-11-28 00:24:37,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-28 00:24:37,964 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 350 [2019-11-28 00:24:37,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:37,966 INFO L225 Difference]: With dead ends: 274 [2019-11-28 00:24:37,967 INFO L226 Difference]: Without dead ends: 118 [2019-11-28 00:24:37,969 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 00:24:37,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-28 00:24:37,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2019-11-28 00:24:37,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 00:24:37,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 140 transitions. [2019-11-28 00:24:37,984 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 140 transitions. Word has length 350 [2019-11-28 00:24:37,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:37,985 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 140 transitions. [2019-11-28 00:24:37,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-28 00:24:37,985 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 140 transitions. [2019-11-28 00:24:37,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2019-11-28 00:24:37,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:37,994 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 00:24:38,197 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:38,198 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:38,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:38,198 INFO L82 PathProgramCache]: Analyzing trace with hash 187396788, now seen corresponding path program 8 times [2019-11-28 00:24:38,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:38,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460005853] [2019-11-28 00:24:38,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:39,607 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 00:24:39,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460005853] [2019-11-28 00:24:39,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812135081] [2019-11-28 00:24:39,608 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 00:24:39,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:24:39,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:39,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 00:24:39,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:39,900 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 00:24:39,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:39,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 22 [2019-11-28 00:24:39,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784575337] [2019-11-28 00:24:39,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-28 00:24:39,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:39,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 00:24:39,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2019-11-28 00:24:39,902 INFO L87 Difference]: Start difference. First operand 100 states and 140 transitions. Second operand 22 states. [2019-11-28 00:24:40,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:40,240 INFO L93 Difference]: Finished difference Result 365 states and 563 transitions. [2019-11-28 00:24:40,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 00:24:40,241 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 459 [2019-11-28 00:24:40,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:40,249 INFO L225 Difference]: With dead ends: 365 [2019-11-28 00:24:40,249 INFO L226 Difference]: Without dead ends: 361 [2019-11-28 00:24:40,250 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 00:24:40,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-28 00:24:40,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 343. [2019-11-28 00:24:40,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-11-28 00:24:40,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 525 transitions. [2019-11-28 00:24:40,309 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 525 transitions. Word has length 459 [2019-11-28 00:24:40,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:40,311 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 525 transitions. [2019-11-28 00:24:40,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-28 00:24:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 525 transitions. [2019-11-28 00:24:40,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 923 [2019-11-28 00:24:40,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:40,354 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 00:24:40,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:40,559 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:40,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:40,560 INFO L82 PathProgramCache]: Analyzing trace with hash -904244701, now seen corresponding path program 9 times [2019-11-28 00:24:40,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:40,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482140349] [2019-11-28 00:24:40,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:44,980 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 00:24:44,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482140349] [2019-11-28 00:24:44,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057466677] [2019-11-28 00:24:44,984 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 00:24:45,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-11-28 00:24:45,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:45,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 00:24:45,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:45,568 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 00:24:45,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:45,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 13] total 40 [2019-11-28 00:24:45,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861169754] [2019-11-28 00:24:45,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-28 00:24:45,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:45,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-28 00:24:45,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=1264, Unknown=0, NotChecked=0, Total=1560 [2019-11-28 00:24:45,573 INFO L87 Difference]: Start difference. First operand 343 states and 525 transitions. Second operand 40 states. [2019-11-28 00:24:46,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:46,886 INFO L93 Difference]: Finished difference Result 501 states and 882 transitions. [2019-11-28 00:24:46,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-11-28 00:24:46,887 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 922 [2019-11-28 00:24:46,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:46,894 INFO L225 Difference]: With dead ends: 501 [2019-11-28 00:24:46,894 INFO L226 Difference]: Without dead ends: 168 [2019-11-28 00:24:46,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1253 GetRequests, 1189 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=795, Invalid=3495, Unknown=0, NotChecked=0, Total=4290 [2019-11-28 00:24:46,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-28 00:24:46,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 134. [2019-11-28 00:24:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-28 00:24:46,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 199 transitions. [2019-11-28 00:24:46,915 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 199 transitions. Word has length 922 [2019-11-28 00:24:46,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:46,916 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 199 transitions. [2019-11-28 00:24:46,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-28 00:24:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 199 transitions. [2019-11-28 00:24:46,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2019-11-28 00:24:46,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:46,930 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 00:24:47,139 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:47,140 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:47,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:47,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1577357454, now seen corresponding path program 10 times [2019-11-28 00:24:47,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:47,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036175189] [2019-11-28 00:24:47,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:24:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:24:47,999 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:24:47,999 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:24:48,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:24:48 BoogieIcfgContainer [2019-11-28 00:24:48,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:24:48,214 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:24:48,214 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:24:48,215 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:24:48,215 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:24:27" (3/4) ... [2019-11-28 00:24:48,218 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:24:48,449 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:24:48,449 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:24:48,451 INFO L168 Benchmark]: Toolchain (without parser) took 21404.81 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 952.3 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 501.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:48,452 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:24:48,453 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.07 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:48,453 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.08 ms. Allocated memory is still 1.0 GB. Free memory is still 941.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:24:48,454 INFO L168 Benchmark]: Boogie Preprocessor took 31.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 21.0 MB). Free memory was 941.6 MB in the beginning and 1.0 GB in the end (delta: -65.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:48,454 INFO L168 Benchmark]: RCFGBuilder took 271.84 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 212.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -205.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:48,455 INFO L168 Benchmark]: TraceAbstraction took 20590.84 ms. Allocated memory was 1.3 GB in the beginning and 2.6 GB in the end (delta: 1.3 GB). Free memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: -760.9 MB). Peak memory consumption was 527.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:48,455 INFO L168 Benchmark]: Witness Printer took 234.91 ms. Allocated memory is still 2.6 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:24:48,457 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 240.07 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 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 30.08 ms. Allocated memory is still 1.0 GB. Free memory is still 941.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 21.0 MB). Free memory was 941.6 MB in the beginning and 1.0 GB in the end (delta: -65.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 271.84 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 212.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -205.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20590.84 ms. Allocated memory was 1.3 GB in the beginning and 2.6 GB in the end (delta: 1.3 GB). Free memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: -760.9 MB). Peak memory consumption was 527.2 MB. Max. memory is 11.5 GB. * Witness Printer took 234.91 ms. Allocated memory is still 2.6 GB. Free memory is still 2.0 GB. There was no memory consumed. 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: 20.3s, OverallIterations: 14, TraceHistogramMax: 177, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 234 SDtfs, 881 SDslu, 1148 SDs, 0 SdLazy, 3485 SolverSat, 1189 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3265 GetRequests, 2981 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2445 ImplicationChecksByTransitivity, 3.6s 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, 9.5s 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...