/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic BIGGEST_EQUIVALENCE_CLASS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 00:33:32,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 00:33:32,719 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 00:33:32,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 00:33:32,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 00:33:32,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 00:33:32,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 00:33:32,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 00:33:32,737 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 00:33:32,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 00:33:32,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 00:33:32,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 00:33:32,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 00:33:32,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 00:33:32,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 00:33:32,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 00:33:32,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 00:33:32,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 00:33:32,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 00:33:32,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 00:33:32,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 00:33:32,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 00:33:32,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 00:33:32,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 00:33:32,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 00:33:32,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 00:33:32,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 00:33:32,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 00:33:32,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 00:33:32,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 00:33:32,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 00:33:32,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 00:33:32,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 00:33:32,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 00:33:32,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 00:33:32,765 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 00:33:32,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 00:33:32,766 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 00:33:32,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 00:33:32,767 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 00:33:32,768 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 00:33:32,769 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-21 00:33:32,787 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 00:33:32,788 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 00:33:32,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 00:33:32,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 00:33:32,793 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 00:33:32,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 00:33:32,793 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 00:33:32,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 00:33:32,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 00:33:32,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 00:33:32,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 00:33:32,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 00:33:32,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 00:33:32,794 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 00:33:32,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 00:33:32,795 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 00:33:32,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 00:33:32,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 00:33:32,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 00:33:32,795 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 00:33:32,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 00:33:32,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 00:33:32,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 00:33:32,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 00:33:32,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 00:33:32,798 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 00:33:32,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:32,799 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 00:33:32,799 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 00:33:32,799 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> BIGGEST_EQUIVALENCE_CLASS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 [2020-07-21 00:33:33,075 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 00:33:33,089 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 00:33:33,092 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 00:33:33,094 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 00:33:33,094 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 00:33:33,095 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-07-21 00:33:33,160 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99f7958d5/a2a90d1539094cd5893b73674509da55/FLAG087ecfecb [2020-07-21 00:33:33,585 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 00:33:33,586 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-07-21 00:33:33,594 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99f7958d5/a2a90d1539094cd5893b73674509da55/FLAG087ecfecb [2020-07-21 00:33:33,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99f7958d5/a2a90d1539094cd5893b73674509da55 [2020-07-21 00:33:33,996 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 00:33:33,999 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 00:33:34,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 00:33:34,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 00:33:34,004 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 00:33:34,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 12:33:33" (1/1) ... [2020-07-21 00:33:34,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a290736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:33:34, skipping insertion in model container [2020-07-21 00:33:34,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 12:33:33" (1/1) ... [2020-07-21 00:33:34,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 00:33:34,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 00:33:34,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 00:33:34,236 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 00:33:34,250 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 00:33:34,262 INFO L208 MainTranslator]: Completed translation [2020-07-21 00:33:34,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:33:34 WrapperNode [2020-07-21 00:33:34,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 00:33:34,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 00:33:34,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 00:33:34,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 00:33:34,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:33:34" (1/1) ... [2020-07-21 00:33:34,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:33:34" (1/1) ... [2020-07-21 00:33:34,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:33:34" (1/1) ... [2020-07-21 00:33:34,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:33:34" (1/1) ... [2020-07-21 00:33:34,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:33:34" (1/1) ... [2020-07-21 00:33:34,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:33:34" (1/1) ... [2020-07-21 00:33:34,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:33:34" (1/1) ... [2020-07-21 00:33:34,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 00:33:34,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 00:33:34,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 00:33:34,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 00:33:34,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:33:34" (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 [2020-07-21 00:33:34,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 00:33:34,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 00:33:34,447 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-07-21 00:33:34,447 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 00:33:34,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 00:33:34,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 00:33:34,448 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-07-21 00:33:34,448 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 00:33:34,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 00:33:34,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 00:33:34,618 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 00:33:34,619 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-21 00:33:34,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 12:33:34 BoogieIcfgContainer [2020-07-21 00:33:34,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 00:33:34,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 00:33:34,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 00:33:34,628 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 00:33:34,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 12:33:33" (1/3) ... [2020-07-21 00:33:34,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57135071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 12:33:34, skipping insertion in model container [2020-07-21 00:33:34,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 12:33:34" (2/3) ... [2020-07-21 00:33:34,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57135071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 12:33:34, skipping insertion in model container [2020-07-21 00:33:34,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 12:33:34" (3/3) ... [2020-07-21 00:33:34,631 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-07-21 00:33:34,642 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 00:33:34,650 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 00:33:34,664 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 00:33:34,689 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 00:33:34,689 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 00:33:34,689 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 00:33:34,690 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 00:33:34,690 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 00:33:34,690 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 00:33:34,690 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 00:33:34,690 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 00:33:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-21 00:33:34,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-21 00:33:34,714 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:33:34,715 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:33:34,715 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:33:34,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:33:34,721 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-07-21 00:33:34,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:33:34,728 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1559461292] [2020-07-21 00:33:34,729 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:34,790 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 00:33:34,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:33:34,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 00:33:34,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:33:34,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 00:33:34,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 00:33:34,920 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1559461292] [2020-07-21 00:33:34,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 00:33:34,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 00:33:34,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612111332] [2020-07-21 00:33:34,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 00:33:34,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:33:34,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 00:33:34,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 00:33:34,954 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-07-21 00:33:35,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:33:35,085 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-21 00:33:35,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 00:33:35,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-21 00:33:35,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:33:35,103 INFO L225 Difference]: With dead ends: 35 [2020-07-21 00:33:35,103 INFO L226 Difference]: Without dead ends: 21 [2020-07-21 00:33:35,109 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 00:33:35,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-21 00:33:35,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-21 00:33:35,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-21 00:33:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-21 00:33:35,158 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-21 00:33:35,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:33:35,159 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-21 00:33:35,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 00:33:35,159 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-21 00:33:35,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-21 00:33:35,161 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:33:35,162 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:33:35,376 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:35,376 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:33:35,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:33:35,377 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-07-21 00:33:35,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:33:35,378 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [911355364] [2020-07-21 00:33:35,378 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:35,403 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 00:33:35,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:33:35,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 00:33:35,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:33:35,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 00:33:35,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 00:33:35,449 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [911355364] [2020-07-21 00:33:35,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 00:33:35,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 00:33:35,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769999437] [2020-07-21 00:33:35,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 00:33:35,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:33:35,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 00:33:35,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 00:33:35,453 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-21 00:33:35,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:33:35,512 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-21 00:33:35,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 00:33:35,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-21 00:33:35,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:33:35,515 INFO L225 Difference]: With dead ends: 27 [2020-07-21 00:33:35,516 INFO L226 Difference]: Without dead ends: 23 [2020-07-21 00:33:35,517 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 00:33:35,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-21 00:33:35,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-21 00:33:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-21 00:33:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-21 00:33:35,526 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-21 00:33:35,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:33:35,526 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-21 00:33:35,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 00:33:35,527 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-21 00:33:35,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-21 00:33:35,528 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:33:35,528 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:33:35,743 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:35,744 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:33:35,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:33:35,746 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-07-21 00:33:35,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:33:35,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [973919582] [2020-07-21 00:33:35,747 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:35,777 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 00:33:35,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:33:35,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 00:33:35,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:33:35,847 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-21 00:33:35,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:33:36,062 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-21 00:33:36,125 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [973919582] [2020-07-21 00:33:36,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:33:36,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-21 00:33:36,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584384846] [2020-07-21 00:33:36,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-21 00:33:36,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:33:36,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-21 00:33:36,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-21 00:33:36,130 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-07-21 00:33:36,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:33:36,251 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2020-07-21 00:33:36,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 00:33:36,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-21 00:33:36,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:33:36,254 INFO L225 Difference]: With dead ends: 32 [2020-07-21 00:33:36,254 INFO L226 Difference]: Without dead ends: 28 [2020-07-21 00:33:36,255 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-21 00:33:36,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-21 00:33:36,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-21 00:33:36,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-21 00:33:36,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-21 00:33:36,264 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 26 [2020-07-21 00:33:36,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:33:36,265 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-21 00:33:36,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-21 00:33:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-21 00:33:36,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-21 00:33:36,267 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:33:36,267 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:33:36,481 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:36,482 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:33:36,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:33:36,483 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-07-21 00:33:36,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:33:36,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [187919241] [2020-07-21 00:33:36,484 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:36,508 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 00:33:36,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:33:36,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 00:33:36,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:33:36,547 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-21 00:33:36,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:33:36,691 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-21 00:33:36,733 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [187919241] [2020-07-21 00:33:36,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:33:36,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-21 00:33:36,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102797746] [2020-07-21 00:33:36,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-21 00:33:36,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:33:36,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-21 00:33:36,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-21 00:33:36,736 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 9 states. [2020-07-21 00:33:36,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:33:36,809 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2020-07-21 00:33:36,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 00:33:36,809 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-21 00:33:36,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:33:36,812 INFO L225 Difference]: With dead ends: 37 [2020-07-21 00:33:36,812 INFO L226 Difference]: Without dead ends: 33 [2020-07-21 00:33:36,813 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-21 00:33:36,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-21 00:33:36,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2020-07-21 00:33:36,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-21 00:33:36,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-21 00:33:36,821 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 27 [2020-07-21 00:33:36,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:33:36,822 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-21 00:33:36,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-21 00:33:36,822 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-21 00:33:36,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-21 00:33:36,824 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:33:36,824 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:33:37,039 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:37,040 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:33:37,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:33:37,041 INFO L82 PathProgramCache]: Analyzing trace with hash -2027372739, now seen corresponding path program 2 times [2020-07-21 00:33:37,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:33:37,042 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [82421227] [2020-07-21 00:33:37,042 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:37,069 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 00:33:37,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:33:37,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 00:33:37,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:33:37,123 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-21 00:33:37,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:33:37,354 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:37,355 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:37,412 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:37,413 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-21 00:33:37,469 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [82421227] [2020-07-21 00:33:37,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:33:37,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-21 00:33:37,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6927871] [2020-07-21 00:33:37,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-21 00:33:37,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:33:37,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-21 00:33:37,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-21 00:33:37,473 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 11 states. [2020-07-21 00:33:37,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:33:37,630 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2020-07-21 00:33:37,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 00:33:37,631 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-07-21 00:33:37,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:33:37,634 INFO L225 Difference]: With dead ends: 42 [2020-07-21 00:33:37,635 INFO L226 Difference]: Without dead ends: 38 [2020-07-21 00:33:37,636 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-21 00:33:37,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-21 00:33:37,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2020-07-21 00:33:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-21 00:33:37,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-21 00:33:37,646 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 39 [2020-07-21 00:33:37,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:33:37,646 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-21 00:33:37,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-21 00:33:37,646 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-21 00:33:37,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-21 00:33:37,648 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:33:37,649 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:33:37,853 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:37,854 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:33:37,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:33:37,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 2 times [2020-07-21 00:33:37,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:33:37,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1507346797] [2020-07-21 00:33:37,856 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:37,885 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 00:33:37,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:33:37,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 00:33:37,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:33:37,937 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-21 00:33:37,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:33:38,168 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:38,215 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:38,216 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:38,255 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-21 00:33:38,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1507346797] [2020-07-21 00:33:38,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:33:38,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-21 00:33:38,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642263304] [2020-07-21 00:33:38,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-21 00:33:38,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:33:38,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-21 00:33:38,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-21 00:33:38,258 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 11 states. [2020-07-21 00:33:38,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:33:38,401 INFO L93 Difference]: Finished difference Result 47 states and 84 transitions. [2020-07-21 00:33:38,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 00:33:38,402 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2020-07-21 00:33:38,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:33:38,410 INFO L225 Difference]: With dead ends: 47 [2020-07-21 00:33:38,410 INFO L226 Difference]: Without dead ends: 43 [2020-07-21 00:33:38,411 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-21 00:33:38,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-21 00:33:38,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2020-07-21 00:33:38,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-21 00:33:38,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-21 00:33:38,433 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 41 [2020-07-21 00:33:38,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:33:38,434 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-21 00:33:38,434 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-21 00:33:38,435 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-21 00:33:38,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-21 00:33:38,439 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:33:38,440 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:33:38,640 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:38,641 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:33:38,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:33:38,641 INFO L82 PathProgramCache]: Analyzing trace with hash -767819153, now seen corresponding path program 3 times [2020-07-21 00:33:38,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:33:38,642 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [589719490] [2020-07-21 00:33:38,643 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:38,680 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 00:33:38,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:33:38,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 00:33:38,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:33:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 17 proven. 79 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-07-21 00:33:38,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:33:39,089 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:39,166 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:39,167 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:39,208 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:39,209 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:39,239 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 17 proven. 91 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2020-07-21 00:33:39,240 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [589719490] [2020-07-21 00:33:39,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:33:39,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2020-07-21 00:33:39,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69020660] [2020-07-21 00:33:39,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-21 00:33:39,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:33:39,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-21 00:33:39,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-21 00:33:39,242 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 13 states. [2020-07-21 00:33:39,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:33:39,403 INFO L93 Difference]: Finished difference Result 52 states and 102 transitions. [2020-07-21 00:33:39,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 00:33:39,404 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2020-07-21 00:33:39,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:33:39,406 INFO L225 Difference]: With dead ends: 52 [2020-07-21 00:33:39,410 INFO L226 Difference]: Without dead ends: 48 [2020-07-21 00:33:39,411 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 111 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-07-21 00:33:39,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-21 00:33:39,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2020-07-21 00:33:39,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-21 00:33:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-21 00:33:39,436 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 65 [2020-07-21 00:33:39,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:33:39,436 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-21 00:33:39,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-21 00:33:39,436 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-21 00:33:39,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-07-21 00:33:39,444 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:33:39,444 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:33:39,645 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:39,645 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:33:39,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:33:39,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1474757101, now seen corresponding path program 3 times [2020-07-21 00:33:39,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:33:39,647 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [87771506] [2020-07-21 00:33:39,647 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:39,696 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 00:33:39,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:33:39,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 00:33:39,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:33:39,773 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-07-21 00:33:39,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:33:40,188 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:40,292 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:40,293 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:40,345 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:40,378 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 181 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2020-07-21 00:33:40,379 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [87771506] [2020-07-21 00:33:40,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:33:40,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2020-07-21 00:33:40,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093196992] [2020-07-21 00:33:40,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-21 00:33:40,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:33:40,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-21 00:33:40,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-21 00:33:40,381 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 13 states. [2020-07-21 00:33:40,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:33:40,530 INFO L93 Difference]: Finished difference Result 57 states and 122 transitions. [2020-07-21 00:33:40,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 00:33:40,533 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2020-07-21 00:33:40,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:33:40,536 INFO L225 Difference]: With dead ends: 57 [2020-07-21 00:33:40,536 INFO L226 Difference]: Without dead ends: 53 [2020-07-21 00:33:40,537 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 172 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-07-21 00:33:40,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-21 00:33:40,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2020-07-21 00:33:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-21 00:33:40,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-21 00:33:40,550 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 96 [2020-07-21 00:33:40,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:33:40,550 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-21 00:33:40,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-21 00:33:40,551 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-21 00:33:40,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-07-21 00:33:40,553 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:33:40,553 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:33:40,767 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:40,768 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:33:40,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:33:40,768 INFO L82 PathProgramCache]: Analyzing trace with hash 838335741, now seen corresponding path program 4 times [2020-07-21 00:33:40,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:33:40,769 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1962461143] [2020-07-21 00:33:40,769 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:40,831 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 00:33:40,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:33:40,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-21 00:33:40,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:33:40,923 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 244 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2020-07-21 00:33:40,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:33:41,494 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:41,495 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:41,689 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:41,777 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:41,818 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:41,860 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 266 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2020-07-21 00:33:41,860 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1962461143] [2020-07-21 00:33:41,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:33:41,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2020-07-21 00:33:41,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601006929] [2020-07-21 00:33:41,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-21 00:33:41,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:33:41,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-21 00:33:41,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-07-21 00:33:41,862 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 15 states. [2020-07-21 00:33:42,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:33:42,148 INFO L93 Difference]: Finished difference Result 62 states and 144 transitions. [2020-07-21 00:33:42,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-21 00:33:42,148 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 117 [2020-07-21 00:33:42,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:33:42,152 INFO L225 Difference]: With dead ends: 62 [2020-07-21 00:33:42,152 INFO L226 Difference]: Without dead ends: 58 [2020-07-21 00:33:42,153 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 211 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-07-21 00:33:42,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-21 00:33:42,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2020-07-21 00:33:42,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-21 00:33:42,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2020-07-21 00:33:42,165 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 73 transitions. Word has length 117 [2020-07-21 00:33:42,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:33:42,166 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 73 transitions. [2020-07-21 00:33:42,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-21 00:33:42,166 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 73 transitions. [2020-07-21 00:33:42,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-07-21 00:33:42,169 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:33:42,169 INFO L422 BasicCegarLoop]: trace histogram [27, 27, 21, 13, 13, 13, 13, 13, 13, 13, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:33:42,382 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:42,383 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:33:42,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:33:42,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2072922826, now seen corresponding path program 4 times [2020-07-21 00:33:42,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:33:42,385 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1226953020] [2020-07-21 00:33:42,385 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:42,438 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 00:33:42,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:33:42,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-21 00:33:42,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:33:42,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 86 proven. 506 refuted. 0 times theorem prover too weak. 1334 trivial. 0 not checked. [2020-07-21 00:33:42,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:33:43,244 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:43,469 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:43,555 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:43,557 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:43,609 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:43,610 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:43,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 86 proven. 532 refuted. 0 times theorem prover too weak. 1308 trivial. 0 not checked. [2020-07-21 00:33:43,670 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1226953020] [2020-07-21 00:33:43,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:33:43,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2020-07-21 00:33:43,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517663884] [2020-07-21 00:33:43,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-21 00:33:43,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:33:43,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-21 00:33:43,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-07-21 00:33:43,673 INFO L87 Difference]: Start difference. First operand 41 states and 73 transitions. Second operand 15 states. [2020-07-21 00:33:43,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:33:43,834 INFO L93 Difference]: Finished difference Result 67 states and 168 transitions. [2020-07-21 00:33:43,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-21 00:33:43,835 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 190 [2020-07-21 00:33:43,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:33:43,838 INFO L225 Difference]: With dead ends: 67 [2020-07-21 00:33:43,838 INFO L226 Difference]: Without dead ends: 63 [2020-07-21 00:33:43,839 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 356 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-07-21 00:33:43,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-21 00:33:43,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2020-07-21 00:33:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-21 00:33:43,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2020-07-21 00:33:43,850 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 73 transitions. Word has length 190 [2020-07-21 00:33:43,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:33:43,851 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 73 transitions. [2020-07-21 00:33:43,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-21 00:33:43,851 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 73 transitions. [2020-07-21 00:33:43,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-07-21 00:33:43,855 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:33:43,855 INFO L422 BasicCegarLoop]: trace histogram [43, 43, 22, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:33:44,063 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:44,064 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:33:44,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:33:44,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1082984306, now seen corresponding path program 5 times [2020-07-21 00:33:44,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:33:44,066 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1652832662] [2020-07-21 00:33:44,066 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:44,140 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 00:33:44,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:33:44,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-21 00:33:44,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:33:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4662 backedges. 159 proven. 967 refuted. 0 times theorem prover too weak. 3536 trivial. 0 not checked. [2020-07-21 00:33:44,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:33:45,419 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:45,750 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:45,901 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:45,983 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:46,028 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:46,029 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4662 backedges. 159 proven. 1002 refuted. 0 times theorem prover too weak. 3501 trivial. 0 not checked. [2020-07-21 00:33:46,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1652832662] [2020-07-21 00:33:46,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:33:46,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 17 [2020-07-21 00:33:46,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234555291] [2020-07-21 00:33:46,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-21 00:33:46,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:33:46,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-21 00:33:46,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-21 00:33:46,126 INFO L87 Difference]: Start difference. First operand 41 states and 73 transitions. Second operand 17 states. [2020-07-21 00:33:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:33:46,329 INFO L93 Difference]: Finished difference Result 72 states and 194 transitions. [2020-07-21 00:33:46,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-21 00:33:46,330 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 286 [2020-07-21 00:33:46,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:33:46,333 INFO L225 Difference]: With dead ends: 72 [2020-07-21 00:33:46,334 INFO L226 Difference]: Without dead ends: 68 [2020-07-21 00:33:46,334 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 545 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2020-07-21 00:33:46,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-21 00:33:46,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2020-07-21 00:33:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-21 00:33:46,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2020-07-21 00:33:46,359 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 286 [2020-07-21 00:33:46,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:33:46,362 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2020-07-21 00:33:46,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-21 00:33:46,362 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2020-07-21 00:33:46,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2020-07-21 00:33:46,368 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:33:46,368 INFO L422 BasicCegarLoop]: trace histogram [43, 43, 34, 21, 21, 21, 21, 21, 21, 21, 13, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:33:46,583 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:46,584 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:33:46,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:33:46,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1006419304, now seen corresponding path program 5 times [2020-07-21 00:33:46,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:33:46,585 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [370833591] [2020-07-21 00:33:46,585 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:46,675 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 00:33:46,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:33:46,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-21 00:33:46,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:33:46,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 159 proven. 1055 refuted. 0 times theorem prover too weak. 3799 trivial. 0 not checked. [2020-07-21 00:33:46,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:33:48,039 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:48,340 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:48,492 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:48,581 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:48,582 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:48,625 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 159 proven. 1095 refuted. 0 times theorem prover too weak. 3759 trivial. 0 not checked. [2020-07-21 00:33:48,710 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [370833591] [2020-07-21 00:33:48,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:33:48,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 17 [2020-07-21 00:33:48,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908939395] [2020-07-21 00:33:48,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-21 00:33:48,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:33:48,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-21 00:33:48,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-21 00:33:48,713 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand 17 states. [2020-07-21 00:33:48,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:33:48,916 INFO L93 Difference]: Finished difference Result 77 states and 222 transitions. [2020-07-21 00:33:48,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-21 00:33:48,917 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 299 [2020-07-21 00:33:48,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:33:48,920 INFO L225 Difference]: With dead ends: 77 [2020-07-21 00:33:48,920 INFO L226 Difference]: Without dead ends: 73 [2020-07-21 00:33:48,921 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 570 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2020-07-21 00:33:48,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-21 00:33:48,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2020-07-21 00:33:48,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-21 00:33:48,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2020-07-21 00:33:48,932 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 299 [2020-07-21 00:33:48,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:33:48,933 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2020-07-21 00:33:48,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-21 00:33:48,934 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2020-07-21 00:33:48,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2020-07-21 00:33:48,945 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:33:48,945 INFO L422 BasicCegarLoop]: trace histogram [77, 77, 39, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:33:49,159 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:49,160 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:33:49,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:33:49,161 INFO L82 PathProgramCache]: Analyzing trace with hash 785285043, now seen corresponding path program 6 times [2020-07-21 00:33:49,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:33:49,161 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [384660093] [2020-07-21 00:33:49,162 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:49,286 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 00:33:49,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:33:49,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-21 00:33:49,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:33:49,512 INFO L134 CoverageAnalysis]: Checked inductivity of 15219 backedges. 391 proven. 2126 refuted. 0 times theorem prover too weak. 12702 trivial. 0 not checked. [2020-07-21 00:33:49,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:33:51,410 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:51,976 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:52,349 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:52,534 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:52,535 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:52,618 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:52,666 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:52,667 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 15219 backedges. 391 proven. 2177 refuted. 0 times theorem prover too weak. 12651 trivial. 0 not checked. [2020-07-21 00:33:52,861 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [384660093] [2020-07-21 00:33:52,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:33:52,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 19 [2020-07-21 00:33:52,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469097898] [2020-07-21 00:33:52,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-21 00:33:52,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:33:52,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-21 00:33:52,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2020-07-21 00:33:52,863 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand 19 states. [2020-07-21 00:33:53,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:33:53,293 INFO L93 Difference]: Finished difference Result 82 states and 252 transitions. [2020-07-21 00:33:53,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 00:33:53,295 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 507 [2020-07-21 00:33:53,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:33:53,300 INFO L225 Difference]: With dead ends: 82 [2020-07-21 00:33:53,301 INFO L226 Difference]: Without dead ends: 78 [2020-07-21 00:33:53,304 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1021 GetRequests, 983 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2020-07-21 00:33:53,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-21 00:33:53,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 51. [2020-07-21 00:33:53,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-21 00:33:53,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 109 transitions. [2020-07-21 00:33:53,322 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 109 transitions. Word has length 507 [2020-07-21 00:33:53,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:33:53,324 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 109 transitions. [2020-07-21 00:33:53,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-21 00:33:53,324 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 109 transitions. [2020-07-21 00:33:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2020-07-21 00:33:53,333 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:33:53,334 INFO L422 BasicCegarLoop]: trace histogram [65, 65, 53, 32, 32, 32, 32, 32, 32, 32, 21, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:33:53,546 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:53,547 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:33:53,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:33:53,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1350718391, now seen corresponding path program 6 times [2020-07-21 00:33:53,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:33:53,548 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [180498978] [2020-07-21 00:33:53,548 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:53,681 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 00:33:53,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:33:53,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-21 00:33:53,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:33:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 333 proven. 1918 refuted. 0 times theorem prover too weak. 9431 trivial. 0 not checked. [2020-07-21 00:33:53,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:33:55,507 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:56,107 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:56,108 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:56,476 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:56,477 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:56,630 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:56,715 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:56,716 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:56,762 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:33:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 333 proven. 1975 refuted. 0 times theorem prover too weak. 9374 trivial. 0 not checked. [2020-07-21 00:33:56,868 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [180498978] [2020-07-21 00:33:56,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:33:56,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 19 [2020-07-21 00:33:56,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878806562] [2020-07-21 00:33:56,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-21 00:33:56,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:33:56,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-21 00:33:56,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2020-07-21 00:33:56,870 INFO L87 Difference]: Start difference. First operand 51 states and 109 transitions. Second operand 19 states. [2020-07-21 00:33:57,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:33:57,138 INFO L93 Difference]: Finished difference Result 87 states and 284 transitions. [2020-07-21 00:33:57,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 00:33:57,139 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 450 [2020-07-21 00:33:57,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:33:57,143 INFO L225 Difference]: With dead ends: 87 [2020-07-21 00:33:57,143 INFO L226 Difference]: Without dead ends: 83 [2020-07-21 00:33:57,144 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 906 GetRequests, 868 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2020-07-21 00:33:57,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-21 00:33:57,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 51. [2020-07-21 00:33:57,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-21 00:33:57,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 109 transitions. [2020-07-21 00:33:57,157 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 109 transitions. Word has length 450 [2020-07-21 00:33:57,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:33:57,158 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 109 transitions. [2020-07-21 00:33:57,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-21 00:33:57,158 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 109 transitions. [2020-07-21 00:33:57,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2020-07-21 00:33:57,170 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:33:57,171 INFO L422 BasicCegarLoop]: trace histogram [163, 163, 82, 81, 81, 81, 81, 81, 81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:33:57,383 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:57,384 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:33:57,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:33:57,385 INFO L82 PathProgramCache]: Analyzing trace with hash 40336450, now seen corresponding path program 7 times [2020-07-21 00:33:57,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:33:57,386 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [665485635] [2020-07-21 00:33:57,386 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:33:57,657 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 00:33:57,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:33:57,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-21 00:33:57,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:33:58,192 INFO L134 CoverageAnalysis]: Checked inductivity of 69012 backedges. 797 proven. 5632 refuted. 0 times theorem prover too weak. 62583 trivial. 0 not checked. [2020-07-21 00:33:58,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:34:01,905 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:01,906 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:03,169 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:03,651 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:03,652 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:03,983 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:03,984 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:04,143 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:04,144 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:04,258 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:04,259 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:04,331 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:04,795 INFO L134 CoverageAnalysis]: Checked inductivity of 69012 backedges. 797 proven. 5702 refuted. 0 times theorem prover too weak. 62513 trivial. 0 not checked. [2020-07-21 00:34:04,796 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [665485635] [2020-07-21 00:34:04,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:34:04,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 21 [2020-07-21 00:34:04,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654545647] [2020-07-21 00:34:04,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-21 00:34:04,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:34:04,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-21 00:34:04,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2020-07-21 00:34:04,799 INFO L87 Difference]: Start difference. First operand 51 states and 109 transitions. Second operand 21 states. [2020-07-21 00:34:05,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:34:05,359 INFO L93 Difference]: Finished difference Result 92 states and 318 transitions. [2020-07-21 00:34:05,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-21 00:34:05,360 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1066 [2020-07-21 00:34:05,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:34:05,366 INFO L225 Difference]: With dead ends: 92 [2020-07-21 00:34:05,366 INFO L226 Difference]: Without dead ends: 88 [2020-07-21 00:34:05,367 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2140 GetRequests, 2097 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2020-07-21 00:34:05,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-21 00:34:05,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 56. [2020-07-21 00:34:05,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-21 00:34:05,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 130 transitions. [2020-07-21 00:34:05,380 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 130 transitions. Word has length 1066 [2020-07-21 00:34:05,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:34:05,382 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 130 transitions. [2020-07-21 00:34:05,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-21 00:34:05,382 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 130 transitions. [2020-07-21 00:34:05,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2020-07-21 00:34:05,388 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:34:05,388 INFO L422 BasicCegarLoop]: trace histogram [101, 101, 84, 50, 50, 50, 50, 50, 50, 50, 34, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:34:05,602 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:34:05,603 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:34:05,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:34:05,603 INFO L82 PathProgramCache]: Analyzing trace with hash 822363973, now seen corresponding path program 7 times [2020-07-21 00:34:05,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:34:05,604 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [924938237] [2020-07-21 00:34:05,604 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:34:05,805 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 00:34:05,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:34:05,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-21 00:34:05,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:34:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 28586 backedges. 537 proven. 3626 refuted. 0 times theorem prover too weak. 24423 trivial. 0 not checked. [2020-07-21 00:34:06,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:34:08,726 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:08,727 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:09,658 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:10,118 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:10,119 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:10,389 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:10,390 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:10,577 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:10,675 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:10,729 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:11,138 INFO L134 CoverageAnalysis]: Checked inductivity of 28586 backedges. 537 proven. 3703 refuted. 0 times theorem prover too weak. 24346 trivial. 0 not checked. [2020-07-21 00:34:11,143 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [924938237] [2020-07-21 00:34:11,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:34:11,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 21 [2020-07-21 00:34:11,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799070158] [2020-07-21 00:34:11,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-21 00:34:11,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:34:11,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-21 00:34:11,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2020-07-21 00:34:11,148 INFO L87 Difference]: Start difference. First operand 56 states and 130 transitions. Second operand 21 states. [2020-07-21 00:34:11,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:34:11,729 INFO L93 Difference]: Finished difference Result 97 states and 354 transitions. [2020-07-21 00:34:11,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-21 00:34:11,729 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 697 [2020-07-21 00:34:11,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:34:11,734 INFO L225 Difference]: With dead ends: 97 [2020-07-21 00:34:11,734 INFO L226 Difference]: Without dead ends: 93 [2020-07-21 00:34:11,735 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1401 GetRequests, 1358 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2020-07-21 00:34:11,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-07-21 00:34:11,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 56. [2020-07-21 00:34:11,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-21 00:34:11,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 130 transitions. [2020-07-21 00:34:11,755 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 130 transitions. Word has length 697 [2020-07-21 00:34:11,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:34:11,756 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 130 transitions. [2020-07-21 00:34:11,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-21 00:34:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 130 transitions. [2020-07-21 00:34:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1951 [2020-07-21 00:34:11,814 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:34:11,815 INFO L422 BasicCegarLoop]: trace histogram [299, 299, 150, 149, 149, 149, 149, 149, 149, 149, 149, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:34:12,027 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:34:12,028 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:34:12,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:34:12,029 INFO L82 PathProgramCache]: Analyzing trace with hash 395569872, now seen corresponding path program 8 times [2020-07-21 00:34:12,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:34:12,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1936379095] [2020-07-21 00:34:12,030 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:34:12,405 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 00:34:12,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:34:12,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-21 00:34:12,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:34:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 233334 backedges. 1911 proven. 11715 refuted. 0 times theorem prover too weak. 219708 trivial. 0 not checked. [2020-07-21 00:34:13,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:34:19,458 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:22,518 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:24,129 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:24,683 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:24,684 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:25,081 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:25,082 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:25,296 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:25,390 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:25,392 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:25,442 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:25,443 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:26,783 INFO L134 CoverageAnalysis]: Checked inductivity of 233334 backedges. 1911 proven. 11807 refuted. 0 times theorem prover too weak. 219616 trivial. 0 not checked. [2020-07-21 00:34:26,784 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1936379095] [2020-07-21 00:34:26,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:34:26,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 23 [2020-07-21 00:34:26,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101775719] [2020-07-21 00:34:26,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-21 00:34:26,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:34:26,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-21 00:34:26,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2020-07-21 00:34:26,789 INFO L87 Difference]: Start difference. First operand 56 states and 130 transitions. Second operand 23 states. [2020-07-21 00:34:27,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:34:27,225 INFO L93 Difference]: Finished difference Result 102 states and 392 transitions. [2020-07-21 00:34:27,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-21 00:34:27,226 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1950 [2020-07-21 00:34:27,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:34:27,233 INFO L225 Difference]: With dead ends: 102 [2020-07-21 00:34:27,233 INFO L226 Difference]: Without dead ends: 98 [2020-07-21 00:34:27,234 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3909 GetRequests, 3861 SyntacticMatches, 18 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2020-07-21 00:34:27,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-21 00:34:27,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 61. [2020-07-21 00:34:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-21 00:34:27,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 153 transitions. [2020-07-21 00:34:27,249 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 153 transitions. Word has length 1950 [2020-07-21 00:34:27,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:34:27,252 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 153 transitions. [2020-07-21 00:34:27,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-21 00:34:27,252 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 153 transitions. [2020-07-21 00:34:27,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1354 [2020-07-21 00:34:27,270 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:34:27,271 INFO L422 BasicCegarLoop]: trace histogram [197, 197, 164, 98, 98, 98, 98, 98, 98, 98, 66, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:34:27,486 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:34:27,487 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:34:27,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:34:27,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1956381947, now seen corresponding path program 8 times [2020-07-21 00:34:27,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:34:27,488 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [128467862] [2020-07-21 00:34:27,488 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:34:27,809 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 00:34:27,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:34:27,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-21 00:34:27,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:34:28,623 INFO L134 CoverageAnalysis]: Checked inductivity of 109602 backedges. 1201 proven. 8306 refuted. 0 times theorem prover too weak. 100095 trivial. 0 not checked. [2020-07-21 00:34:28,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:34:32,990 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:35,127 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:35,127 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:36,336 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:36,338 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:36,806 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:37,110 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:37,110 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:37,278 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:37,375 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:37,432 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:38,114 INFO L134 CoverageAnalysis]: Checked inductivity of 109602 backedges. 1201 proven. 8406 refuted. 0 times theorem prover too weak. 99995 trivial. 0 not checked. [2020-07-21 00:34:38,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [128467862] [2020-07-21 00:34:38,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:34:38,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 22 [2020-07-21 00:34:38,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944774842] [2020-07-21 00:34:38,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-21 00:34:38,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:34:38,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-21 00:34:38,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2020-07-21 00:34:38,117 INFO L87 Difference]: Start difference. First operand 61 states and 153 transitions. Second operand 22 states. [2020-07-21 00:34:38,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:34:38,714 INFO L93 Difference]: Finished difference Result 107 states and 432 transitions. [2020-07-21 00:34:38,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-21 00:34:38,715 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1353 [2020-07-21 00:34:38,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:34:38,721 INFO L225 Difference]: With dead ends: 107 [2020-07-21 00:34:38,722 INFO L226 Difference]: Without dead ends: 103 [2020-07-21 00:34:38,723 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2714 GetRequests, 2666 SyntacticMatches, 19 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2020-07-21 00:34:38,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-21 00:34:38,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 61. [2020-07-21 00:34:38,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-21 00:34:38,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 153 transitions. [2020-07-21 00:34:38,738 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 153 transitions. Word has length 1353 [2020-07-21 00:34:38,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:34:38,739 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 153 transitions. [2020-07-21 00:34:38,739 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-21 00:34:38,739 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 153 transitions. [2020-07-21 00:34:38,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2523 [2020-07-21 00:34:38,789 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:34:38,790 INFO L422 BasicCegarLoop]: trace histogram [387, 387, 194, 193, 193, 193, 193, 193, 193, 193, 193, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:34:39,001 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:34:39,002 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:34:39,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:34:39,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1336408704, now seen corresponding path program 9 times [2020-07-21 00:34:39,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:34:39,004 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1554211659] [2020-07-21 00:34:39,004 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:34:39,522 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 00:34:39,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:34:39,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 1404 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-21 00:34:39,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:34:42,522 INFO L134 CoverageAnalysis]: Checked inductivity of 391404 backedges. 2389 proven. 17399 refuted. 0 times theorem prover too weak. 371616 trivial. 0 not checked. [2020-07-21 00:34:42,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:34:52,108 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:54,870 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:57,160 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:58,147 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:58,148 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:58,870 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:58,871 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:59,219 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:59,220 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:59,397 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:59,497 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:34:59,553 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:35:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 391404 backedges. 2389 proven. 17516 refuted. 0 times theorem prover too weak. 371499 trivial. 0 not checked. [2020-07-21 00:35:01,633 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1554211659] [2020-07-21 00:35:01,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:35:01,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 24 [2020-07-21 00:35:01,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716138548] [2020-07-21 00:35:01,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-21 00:35:01,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:35:01,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-21 00:35:01,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-07-21 00:35:01,636 INFO L87 Difference]: Start difference. First operand 61 states and 153 transitions. Second operand 24 states. [2020-07-21 00:35:02,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:35:02,703 INFO L93 Difference]: Finished difference Result 112 states and 474 transitions. [2020-07-21 00:35:02,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-21 00:35:02,704 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 2522 [2020-07-21 00:35:02,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:35:02,712 INFO L225 Difference]: With dead ends: 112 [2020-07-21 00:35:02,712 INFO L226 Difference]: Without dead ends: 108 [2020-07-21 00:35:02,713 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5054 GetRequests, 5001 SyntacticMatches, 21 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=385, Invalid=737, Unknown=0, NotChecked=0, Total=1122 [2020-07-21 00:35:02,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-07-21 00:35:02,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 66. [2020-07-21 00:35:02,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-21 00:35:02,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 178 transitions. [2020-07-21 00:35:02,732 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 178 transitions. Word has length 2522 [2020-07-21 00:35:02,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:35:02,735 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 178 transitions. [2020-07-21 00:35:02,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-21 00:35:02,735 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 178 transitions. [2020-07-21 00:35:02,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3700 [2020-07-21 00:35:02,868 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:35:02,869 INFO L422 BasicCegarLoop]: trace histogram [539, 539, 458, 269, 269, 269, 269, 269, 269, 269, 189, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:35:03,074 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:35:03,075 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:35:03,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:35:03,076 INFO L82 PathProgramCache]: Analyzing trace with hash 396523304, now seen corresponding path program 9 times [2020-07-21 00:35:03,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:35:03,077 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1844455242] [2020-07-21 00:35:03,077 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:35:03,763 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 00:35:03,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:35:03,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 2050 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-21 00:35:03,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:35:08,228 INFO L134 CoverageAnalysis]: Checked inductivity of 828801 backedges. 3656 proven. 27297 refuted. 0 times theorem prover too weak. 797848 trivial. 0 not checked. [2020-07-21 00:35:08,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:35:22,040 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:35:25,816 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:35:25,817 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:35:28,999 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:35:30,276 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:35:31,267 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:35:31,776 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:35:31,956 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:35:32,062 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:35:32,063 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:35:32,128 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:35:32,194 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:35:36,644 INFO L134 CoverageAnalysis]: Checked inductivity of 828801 backedges. 3668 proven. 27402 refuted. 0 times theorem prover too weak. 797731 trivial. 0 not checked. [2020-07-21 00:35:36,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1844455242] [2020-07-21 00:35:36,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:35:36,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 24 [2020-07-21 00:35:36,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55774772] [2020-07-21 00:35:36,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-21 00:35:36,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:35:36,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-21 00:35:36,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-07-21 00:35:36,649 INFO L87 Difference]: Start difference. First operand 66 states and 178 transitions. Second operand 24 states. [2020-07-21 00:35:37,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:35:37,325 INFO L93 Difference]: Finished difference Result 298 states and 3289 transitions. [2020-07-21 00:35:37,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-21 00:35:37,326 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 3699 [2020-07-21 00:35:37,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:35:37,334 INFO L225 Difference]: With dead ends: 298 [2020-07-21 00:35:37,335 INFO L226 Difference]: Without dead ends: 74 [2020-07-21 00:35:37,354 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7407 GetRequests, 7354 SyntacticMatches, 21 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=385, Invalid=737, Unknown=0, NotChecked=0, Total=1122 [2020-07-21 00:35:37,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-21 00:35:37,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-07-21 00:35:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-21 00:35:37,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2020-07-21 00:35:37,369 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 3699 [2020-07-21 00:35:37,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:35:37,370 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2020-07-21 00:35:37,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-21 00:35:37,371 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2020-07-21 00:35:37,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1676 [2020-07-21 00:35:37,400 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:35:37,401 INFO L422 BasicCegarLoop]: trace histogram [245, 245, 198, 122, 122, 122, 122, 122, 122, 122, 76, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:35:37,615 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:35:37,616 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:35:37,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:35:37,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1470663979, now seen corresponding path program 10 times [2020-07-21 00:35:37,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:35:37,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1995570121] [2020-07-21 00:35:37,617 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:35:38,110 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 00:35:38,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 00:35:38,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-21 00:35:38,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 00:35:39,194 INFO L134 CoverageAnalysis]: Checked inductivity of 168587 backedges. 2104 proven. 11549 refuted. 0 times theorem prover too weak. 154934 trivial. 0 not checked. [2020-07-21 00:35:39,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 00:35:46,032 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:35:48,714 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:35:50,387 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:35:51,442 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:35:51,443 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:35:52,061 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:35:52,333 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:35:52,520 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:35:52,649 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:35:52,715 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:35:52,794 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 00:35:53,786 INFO L134 CoverageAnalysis]: Checked inductivity of 168587 backedges. 2114 proven. 11656 refuted. 0 times theorem prover too weak. 154817 trivial. 0 not checked. [2020-07-21 00:35:53,787 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1995570121] [2020-07-21 00:35:53,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 00:35:53,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 24 [2020-07-21 00:35:53,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212921293] [2020-07-21 00:35:53,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-21 00:35:53,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 00:35:53,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-21 00:35:53,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-07-21 00:35:53,790 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand 24 states. [2020-07-21 00:35:54,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 00:35:54,271 INFO L93 Difference]: Finished difference Result 117 states and 159 transitions. [2020-07-21 00:35:54,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-21 00:35:54,273 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1675 [2020-07-21 00:35:54,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 00:35:54,277 INFO L225 Difference]: With dead ends: 117 [2020-07-21 00:35:54,277 INFO L226 Difference]: Without dead ends: 85 [2020-07-21 00:35:54,280 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3359 GetRequests, 3306 SyntacticMatches, 21 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=385, Invalid=737, Unknown=0, NotChecked=0, Total=1122 [2020-07-21 00:35:54,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-07-21 00:35:54,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2020-07-21 00:35:54,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-21 00:35:54,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 107 transitions. [2020-07-21 00:35:54,291 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 107 transitions. Word has length 1675 [2020-07-21 00:35:54,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 00:35:54,291 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 107 transitions. [2020-07-21 00:35:54,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-21 00:35:54,292 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 107 transitions. [2020-07-21 00:35:54,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-07-21 00:35:54,307 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 00:35:54,308 INFO L422 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 00:35:54,522 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:35:54,523 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 00:35:54,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 00:35:54,524 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 11 times [2020-07-21 00:35:54,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 00:35:54,525 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [769745163] [2020-07-21 00:35:54,525 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:35:55,271 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 00:35:55,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-21 00:35:55,272 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 00:35:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 00:35:55,507 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 00:35:55,711 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-21 00:35:55,711 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-21 00:35:55,925 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 00:35:56,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 12:35:56 BoogieIcfgContainer [2020-07-21 00:35:56,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 00:35:56,211 INFO L168 Benchmark]: Toolchain (without parser) took 142212.74 ms. Allocated memory was 146.3 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 104.3 MB in the beginning and 447.3 MB in the end (delta: -343.0 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2020-07-21 00:35:56,213 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-21 00:35:56,219 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.24 ms. Allocated memory is still 146.3 MB. Free memory was 103.9 MB in the beginning and 94.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-07-21 00:35:56,220 INFO L168 Benchmark]: Boogie Preprocessor took 23.84 ms. Allocated memory is still 146.3 MB. Free memory was 94.7 MB in the beginning and 93.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-21 00:35:56,222 INFO L168 Benchmark]: RCFGBuilder took 334.99 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 93.3 MB in the beginning and 170.9 MB in the end (delta: -77.6 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-21 00:35:56,223 INFO L168 Benchmark]: TraceAbstraction took 141583.95 ms. Allocated memory was 203.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 170.9 MB in the beginning and 447.3 MB in the end (delta: -276.4 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2020-07-21 00:35:56,226 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 263.24 ms. Allocated memory is still 146.3 MB. Free memory was 103.9 MB in the beginning and 94.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.84 ms. Allocated memory is still 146.3 MB. Free memory was 94.7 MB in the beginning and 93.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 334.99 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 93.3 MB in the beginning and 170.9 MB in the end (delta: -77.6 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 141583.95 ms. Allocated memory was 203.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 170.9 MB in the beginning and 447.3 MB in the end (delta: -276.4 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 10; VAL [x=10] [L25] CALL, EXPR fibo(x) VAL [\old(n)=10] [L6] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L8] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L6] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L8] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L6] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L8] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] 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) VAL [fibo(x)=55, x=10] [L25] int result = fibo(x); [L26] COND TRUE result == 55 VAL [result=55, x=10] [L27] __VERIFIER_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 141.2s, OverallIterations: 22, TraceHistogramMax: 539, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 374 SDtfs, 1581 SDslu, 1905 SDs, 0 SdLazy, 2396 SolverSat, 3636 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30350 GetRequests, 29695 SyntacticMatches, 240 SemanticMatches, 415 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2382 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 402 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 123.6s InterpolantComputationTime, 16344 NumberOfCodeBlocks, 5069 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 30197 ConstructedInterpolants, 0 QuantifiedInterpolants, 67316711 SizeOfPredicates, 141 NumberOfNonLiveVariables, 8567 ConjunctsInSsa, 282 ConjunctsInUnsatCore, 40 InterpolantComputations, 2 PerfectInterpolantSequences, 3552241/3738466 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...