/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 DAGSIZE --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-20 21:14:33,463 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 21:14:33,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 21:14:33,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 21:14:33,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 21:14:33,490 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 21:14:33,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 21:14:33,503 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 21:14:33,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 21:14:33,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 21:14:33,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 21:14:33,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 21:14:33,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 21:14:33,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 21:14:33,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 21:14:33,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 21:14:33,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 21:14:33,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 21:14:33,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 21:14:33,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 21:14:33,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 21:14:33,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 21:14:33,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 21:14:33,541 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 21:14:33,544 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 21:14:33,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 21:14:33,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 21:14:33,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 21:14:33,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 21:14:33,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 21:14:33,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 21:14:33,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 21:14:33,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 21:14:33,551 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 21:14:33,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 21:14:33,553 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 21:14:33,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 21:14:33,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 21:14:33,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 21:14:33,555 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 21:14:33,556 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 21:14:33,557 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-20 21:14:33,592 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 21:14:33,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 21:14:33,594 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 21:14:33,597 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 21:14:33,598 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 21:14:33,598 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 21:14:33,598 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 21:14:33,598 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 21:14:33,598 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 21:14:33,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 21:14:33,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 21:14:33,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 21:14:33,599 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 21:14:33,600 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 21:14:33,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 21:14:33,600 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 21:14:33,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 21:14:33,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 21:14:33,602 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 21:14:33,602 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 21:14:33,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 21:14:33,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 21:14:33,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 21:14:33,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 21:14:33,603 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 21:14:33,603 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 21:14:33,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 21:14:33,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 21:14:33,603 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 21:14:33,604 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 -> DAGSIZE 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-20 21:14:33,939 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 21:14:33,963 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 21:14:33,967 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 21:14:33,968 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 21:14:33,969 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 21:14:33,970 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-20 21:14:34,035 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40abcb952/f70359c569c440cf8a82046904af9005/FLAG007e1fc88 [2020-07-20 21:14:34,517 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 21:14:34,518 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-07-20 21:14:34,525 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40abcb952/f70359c569c440cf8a82046904af9005/FLAG007e1fc88 [2020-07-20 21:14:34,859 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40abcb952/f70359c569c440cf8a82046904af9005 [2020-07-20 21:14:34,868 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 21:14:34,871 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 21:14:34,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 21:14:34,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 21:14:34,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 21:14:34,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:14:34" (1/1) ... [2020-07-20 21:14:34,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f29f361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:14:34, skipping insertion in model container [2020-07-20 21:14:34,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 09:14:34" (1/1) ... [2020-07-20 21:14:34,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 21:14:34,909 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 21:14:35,075 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 21:14:35,080 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 21:14:35,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 21:14:35,112 INFO L208 MainTranslator]: Completed translation [2020-07-20 21:14:35,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:14:35 WrapperNode [2020-07-20 21:14:35,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 21:14:35,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 21:14:35,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 21:14:35,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 21:14:35,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:14:35" (1/1) ... [2020-07-20 21:14:35,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:14:35" (1/1) ... [2020-07-20 21:14:35,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:14:35" (1/1) ... [2020-07-20 21:14:35,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:14:35" (1/1) ... [2020-07-20 21:14:35,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:14:35" (1/1) ... [2020-07-20 21:14:35,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:14:35" (1/1) ... [2020-07-20 21:14:35,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:14:35" (1/1) ... [2020-07-20 21:14:35,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 21:14:35,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 21:14:35,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 21:14:35,143 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 21:14:35,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:14:35" (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-20 21:14:35,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 21:14:35,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 21:14:35,309 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-07-20 21:14:35,309 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 21:14:35,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 21:14:35,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 21:14:35,309 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-07-20 21:14:35,309 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 21:14:35,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 21:14:35,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 21:14:35,491 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 21:14:35,492 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-20 21:14:35,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:14:35 BoogieIcfgContainer [2020-07-20 21:14:35,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 21:14:35,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 21:14:35,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 21:14:35,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 21:14:35,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 09:14:34" (1/3) ... [2020-07-20 21:14:35,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9ee429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:14:35, skipping insertion in model container [2020-07-20 21:14:35,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 09:14:35" (2/3) ... [2020-07-20 21:14:35,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9ee429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 09:14:35, skipping insertion in model container [2020-07-20 21:14:35,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 09:14:35" (3/3) ... [2020-07-20 21:14:35,506 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-07-20 21:14:35,521 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 21:14:35,534 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 21:14:35,552 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 21:14:35,583 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 21:14:35,583 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 21:14:35,583 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 21:14:35,584 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 21:14:35,584 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 21:14:35,584 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 21:14:35,584 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 21:14:35,584 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 21:14:35,610 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-20 21:14:35,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-20 21:14:35,617 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 21:14:35,618 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 21:14:35,619 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 21:14:35,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 21:14:35,626 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-07-20 21:14:35,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 21:14:35,637 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1287019900] [2020-07-20 21:14:35,637 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-20 21:14:35,733 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 21:14:35,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 21:14:35,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 21:14:35,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 21:14:35,831 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-20 21:14:35,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 21:14:35,832 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1287019900] [2020-07-20 21:14:35,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 21:14:35,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 21:14:35,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241664658] [2020-07-20 21:14:35,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 21:14:35,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 21:14:35,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 21:14:35,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 21:14:35,857 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-07-20 21:14:35,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 21:14:35,969 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-20 21:14:35,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 21:14:35,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-20 21:14:35,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 21:14:35,981 INFO L225 Difference]: With dead ends: 35 [2020-07-20 21:14:35,981 INFO L226 Difference]: Without dead ends: 21 [2020-07-20 21:14:35,985 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-20 21:14:36,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-20 21:14:36,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-20 21:14:36,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-20 21:14:36,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-20 21:14:36,034 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-20 21:14:36,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 21:14:36,035 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-20 21:14:36,035 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 21:14:36,035 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-20 21:14:36,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-20 21:14:36,037 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 21:14:36,038 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 21:14:36,251 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 21:14:36,252 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 21:14:36,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 21:14:36,252 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-07-20 21:14:36,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 21:14:36,254 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [400153086] [2020-07-20 21:14:36,254 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-20 21:14:36,294 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 21:14:36,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 21:14:36,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 21:14:36,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 21:14:36,342 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-20 21:14:36,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 21:14:36,343 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [400153086] [2020-07-20 21:14:36,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 21:14:36,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 21:14:36,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374479728] [2020-07-20 21:14:36,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 21:14:36,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 21:14:36,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 21:14:36,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 21:14:36,355 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-20 21:14:36,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 21:14:36,439 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-20 21:14:36,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 21:14:36,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-20 21:14:36,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 21:14:36,442 INFO L225 Difference]: With dead ends: 27 [2020-07-20 21:14:36,442 INFO L226 Difference]: Without dead ends: 23 [2020-07-20 21:14:36,444 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-20 21:14:36,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-20 21:14:36,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-20 21:14:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-20 21:14:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-20 21:14:36,452 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-20 21:14:36,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 21:14:36,453 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-20 21:14:36,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 21:14:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-20 21:14:36,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-20 21:14:36,455 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 21:14:36,455 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-20 21:14:36,668 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 21:14:36,669 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 21:14:36,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 21:14:36,671 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-07-20 21:14:36,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 21:14:36,672 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [269294572] [2020-07-20 21:14:36,673 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-20 21:14:36,715 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 21:14:36,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 21:14:36,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 21:14:36,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 21:14:36,783 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-20 21:14:36,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 21:14:37,019 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:37,073 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-20 21:14:37,074 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [269294572] [2020-07-20 21:14:37,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 21:14:37,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-20 21:14:37,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026884319] [2020-07-20 21:14:37,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 21:14:37,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 21:14:37,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 21:14:37,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 21:14:37,077 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-07-20 21:14:37,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 21:14:37,189 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2020-07-20 21:14:37,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 21:14:37,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-20 21:14:37,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 21:14:37,192 INFO L225 Difference]: With dead ends: 32 [2020-07-20 21:14:37,192 INFO L226 Difference]: Without dead ends: 28 [2020-07-20 21:14:37,193 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-20 21:14:37,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-20 21:14:37,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-20 21:14:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-20 21:14:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-20 21:14:37,203 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 26 [2020-07-20 21:14:37,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 21:14:37,203 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-20 21:14:37,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 21:14:37,204 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-20 21:14:37,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-20 21:14:37,205 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 21:14:37,205 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-20 21:14:37,418 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 21:14:37,419 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 21:14:37,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 21:14:37,420 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-07-20 21:14:37,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 21:14:37,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1286983726] [2020-07-20 21:14:37,422 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-20 21:14:37,452 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 21:14:37,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 21:14:37,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 21:14:37,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 21:14:37,509 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-20 21:14:37,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 21:14:37,651 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:37,681 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-20 21:14:37,682 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1286983726] [2020-07-20 21:14:37,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 21:14:37,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-20 21:14:37,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030515342] [2020-07-20 21:14:37,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 21:14:37,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 21:14:37,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 21:14:37,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 21:14:37,684 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 9 states. [2020-07-20 21:14:37,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 21:14:37,764 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2020-07-20 21:14:37,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 21:14:37,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-20 21:14:37,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 21:14:37,767 INFO L225 Difference]: With dead ends: 37 [2020-07-20 21:14:37,768 INFO L226 Difference]: Without dead ends: 33 [2020-07-20 21:14:37,769 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-20 21:14:37,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-20 21:14:37,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2020-07-20 21:14:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-20 21:14:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-20 21:14:37,778 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 27 [2020-07-20 21:14:37,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 21:14:37,778 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-20 21:14:37,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 21:14:37,778 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-20 21:14:37,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-20 21:14:37,780 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 21:14:37,780 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-20 21:14:37,989 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 21:14:37,990 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 21:14:37,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 21:14:37,991 INFO L82 PathProgramCache]: Analyzing trace with hash -2027372739, now seen corresponding path program 2 times [2020-07-20 21:14:37,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 21:14:37,992 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [112106103] [2020-07-20 21:14:37,993 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-20 21:14:38,028 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 21:14:38,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 21:14:38,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 21:14:38,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 21:14:38,075 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-20 21:14:38,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 21:14:38,313 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:38,315 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:38,368 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:38,369 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:38,405 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-20 21:14:38,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [112106103] [2020-07-20 21:14:38,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 21:14:38,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-20 21:14:38,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715596482] [2020-07-20 21:14:38,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 21:14:38,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 21:14:38,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 21:14:38,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-20 21:14:38,408 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 11 states. [2020-07-20 21:14:38,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 21:14:38,558 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2020-07-20 21:14:38,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 21:14:38,559 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-07-20 21:14:38,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 21:14:38,561 INFO L225 Difference]: With dead ends: 42 [2020-07-20 21:14:38,561 INFO L226 Difference]: Without dead ends: 38 [2020-07-20 21:14:38,562 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-20 21:14:38,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-20 21:14:38,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2020-07-20 21:14:38,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-20 21:14:38,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-20 21:14:38,573 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 39 [2020-07-20 21:14:38,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 21:14:38,573 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-20 21:14:38,573 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 21:14:38,574 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-20 21:14:38,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-20 21:14:38,575 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 21:14:38,576 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-20 21:14:38,790 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 21:14:38,791 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 21:14:38,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 21:14:38,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 2 times [2020-07-20 21:14:38,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 21:14:38,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [386644567] [2020-07-20 21:14:38,793 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-20 21:14:38,835 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 21:14:38,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 21:14:38,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 21:14:38,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 21:14:38,880 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-20 21:14:38,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 21:14:39,100 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:39,147 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:39,148 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:39,178 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-20 21:14:39,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [386644567] [2020-07-20 21:14:39,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 21:14:39,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-20 21:14:39,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042377898] [2020-07-20 21:14:39,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 21:14:39,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 21:14:39,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 21:14:39,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-20 21:14:39,181 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 11 states. [2020-07-20 21:14:39,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 21:14:39,303 INFO L93 Difference]: Finished difference Result 47 states and 84 transitions. [2020-07-20 21:14:39,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 21:14:39,304 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2020-07-20 21:14:39,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 21:14:39,306 INFO L225 Difference]: With dead ends: 47 [2020-07-20 21:14:39,306 INFO L226 Difference]: Without dead ends: 43 [2020-07-20 21:14:39,307 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-20 21:14:39,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-20 21:14:39,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2020-07-20 21:14:39,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-20 21:14:39,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-20 21:14:39,318 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 41 [2020-07-20 21:14:39,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 21:14:39,319 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-20 21:14:39,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 21:14:39,319 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-20 21:14:39,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-20 21:14:39,321 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 21:14:39,321 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-20 21:14:39,530 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 21:14:39,531 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 21:14:39,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 21:14:39,532 INFO L82 PathProgramCache]: Analyzing trace with hash -767819153, now seen corresponding path program 3 times [2020-07-20 21:14:39,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 21:14:39,533 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [918891327] [2020-07-20 21:14:39,534 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-20 21:14:39,575 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 21:14:39,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 21:14:39,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 21:14:39,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 21:14:39,646 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-20 21:14:39,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 21:14:40,076 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:40,186 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:40,187 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:40,230 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:40,232 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:40,283 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-20 21:14:40,283 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [918891327] [2020-07-20 21:14:40,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 21:14:40,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2020-07-20 21:14:40,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150677772] [2020-07-20 21:14:40,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-20 21:14:40,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 21:14:40,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-20 21:14:40,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-20 21:14:40,288 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 13 states. [2020-07-20 21:14:40,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 21:14:40,482 INFO L93 Difference]: Finished difference Result 52 states and 102 transitions. [2020-07-20 21:14:40,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 21:14:40,483 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2020-07-20 21:14:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 21:14:40,485 INFO L225 Difference]: With dead ends: 52 [2020-07-20 21:14:40,489 INFO L226 Difference]: Without dead ends: 48 [2020-07-20 21:14:40,490 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-20 21:14:40,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-20 21:14:40,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2020-07-20 21:14:40,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-20 21:14:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-20 21:14:40,512 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 65 [2020-07-20 21:14:40,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 21:14:40,513 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-20 21:14:40,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-20 21:14:40,513 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-20 21:14:40,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-07-20 21:14:40,519 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 21:14:40,520 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-20 21:14:40,721 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 21:14:40,722 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 21:14:40,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 21:14:40,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1474757101, now seen corresponding path program 3 times [2020-07-20 21:14:40,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 21:14:40,724 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1179164627] [2020-07-20 21:14:40,724 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-20 21:14:40,784 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 21:14:40,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 21:14:40,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 21:14:40,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 21:14:40,871 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-20 21:14:40,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 21:14:41,302 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:41,419 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:41,420 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:41,469 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:41,505 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-20 21:14:41,505 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1179164627] [2020-07-20 21:14:41,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 21:14:41,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2020-07-20 21:14:41,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689087449] [2020-07-20 21:14:41,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-20 21:14:41,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 21:14:41,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-20 21:14:41,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-20 21:14:41,507 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 13 states. [2020-07-20 21:14:41,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 21:14:41,674 INFO L93 Difference]: Finished difference Result 57 states and 122 transitions. [2020-07-20 21:14:41,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 21:14:41,677 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2020-07-20 21:14:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 21:14:41,681 INFO L225 Difference]: With dead ends: 57 [2020-07-20 21:14:41,681 INFO L226 Difference]: Without dead ends: 53 [2020-07-20 21:14:41,682 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-20 21:14:41,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-20 21:14:41,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2020-07-20 21:14:41,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-20 21:14:41,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-20 21:14:41,699 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 96 [2020-07-20 21:14:41,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 21:14:41,700 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-20 21:14:41,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-20 21:14:41,701 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-20 21:14:41,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-07-20 21:14:41,705 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 21:14:41,705 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-20 21:14:41,906 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 21:14:41,907 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 21:14:41,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 21:14:41,908 INFO L82 PathProgramCache]: Analyzing trace with hash 838335741, now seen corresponding path program 4 times [2020-07-20 21:14:41,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 21:14:41,909 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [409608438] [2020-07-20 21:14:41,910 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-20 21:14:41,978 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 21:14:41,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 21:14:41,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-20 21:14:41,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 21:14:42,072 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-20 21:14:42,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 21:14:42,680 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:42,681 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:42,854 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:42,938 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:42,985 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:43,030 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-20 21:14:43,031 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [409608438] [2020-07-20 21:14:43,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 21:14:43,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2020-07-20 21:14:43,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237976521] [2020-07-20 21:14:43,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-20 21:14:43,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 21:14:43,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-20 21:14:43,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-07-20 21:14:43,033 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 15 states. [2020-07-20 21:14:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 21:14:43,306 INFO L93 Difference]: Finished difference Result 62 states and 144 transitions. [2020-07-20 21:14:43,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 21:14:43,307 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 117 [2020-07-20 21:14:43,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 21:14:43,309 INFO L225 Difference]: With dead ends: 62 [2020-07-20 21:14:43,309 INFO L226 Difference]: Without dead ends: 58 [2020-07-20 21:14:43,310 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-20 21:14:43,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-20 21:14:43,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2020-07-20 21:14:43,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-20 21:14:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2020-07-20 21:14:43,322 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 73 transitions. Word has length 117 [2020-07-20 21:14:43,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 21:14:43,323 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 73 transitions. [2020-07-20 21:14:43,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-20 21:14:43,323 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 73 transitions. [2020-07-20 21:14:43,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-07-20 21:14:43,326 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 21:14:43,326 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-20 21:14:43,535 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 21:14:43,536 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 21:14:43,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 21:14:43,537 INFO L82 PathProgramCache]: Analyzing trace with hash -2072922826, now seen corresponding path program 4 times [2020-07-20 21:14:43,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 21:14:43,538 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [98570638] [2020-07-20 21:14:43,538 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-20 21:14:43,624 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 21:14:43,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 21:14:43,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-20 21:14:43,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 21:14:43,730 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-20 21:14:43,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 21:14:44,458 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:44,668 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:44,747 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:44,748 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:44,787 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:44,787 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:44,856 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-20 21:14:44,857 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [98570638] [2020-07-20 21:14:44,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 21:14:44,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2020-07-20 21:14:44,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075349968] [2020-07-20 21:14:44,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-20 21:14:44,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 21:14:44,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-20 21:14:44,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-07-20 21:14:44,859 INFO L87 Difference]: Start difference. First operand 41 states and 73 transitions. Second operand 15 states. [2020-07-20 21:14:45,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 21:14:45,025 INFO L93 Difference]: Finished difference Result 67 states and 168 transitions. [2020-07-20 21:14:45,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 21:14:45,025 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 190 [2020-07-20 21:14:45,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 21:14:45,028 INFO L225 Difference]: With dead ends: 67 [2020-07-20 21:14:45,028 INFO L226 Difference]: Without dead ends: 63 [2020-07-20 21:14:45,029 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-20 21:14:45,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-20 21:14:45,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2020-07-20 21:14:45,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-20 21:14:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2020-07-20 21:14:45,041 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 73 transitions. Word has length 190 [2020-07-20 21:14:45,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 21:14:45,042 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 73 transitions. [2020-07-20 21:14:45,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-20 21:14:45,042 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 73 transitions. [2020-07-20 21:14:45,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-07-20 21:14:45,055 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 21:14:45,055 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-20 21:14:45,269 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 21:14:45,269 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 21:14:45,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 21:14:45,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1082984306, now seen corresponding path program 5 times [2020-07-20 21:14:45,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 21:14:45,270 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2034235560] [2020-07-20 21:14:45,271 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-20 21:14:45,387 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 21:14:45,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 21:14:45,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-20 21:14:45,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 21:14:45,517 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-20 21:14:45,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 21:14:46,722 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:47,053 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:47,207 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:47,291 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:47,339 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:47,339 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:47,441 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-20 21:14:47,441 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2034235560] [2020-07-20 21:14:47,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 21:14:47,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 17 [2020-07-20 21:14:47,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889754896] [2020-07-20 21:14:47,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-20 21:14:47,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 21:14:47,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-20 21:14:47,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-20 21:14:47,447 INFO L87 Difference]: Start difference. First operand 41 states and 73 transitions. Second operand 17 states. [2020-07-20 21:14:47,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 21:14:47,702 INFO L93 Difference]: Finished difference Result 72 states and 194 transitions. [2020-07-20 21:14:47,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 21:14:47,703 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 286 [2020-07-20 21:14:47,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 21:14:47,706 INFO L225 Difference]: With dead ends: 72 [2020-07-20 21:14:47,707 INFO L226 Difference]: Without dead ends: 68 [2020-07-20 21:14:47,708 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-20 21:14:47,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-20 21:14:47,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2020-07-20 21:14:47,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-20 21:14:47,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2020-07-20 21:14:47,734 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 286 [2020-07-20 21:14:47,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 21:14:47,735 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2020-07-20 21:14:47,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-20 21:14:47,736 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2020-07-20 21:14:47,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2020-07-20 21:14:47,740 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 21:14:47,740 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-20 21:14:47,955 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 21:14:47,956 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 21:14:47,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 21:14:47,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1006419304, now seen corresponding path program 5 times [2020-07-20 21:14:47,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 21:14:47,957 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1488897898] [2020-07-20 21:14:47,957 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-20 21:14:48,092 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 21:14:48,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 21:14:48,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-20 21:14:48,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 21:14:48,231 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-20 21:14:48,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 21:14:49,439 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:49,755 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:49,924 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:50,028 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:50,029 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:50,075 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:50,144 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-20 21:14:50,144 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1488897898] [2020-07-20 21:14:50,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 21:14:50,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 17 [2020-07-20 21:14:50,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328359444] [2020-07-20 21:14:50,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-20 21:14:50,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 21:14:50,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-20 21:14:50,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-20 21:14:50,146 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand 17 states. [2020-07-20 21:14:50,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 21:14:50,358 INFO L93 Difference]: Finished difference Result 77 states and 222 transitions. [2020-07-20 21:14:50,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 21:14:50,364 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 299 [2020-07-20 21:14:50,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 21:14:50,367 INFO L225 Difference]: With dead ends: 77 [2020-07-20 21:14:50,367 INFO L226 Difference]: Without dead ends: 73 [2020-07-20 21:14:50,368 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-20 21:14:50,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-20 21:14:50,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2020-07-20 21:14:50,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-20 21:14:50,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2020-07-20 21:14:50,380 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 299 [2020-07-20 21:14:50,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 21:14:50,381 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2020-07-20 21:14:50,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-20 21:14:50,382 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2020-07-20 21:14:50,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2020-07-20 21:14:50,385 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 21:14:50,385 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-20 21:14:50,598 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 21:14:50,599 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 21:14:50,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 21:14:50,600 INFO L82 PathProgramCache]: Analyzing trace with hash 785285043, now seen corresponding path program 6 times [2020-07-20 21:14:50,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 21:14:50,601 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1898634234] [2020-07-20 21:14:50,601 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-20 21:14:50,806 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 21:14:50,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 21:14:50,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-20 21:14:50,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 21:14:51,101 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-20 21:14:51,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 21:14:53,045 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:53,570 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:53,934 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:54,139 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:54,140 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:54,225 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:54,275 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:54,275 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:54,490 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-20 21:14:54,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1898634234] [2020-07-20 21:14:54,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 21:14:54,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 19 [2020-07-20 21:14:54,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559782448] [2020-07-20 21:14:54,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-20 21:14:54,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 21:14:54,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-20 21:14:54,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2020-07-20 21:14:54,493 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand 19 states. [2020-07-20 21:14:54,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 21:14:54,940 INFO L93 Difference]: Finished difference Result 82 states and 252 transitions. [2020-07-20 21:14:54,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 21:14:54,941 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 507 [2020-07-20 21:14:54,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 21:14:54,946 INFO L225 Difference]: With dead ends: 82 [2020-07-20 21:14:54,946 INFO L226 Difference]: Without dead ends: 78 [2020-07-20 21:14:54,947 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-20 21:14:54,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-20 21:14:54,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 51. [2020-07-20 21:14:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-20 21:14:54,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 109 transitions. [2020-07-20 21:14:54,960 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 109 transitions. Word has length 507 [2020-07-20 21:14:54,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 21:14:54,961 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 109 transitions. [2020-07-20 21:14:54,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-20 21:14:54,961 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 109 transitions. [2020-07-20 21:14:54,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2020-07-20 21:14:54,964 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 21:14:54,965 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-20 21:14:55,180 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 21:14:55,180 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 21:14:55,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 21:14:55,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1350718391, now seen corresponding path program 6 times [2020-07-20 21:14:55,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 21:14:55,182 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [360041634] [2020-07-20 21:14:55,182 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-20 21:14:55,391 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 21:14:55,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 21:14:55,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-20 21:14:55,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 21:14:55,569 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-20 21:14:55,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 21:14:57,333 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:57,948 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:57,949 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:58,284 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:58,285 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:58,460 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:58,553 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:58,554 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:58,606 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:14:58,714 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-20 21:14:58,714 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [360041634] [2020-07-20 21:14:58,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 21:14:58,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 19 [2020-07-20 21:14:58,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653532355] [2020-07-20 21:14:58,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-20 21:14:58,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 21:14:58,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-20 21:14:58,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2020-07-20 21:14:58,717 INFO L87 Difference]: Start difference. First operand 51 states and 109 transitions. Second operand 19 states. [2020-07-20 21:14:58,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 21:14:58,989 INFO L93 Difference]: Finished difference Result 87 states and 284 transitions. [2020-07-20 21:14:58,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 21:14:58,990 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 450 [2020-07-20 21:14:58,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 21:14:58,993 INFO L225 Difference]: With dead ends: 87 [2020-07-20 21:14:58,993 INFO L226 Difference]: Without dead ends: 83 [2020-07-20 21:14:58,995 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-20 21:14:58,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-20 21:14:59,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 51. [2020-07-20 21:14:59,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-20 21:14:59,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 109 transitions. [2020-07-20 21:14:59,024 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 109 transitions. Word has length 450 [2020-07-20 21:14:59,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 21:14:59,025 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 109 transitions. [2020-07-20 21:14:59,025 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-20 21:14:59,025 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 109 transitions. [2020-07-20 21:14:59,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2020-07-20 21:14:59,035 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 21:14:59,036 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-20 21:14:59,250 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 21:14:59,251 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 21:14:59,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 21:14:59,252 INFO L82 PathProgramCache]: Analyzing trace with hash 40336450, now seen corresponding path program 7 times [2020-07-20 21:14:59,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 21:14:59,252 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2121456963] [2020-07-20 21:14:59,252 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-20 21:14:59,740 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 21:14:59,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 21:14:59,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 2014 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-20 21:14:59,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 21:15:00,296 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-20 21:15:00,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 21:15:04,182 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:04,184 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:05,414 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:05,936 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:05,937 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:06,288 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:06,289 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:06,452 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:06,455 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:06,544 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:06,545 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:06,617 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:07,157 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-20 21:15:07,157 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2121456963] [2020-07-20 21:15:07,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 21:15:07,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 21 [2020-07-20 21:15:07,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489549235] [2020-07-20 21:15:07,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-20 21:15:07,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 21:15:07,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-20 21:15:07,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2020-07-20 21:15:07,161 INFO L87 Difference]: Start difference. First operand 51 states and 109 transitions. Second operand 21 states. [2020-07-20 21:15:07,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 21:15:07,735 INFO L93 Difference]: Finished difference Result 92 states and 318 transitions. [2020-07-20 21:15:07,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 21:15:07,736 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1066 [2020-07-20 21:15:07,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 21:15:07,741 INFO L225 Difference]: With dead ends: 92 [2020-07-20 21:15:07,742 INFO L226 Difference]: Without dead ends: 88 [2020-07-20 21:15:07,746 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2140 GetRequests, 2097 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2020-07-20 21:15:07,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-20 21:15:07,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 56. [2020-07-20 21:15:07,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-20 21:15:07,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 130 transitions. [2020-07-20 21:15:07,767 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 130 transitions. Word has length 1066 [2020-07-20 21:15:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 21:15:07,770 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 130 transitions. [2020-07-20 21:15:07,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-20 21:15:07,770 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 130 transitions. [2020-07-20 21:15:07,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2020-07-20 21:15:07,776 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 21:15:07,777 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-20 21:15:07,991 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 21:15:07,992 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 21:15:07,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 21:15:07,992 INFO L82 PathProgramCache]: Analyzing trace with hash 822363973, now seen corresponding path program 7 times [2020-07-20 21:15:07,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 21:15:07,993 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1149314723] [2020-07-20 21:15:07,993 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-20 21:15:08,338 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 21:15:08,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 21:15:08,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 1307 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-20 21:15:08,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 21:15:08,705 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-20 21:15:08,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 21:15:11,400 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:11,400 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:12,391 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:12,864 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:12,865 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:13,143 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:13,144 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:13,329 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:13,434 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:13,485 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:13,888 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-20 21:15:13,894 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1149314723] [2020-07-20 21:15:13,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 21:15:13,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 21 [2020-07-20 21:15:13,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748435719] [2020-07-20 21:15:13,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-20 21:15:13,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 21:15:13,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-20 21:15:13,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2020-07-20 21:15:13,900 INFO L87 Difference]: Start difference. First operand 56 states and 130 transitions. Second operand 21 states. [2020-07-20 21:15:14,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 21:15:14,550 INFO L93 Difference]: Finished difference Result 97 states and 354 transitions. [2020-07-20 21:15:14,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 21:15:14,551 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 697 [2020-07-20 21:15:14,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 21:15:14,555 INFO L225 Difference]: With dead ends: 97 [2020-07-20 21:15:14,555 INFO L226 Difference]: Without dead ends: 93 [2020-07-20 21:15:14,556 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1401 GetRequests, 1358 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2020-07-20 21:15:14,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-07-20 21:15:14,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 56. [2020-07-20 21:15:14,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-20 21:15:14,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 130 transitions. [2020-07-20 21:15:14,572 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 130 transitions. Word has length 697 [2020-07-20 21:15:14,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 21:15:14,574 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 130 transitions. [2020-07-20 21:15:14,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-20 21:15:14,574 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 130 transitions. [2020-07-20 21:15:14,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1951 [2020-07-20 21:15:14,605 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 21:15:14,606 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-20 21:15:14,819 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 21:15:14,820 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 21:15:14,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 21:15:14,821 INFO L82 PathProgramCache]: Analyzing trace with hash 395569872, now seen corresponding path program 8 times [2020-07-20 21:15:14,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 21:15:14,822 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1092724986] [2020-07-20 21:15:14,822 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-20 21:15:15,500 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 21:15:15,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 21:15:15,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 3680 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-20 21:15:15,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 21:15:16,975 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-20 21:15:16,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 21:15:22,673 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:25,785 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:27,433 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:27,997 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:27,997 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:28,388 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:28,389 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:28,611 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:28,707 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:28,708 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:28,759 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:28,760 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:30,092 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-20 21:15:30,093 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1092724986] [2020-07-20 21:15:30,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 21:15:30,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 23 [2020-07-20 21:15:30,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044105581] [2020-07-20 21:15:30,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-20 21:15:30,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 21:15:30,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-20 21:15:30,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2020-07-20 21:15:30,104 INFO L87 Difference]: Start difference. First operand 56 states and 130 transitions. Second operand 23 states. [2020-07-20 21:15:30,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 21:15:30,507 INFO L93 Difference]: Finished difference Result 102 states and 392 transitions. [2020-07-20 21:15:30,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 21:15:30,507 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1950 [2020-07-20 21:15:30,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 21:15:30,515 INFO L225 Difference]: With dead ends: 102 [2020-07-20 21:15:30,515 INFO L226 Difference]: Without dead ends: 98 [2020-07-20 21:15:30,518 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-20 21:15:30,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-20 21:15:30,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 61. [2020-07-20 21:15:30,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-20 21:15:30,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 153 transitions. [2020-07-20 21:15:30,533 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 153 transitions. Word has length 1950 [2020-07-20 21:15:30,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 21:15:30,536 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 153 transitions. [2020-07-20 21:15:30,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-20 21:15:30,536 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 153 transitions. [2020-07-20 21:15:30,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1354 [2020-07-20 21:15:30,556 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 21:15:30,557 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-20 21:15:30,772 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 21:15:30,773 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 21:15:30,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 21:15:30,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1956381947, now seen corresponding path program 8 times [2020-07-20 21:15:30,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 21:15:30,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [690587232] [2020-07-20 21:15:30,774 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-20 21:15:31,334 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 21:15:31,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 21:15:31,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 2531 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-20 21:15:31,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 21:15:32,041 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-20 21:15:32,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 21:15:36,591 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:38,741 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:38,742 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:40,013 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:40,014 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:40,489 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:40,801 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:40,802 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:40,974 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:41,069 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:41,131 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:41,782 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-20 21:15:41,783 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [690587232] [2020-07-20 21:15:41,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 21:15:41,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 22 [2020-07-20 21:15:41,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121757009] [2020-07-20 21:15:41,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-20 21:15:41,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 21:15:41,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-20 21:15:41,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2020-07-20 21:15:41,786 INFO L87 Difference]: Start difference. First operand 61 states and 153 transitions. Second operand 22 states. [2020-07-20 21:15:42,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 21:15:42,388 INFO L93 Difference]: Finished difference Result 107 states and 432 transitions. [2020-07-20 21:15:42,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 21:15:42,389 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1353 [2020-07-20 21:15:42,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 21:15:42,396 INFO L225 Difference]: With dead ends: 107 [2020-07-20 21:15:42,396 INFO L226 Difference]: Without dead ends: 103 [2020-07-20 21:15:42,397 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-20 21:15:42,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-20 21:15:42,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 61. [2020-07-20 21:15:42,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-20 21:15:42,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 153 transitions. [2020-07-20 21:15:42,418 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 153 transitions. Word has length 1353 [2020-07-20 21:15:42,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 21:15:42,419 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 153 transitions. [2020-07-20 21:15:42,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-20 21:15:42,420 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 153 transitions. [2020-07-20 21:15:42,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2523 [2020-07-20 21:15:42,472 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 21:15:42,473 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-20 21:15:42,673 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 21:15:42,674 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 21:15:42,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 21:15:42,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1336408704, now seen corresponding path program 9 times [2020-07-20 21:15:42,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 21:15:42,676 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1807229939] [2020-07-20 21:15:42,676 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-20 21:15:43,622 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 21:15:43,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 21:15:43,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 4758 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-20 21:15:43,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 21:15:46,164 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-20 21:15:46,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 21:15:55,821 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:15:58,608 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:16:00,918 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:16:01,911 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:16:01,912 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:16:02,647 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:16:02,648 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:16:03,014 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:16:03,015 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:16:03,213 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:16:03,315 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:16:03,373 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:16:05,542 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-20 21:16:05,543 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1807229939] [2020-07-20 21:16:05,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 21:16:05,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 24 [2020-07-20 21:16:05,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700734979] [2020-07-20 21:16:05,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-20 21:16:05,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 21:16:05,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-20 21:16:05,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-07-20 21:16:05,546 INFO L87 Difference]: Start difference. First operand 61 states and 153 transitions. Second operand 24 states. [2020-07-20 21:16:06,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 21:16:06,540 INFO L93 Difference]: Finished difference Result 112 states and 474 transitions. [2020-07-20 21:16:06,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 21:16:06,541 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 2522 [2020-07-20 21:16:06,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 21:16:06,549 INFO L225 Difference]: With dead ends: 112 [2020-07-20 21:16:06,549 INFO L226 Difference]: Without dead ends: 108 [2020-07-20 21:16:06,551 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-20 21:16:06,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-07-20 21:16:06,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 66. [2020-07-20 21:16:06,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-20 21:16:06,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 178 transitions. [2020-07-20 21:16:06,568 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 178 transitions. Word has length 2522 [2020-07-20 21:16:06,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 21:16:06,570 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 178 transitions. [2020-07-20 21:16:06,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-20 21:16:06,570 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 178 transitions. [2020-07-20 21:16:06,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3664 [2020-07-20 21:16:06,656 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 21:16:06,657 INFO L422 BasicCegarLoop]: trace histogram [539, 539, 422, 269, 269, 269, 269, 269, 269, 269, 153, 117, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 21:16:06,858 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 21:16:06,858 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 21:16:06,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 21:16:06,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2013600424, now seen corresponding path program 9 times [2020-07-20 21:16:06,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 21:16:06,861 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [297436319] [2020-07-20 21:16:06,862 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-20 21:16:08,105 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 21:16:08,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 21:16:08,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 6848 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-20 21:16:08,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 21:16:13,150 INFO L134 CoverageAnalysis]: Checked inductivity of 812979 backedges. 3656 proven. 26937 refuted. 0 times theorem prover too weak. 782386 trivial. 0 not checked. [2020-07-20 21:16:13,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 21:16:26,964 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:16:30,750 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:16:30,751 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:16:34,005 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:16:35,271 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:16:36,257 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:16:36,773 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:16:36,949 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:16:37,063 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:16:37,064 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:16:37,137 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:16:37,204 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 21:16:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 812979 backedges. 3668 proven. 27042 refuted. 0 times theorem prover too weak. 782269 trivial. 0 not checked. [2020-07-20 21:16:41,402 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [297436319] [2020-07-20 21:16:41,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 21:16:41,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 24 [2020-07-20 21:16:41,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806379520] [2020-07-20 21:16:41,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-20 21:16:41,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 21:16:41,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-20 21:16:41,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-07-20 21:16:41,407 INFO L87 Difference]: Start difference. First operand 66 states and 178 transitions. Second operand 24 states. [2020-07-20 21:16:42,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 21:16:42,072 INFO L93 Difference]: Finished difference Result 298 states and 3289 transitions. [2020-07-20 21:16:42,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 21:16:42,073 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 3663 [2020-07-20 21:16:42,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 21:16:42,081 INFO L225 Difference]: With dead ends: 298 [2020-07-20 21:16:42,082 INFO L226 Difference]: Without dead ends: 74 [2020-07-20 21:16:42,107 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7335 GetRequests, 7282 SyntacticMatches, 21 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=385, Invalid=737, Unknown=0, NotChecked=0, Total=1122 [2020-07-20 21:16:42,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-20 21:16:42,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-07-20 21:16:42,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-20 21:16:42,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2020-07-20 21:16:42,126 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 3663 [2020-07-20 21:16:42,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 21:16:42,127 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2020-07-20 21:16:42,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-20 21:16:42,127 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2020-07-20 21:16:42,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-07-20 21:16:42,142 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 21:16:42,142 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-20 21:16:42,355 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 21:16:42,356 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 21:16:42,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 21:16:42,356 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 10 times [2020-07-20 21:16:42,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 21:16:42,357 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1181796241] [2020-07-20 21:16:42,357 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-20 21:16:43,028 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 21:16:43,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-20 21:16:43,028 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 21:16:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 21:16:43,265 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 21:16:43,478 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-20 21:16:43,478 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 21:16:43,692 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 21:16:43,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 09:16:43 BoogieIcfgContainer [2020-07-20 21:16:43,972 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 21:16:43,975 INFO L168 Benchmark]: Toolchain (without parser) took 129104.43 ms. Allocated memory was 145.2 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 101.9 MB in the beginning and 888.1 MB in the end (delta: -786.2 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2020-07-20 21:16:43,976 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 145.2 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-20 21:16:43,978 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.44 ms. Allocated memory is still 145.2 MB. Free memory was 101.5 MB in the beginning and 92.2 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-07-20 21:16:43,978 INFO L168 Benchmark]: Boogie Preprocessor took 28.92 ms. Allocated memory is still 145.2 MB. Free memory was 92.2 MB in the beginning and 90.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-20 21:16:43,979 INFO L168 Benchmark]: RCFGBuilder took 353.65 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 90.9 MB in the beginning and 171.3 MB in the end (delta: -80.4 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-20 21:16:43,979 INFO L168 Benchmark]: TraceAbstraction took 128474.65 ms. Allocated memory was 202.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 170.7 MB in the beginning and 888.1 MB in the end (delta: -717.4 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2020-07-20 21:16:43,981 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.50 ms. Allocated memory is still 145.2 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 241.44 ms. Allocated memory is still 145.2 MB. Free memory was 101.5 MB in the beginning and 92.2 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.92 ms. Allocated memory is still 145.2 MB. Free memory was 92.2 MB in the beginning and 90.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 353.65 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 90.9 MB in the beginning and 171.3 MB in the end (delta: -80.4 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 128474.65 ms. Allocated memory was 202.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 170.7 MB in the beginning and 888.1 MB in the end (delta: -717.4 MB). Peak memory consumption was 1.8 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: 128.1s, OverallIterations: 21, TraceHistogramMax: 539, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 328 SDtfs, 1553 SDslu, 1706 SDs, 0 SdLazy, 2063 SolverSat, 3623 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26919 GetRequests, 26317 SyntacticMatches, 219 SemanticMatches, 383 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2121 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=20, 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, 20 MinimizatonAttempts, 396 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 109.4s InterpolantComputationTime, 14633 NumberOfCodeBlocks, 11285 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 26777 ConstructedInterpolants, 0 QuantifiedInterpolants, 60422999 SizeOfPredicates, 130 NumberOfNonLiveVariables, 25233 ConjunctsInSsa, 260 ConjunctsInUnsatCore, 38 InterpolantComputations, 2 PerfectInterpolantSequences, 3207348/3369648 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...