/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 2 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 19:20:26,468 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 19:20:26,472 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 19:20:26,498 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 19:20:26,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 19:20:26,502 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 19:20:26,504 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 19:20:26,517 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 19:20:26,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 19:20:26,527 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 19:20:26,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 19:20:26,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 19:20:26,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 19:20:26,533 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 19:20:26,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 19:20:26,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 19:20:26,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 19:20:26,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 19:20:26,543 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 19:20:26,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 19:20:26,556 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 19:20:26,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 19:20:26,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 19:20:26,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 19:20:26,565 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 19:20:26,566 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 19:20:26,566 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 19:20:26,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 19:20:26,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 19:20:26,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 19:20:26,573 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 19:20:26,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 19:20:26,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 19:20:26,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 19:20:26,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 19:20:26,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 19:20:26,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 19:20:26,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 19:20:26,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 19:20:26,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 19:20:26,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 19:20:26,584 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-21 19:20:26,626 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 19:20:26,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 19:20:26,631 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 19:20:26,631 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 19:20:26,631 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 19:20:26,632 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 19:20:26,632 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 19:20:26,632 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 19:20:26,632 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 19:20:26,632 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 19:20:26,633 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 19:20:26,633 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 19:20:26,633 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 19:20:26,635 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 19:20:26,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 19:20:26,636 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 19:20:26,636 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 19:20:26,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 19:20:26,636 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 19:20:26,636 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 19:20:26,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 19:20:26,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 19:20:26,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 19:20:26,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 19:20:26,638 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 19:20:26,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 19:20:26,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:26,640 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 19:20:26,640 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 19:20:26,640 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 -> 2 [2020-07-21 19:20:26,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 19:20:26,977 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 19:20:26,983 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 19:20:26,985 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 19:20:26,986 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 19:20:26,987 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-07-21 19:20:27,089 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e13a9b5a/0fb545e4f5a043a8984c24a086cbd17f/FLAGef2300a5b [2020-07-21 19:20:27,689 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 19:20:27,690 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-07-21 19:20:27,697 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e13a9b5a/0fb545e4f5a043a8984c24a086cbd17f/FLAGef2300a5b [2020-07-21 19:20:28,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e13a9b5a/0fb545e4f5a043a8984c24a086cbd17f [2020-07-21 19:20:28,038 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 19:20:28,043 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 19:20:28,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 19:20:28,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 19:20:28,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 19:20:28,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 07:20:28" (1/1) ... [2020-07-21 19:20:28,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6014c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:20:28, skipping insertion in model container [2020-07-21 19:20:28,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 07:20:28" (1/1) ... [2020-07-21 19:20:28,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 19:20:28,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 19:20:28,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 19:20:28,342 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 19:20:28,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 19:20:28,376 INFO L208 MainTranslator]: Completed translation [2020-07-21 19:20:28,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:20:28 WrapperNode [2020-07-21 19:20:28,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 19:20:28,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 19:20:28,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 19:20:28,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 19:20:28,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:20:28" (1/1) ... [2020-07-21 19:20:28,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:20:28" (1/1) ... [2020-07-21 19:20:28,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:20:28" (1/1) ... [2020-07-21 19:20:28,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:20:28" (1/1) ... [2020-07-21 19:20:28,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:20:28" (1/1) ... [2020-07-21 19:20:28,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:20:28" (1/1) ... [2020-07-21 19:20:28,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:20:28" (1/1) ... [2020-07-21 19:20:28,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 19:20:28,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 19:20:28,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 19:20:28,407 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 19:20:28,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:20:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 19:20:28,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 19:20:28,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 19:20:28,589 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-07-21 19:20:28,589 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 19:20:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 19:20:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 19:20:28,590 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-07-21 19:20:28,590 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 19:20:28,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 19:20:28,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 19:20:28,819 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 19:20:28,819 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-21 19:20:28,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 07:20:28 BoogieIcfgContainer [2020-07-21 19:20:28,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 19:20:28,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 19:20:28,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 19:20:28,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 19:20:28,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 07:20:28" (1/3) ... [2020-07-21 19:20:28,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28cd30fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 07:20:28, skipping insertion in model container [2020-07-21 19:20:28,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:20:28" (2/3) ... [2020-07-21 19:20:28,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28cd30fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 07:20:28, skipping insertion in model container [2020-07-21 19:20:28,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 07:20:28" (3/3) ... [2020-07-21 19:20:28,836 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-07-21 19:20:28,850 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 19:20:28,860 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 19:20:28,877 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 19:20:28,909 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 19:20:28,909 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 19:20:28,909 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 19:20:28,909 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 19:20:28,909 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 19:20:28,910 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 19:20:28,910 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 19:20:28,910 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 19:20:28,936 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-21 19:20:28,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-21 19:20:28,944 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:20:28,945 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:20:28,946 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:20:28,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:20:28,955 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-07-21 19:20:28,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:20:28,967 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [223793543] [2020-07-21 19:20:28,968 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:29,058 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 19:20:29,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:20:29,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 19:20:29,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:20:29,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 19:20:29,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 19:20:29,189 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [223793543] [2020-07-21 19:20:29,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 19:20:29,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 19:20:29,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482951303] [2020-07-21 19:20:29,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 19:20:29,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:20:29,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 19:20:29,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 19:20:29,232 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-07-21 19:20:29,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:20:29,397 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-21 19:20:29,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 19:20:29,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-21 19:20:29,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:20:29,411 INFO L225 Difference]: With dead ends: 35 [2020-07-21 19:20:29,411 INFO L226 Difference]: Without dead ends: 21 [2020-07-21 19:20:29,415 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 19:20:29,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-21 19:20:29,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-21 19:20:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-21 19:20:29,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-21 19:20:29,480 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-21 19:20:29,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:20:29,481 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-21 19:20:29,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 19:20:29,481 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-21 19:20:29,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-21 19:20:29,485 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:20:29,485 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:20:29,700 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:29,701 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:20:29,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:20:29,703 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-07-21 19:20:29,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:20:29,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [78103913] [2020-07-21 19:20:29,704 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:29,734 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 19:20:29,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:20:29,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 19:20:29,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:20:29,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 19:20:29,790 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 19:20:29,791 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [78103913] [2020-07-21 19:20:29,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 19:20:29,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 19:20:29,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810640923] [2020-07-21 19:20:29,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 19:20:29,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:20:29,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 19:20:29,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 19:20:29,796 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-21 19:20:29,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:20:29,880 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-21 19:20:29,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 19:20:29,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-21 19:20:29,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:20:29,883 INFO L225 Difference]: With dead ends: 27 [2020-07-21 19:20:29,883 INFO L226 Difference]: Without dead ends: 23 [2020-07-21 19:20:29,885 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 19:20:29,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-21 19:20:29,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-21 19:20:29,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-21 19:20:29,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-21 19:20:29,896 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-21 19:20:29,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:20:29,896 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-21 19:20:29,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 19:20:29,897 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-21 19:20:29,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-21 19:20:29,899 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:20:29,899 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:20:30,107 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:30,109 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:20:30,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:20:30,111 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-07-21 19:20:30,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:20:30,112 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [862656957] [2020-07-21 19:20:30,112 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:30,149 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 19:20:30,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:20:30,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 19:20:30,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:20:30,235 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-21 19:20:30,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:20:30,540 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-21 19:20:30,625 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [862656957] [2020-07-21 19:20:30,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:20:30,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-21 19:20:30,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484190948] [2020-07-21 19:20:30,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-21 19:20:30,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:20:30,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-21 19:20:30,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-21 19:20:30,632 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-07-21 19:20:30,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:20:30,795 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2020-07-21 19:20:30,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 19:20:30,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-21 19:20:30,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:20:30,798 INFO L225 Difference]: With dead ends: 32 [2020-07-21 19:20:30,799 INFO L226 Difference]: Without dead ends: 28 [2020-07-21 19:20:30,800 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-21 19:20:30,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-21 19:20:30,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-21 19:20:30,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-21 19:20:30,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-21 19:20:30,810 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 26 [2020-07-21 19:20:30,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:20:30,811 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-21 19:20:30,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-21 19:20:30,811 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-21 19:20:30,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-21 19:20:30,813 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:20:30,814 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:20:31,028 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:31,030 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:20:31,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:20:31,030 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-07-21 19:20:31,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:20:31,032 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1510048066] [2020-07-21 19:20:31,032 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:31,064 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 19:20:31,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:20:31,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 19:20:31,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:20:31,129 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-21 19:20:31,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:20:31,294 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:31,332 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-21 19:20:31,333 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1510048066] [2020-07-21 19:20:31,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:20:31,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-21 19:20:31,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065243692] [2020-07-21 19:20:31,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-21 19:20:31,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:20:31,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-21 19:20:31,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-21 19:20:31,336 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 9 states. [2020-07-21 19:20:31,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:20:31,449 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2020-07-21 19:20:31,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 19:20:31,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-21 19:20:31,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:20:31,452 INFO L225 Difference]: With dead ends: 37 [2020-07-21 19:20:31,453 INFO L226 Difference]: Without dead ends: 33 [2020-07-21 19:20:31,453 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-21 19:20:31,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-21 19:20:31,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2020-07-21 19:20:31,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-21 19:20:31,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-21 19:20:31,464 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 27 [2020-07-21 19:20:31,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:20:31,465 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-21 19:20:31,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-21 19:20:31,465 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-21 19:20:31,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-21 19:20:31,467 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:20:31,468 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:20:31,683 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:31,684 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:20:31,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:20:31,685 INFO L82 PathProgramCache]: Analyzing trace with hash -2027372739, now seen corresponding path program 2 times [2020-07-21 19:20:31,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:20:31,686 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1638956006] [2020-07-21 19:20:31,686 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:31,739 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:20:31,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:20:31,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 19:20:31,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:20:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-21 19:20:31,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:20:32,104 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:32,105 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:32,165 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:32,167 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:32,224 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-21 19:20:32,225 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1638956006] [2020-07-21 19:20:32,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:20:32,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-21 19:20:32,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504551204] [2020-07-21 19:20:32,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-21 19:20:32,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:20:32,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-21 19:20:32,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-21 19:20:32,229 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 11 states. [2020-07-21 19:20:32,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:20:32,454 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2020-07-21 19:20:32,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 19:20:32,456 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-07-21 19:20:32,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:20:32,458 INFO L225 Difference]: With dead ends: 42 [2020-07-21 19:20:32,458 INFO L226 Difference]: Without dead ends: 38 [2020-07-21 19:20:32,459 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-21 19:20:32,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-21 19:20:32,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2020-07-21 19:20:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-21 19:20:32,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-21 19:20:32,475 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 39 [2020-07-21 19:20:32,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:20:32,476 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-21 19:20:32,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-21 19:20:32,476 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-21 19:20:32,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-21 19:20:32,478 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:20:32,479 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:20:32,683 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:32,683 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:20:32,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:20:32,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 2 times [2020-07-21 19:20:32,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:20:32,686 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1498494233] [2020-07-21 19:20:32,687 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:32,746 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:20:32,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:20:32,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 19:20:32,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:20:32,824 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-21 19:20:32,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:20:33,064 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:33,124 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:33,126 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:33,175 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-21 19:20:33,176 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1498494233] [2020-07-21 19:20:33,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:20:33,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-21 19:20:33,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257720835] [2020-07-21 19:20:33,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-21 19:20:33,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:20:33,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-21 19:20:33,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-21 19:20:33,178 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 11 states. [2020-07-21 19:20:33,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:20:33,356 INFO L93 Difference]: Finished difference Result 47 states and 84 transitions. [2020-07-21 19:20:33,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 19:20:33,357 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2020-07-21 19:20:33,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:20:33,359 INFO L225 Difference]: With dead ends: 47 [2020-07-21 19:20:33,360 INFO L226 Difference]: Without dead ends: 43 [2020-07-21 19:20:33,361 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-21 19:20:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-21 19:20:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2020-07-21 19:20:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-21 19:20:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-21 19:20:33,375 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 41 [2020-07-21 19:20:33,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:20:33,376 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-21 19:20:33,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-21 19:20:33,377 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-21 19:20:33,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-21 19:20:33,379 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:20:33,379 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:20:33,593 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:33,593 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:20:33,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:20:33,594 INFO L82 PathProgramCache]: Analyzing trace with hash -767819153, now seen corresponding path program 3 times [2020-07-21 19:20:33,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:20:33,595 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1720473571] [2020-07-21 19:20:33,595 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:33,645 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:20:33,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:20:33,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 19:20:33,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:20:33,718 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 17 proven. 79 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-07-21 19:20:33,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:20:34,251 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:34,373 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:34,375 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:34,430 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:34,431 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:34,485 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 17 proven. 91 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2020-07-21 19:20:34,486 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1720473571] [2020-07-21 19:20:34,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:20:34,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2020-07-21 19:20:34,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341872616] [2020-07-21 19:20:34,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-21 19:20:34,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:20:34,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-21 19:20:34,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-21 19:20:34,492 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 13 states. [2020-07-21 19:20:34,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:20:34,711 INFO L93 Difference]: Finished difference Result 52 states and 102 transitions. [2020-07-21 19:20:34,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 19:20:34,712 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2020-07-21 19:20:34,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:20:34,716 INFO L225 Difference]: With dead ends: 52 [2020-07-21 19:20:34,716 INFO L226 Difference]: Without dead ends: 48 [2020-07-21 19:20:34,717 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 111 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-07-21 19:20:34,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-21 19:20:34,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2020-07-21 19:20:34,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-21 19:20:34,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-21 19:20:34,732 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 65 [2020-07-21 19:20:34,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:20:34,733 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-21 19:20:34,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-21 19:20:34,733 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-21 19:20:34,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-07-21 19:20:34,736 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:20:34,736 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:20:34,949 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:34,950 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:20:34,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:20:34,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1474757101, now seen corresponding path program 3 times [2020-07-21 19:20:34,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:20:34,952 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1669765509] [2020-07-21 19:20:34,952 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:35,032 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:20:35,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:20:35,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 19:20:35,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:20:35,135 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-07-21 19:20:35,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:20:35,668 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:35,776 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:35,777 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:35,830 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:35,877 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 181 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2020-07-21 19:20:35,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1669765509] [2020-07-21 19:20:35,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:20:35,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2020-07-21 19:20:35,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198473519] [2020-07-21 19:20:35,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-21 19:20:35,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:20:35,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-21 19:20:35,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-21 19:20:35,881 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 13 states. [2020-07-21 19:20:36,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:20:36,055 INFO L93 Difference]: Finished difference Result 57 states and 122 transitions. [2020-07-21 19:20:36,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 19:20:36,058 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2020-07-21 19:20:36,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:20:36,061 INFO L225 Difference]: With dead ends: 57 [2020-07-21 19:20:36,061 INFO L226 Difference]: Without dead ends: 53 [2020-07-21 19:20:36,062 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 172 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-07-21 19:20:36,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-21 19:20:36,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2020-07-21 19:20:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-21 19:20:36,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-21 19:20:36,077 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 96 [2020-07-21 19:20:36,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:20:36,079 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-21 19:20:36,079 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-21 19:20:36,079 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-21 19:20:36,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-07-21 19:20:36,081 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:20:36,082 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:20:36,297 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:36,298 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:20:36,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:20:36,299 INFO L82 PathProgramCache]: Analyzing trace with hash 838335741, now seen corresponding path program 4 times [2020-07-21 19:20:36,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:20:36,300 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1768038158] [2020-07-21 19:20:36,301 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:36,413 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:20:36,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:20:36,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-21 19:20:36,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:20:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 244 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2020-07-21 19:20:36,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:20:37,160 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:37,161 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:37,368 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:37,455 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:37,522 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:37,593 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 266 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2020-07-21 19:20:37,594 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1768038158] [2020-07-21 19:20:37,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:20:37,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2020-07-21 19:20:37,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525653167] [2020-07-21 19:20:37,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-21 19:20:37,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:20:37,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-21 19:20:37,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-07-21 19:20:37,597 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 15 states. [2020-07-21 19:20:37,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:20:37,933 INFO L93 Difference]: Finished difference Result 62 states and 144 transitions. [2020-07-21 19:20:37,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-21 19:20:37,934 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 117 [2020-07-21 19:20:37,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:20:37,936 INFO L225 Difference]: With dead ends: 62 [2020-07-21 19:20:37,937 INFO L226 Difference]: Without dead ends: 58 [2020-07-21 19:20:37,938 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 211 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-07-21 19:20:37,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-21 19:20:37,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2020-07-21 19:20:37,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-21 19:20:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2020-07-21 19:20:37,953 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 73 transitions. Word has length 117 [2020-07-21 19:20:37,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:20:37,954 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 73 transitions. [2020-07-21 19:20:37,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-21 19:20:37,954 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 73 transitions. [2020-07-21 19:20:37,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-07-21 19:20:37,958 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:20:37,959 INFO L422 BasicCegarLoop]: trace histogram [27, 27, 21, 13, 13, 13, 13, 13, 13, 13, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:20:38,173 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:38,173 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:20:38,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:20:38,174 INFO L82 PathProgramCache]: Analyzing trace with hash -2072922826, now seen corresponding path program 4 times [2020-07-21 19:20:38,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:20:38,174 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [240317189] [2020-07-21 19:20:38,175 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:38,276 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:20:38,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:20:38,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-21 19:20:38,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:20:38,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 86 proven. 506 refuted. 0 times theorem prover too weak. 1334 trivial. 0 not checked. [2020-07-21 19:20:38,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:20:39,205 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:39,418 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:39,509 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:39,510 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:39,557 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:39,560 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:39,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 86 proven. 532 refuted. 0 times theorem prover too weak. 1308 trivial. 0 not checked. [2020-07-21 19:20:39,632 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [240317189] [2020-07-21 19:20:39,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:20:39,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2020-07-21 19:20:39,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796120392] [2020-07-21 19:20:39,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-21 19:20:39,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:20:39,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-21 19:20:39,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-07-21 19:20:39,635 INFO L87 Difference]: Start difference. First operand 41 states and 73 transitions. Second operand 15 states. [2020-07-21 19:20:39,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:20:39,834 INFO L93 Difference]: Finished difference Result 67 states and 168 transitions. [2020-07-21 19:20:39,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-21 19:20:39,835 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 190 [2020-07-21 19:20:39,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:20:39,838 INFO L225 Difference]: With dead ends: 67 [2020-07-21 19:20:39,838 INFO L226 Difference]: Without dead ends: 63 [2020-07-21 19:20:39,839 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 356 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-07-21 19:20:39,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-21 19:20:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2020-07-21 19:20:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-21 19:20:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2020-07-21 19:20:39,853 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 73 transitions. Word has length 190 [2020-07-21 19:20:39,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:20:39,854 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 73 transitions. [2020-07-21 19:20:39,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-21 19:20:39,854 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 73 transitions. [2020-07-21 19:20:39,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-07-21 19:20:39,859 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:20:39,859 INFO L422 BasicCegarLoop]: trace histogram [43, 43, 22, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:20:40,073 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:40,075 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:20:40,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:20:40,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1082984306, now seen corresponding path program 5 times [2020-07-21 19:20:40,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:20:40,077 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1243937310] [2020-07-21 19:20:40,077 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:40,216 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:20:40,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:20:40,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-21 19:20:40,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:20:40,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4662 backedges. 159 proven. 967 refuted. 0 times theorem prover too weak. 3536 trivial. 0 not checked. [2020-07-21 19:20:40,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:20:41,637 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:41,977 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:42,166 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:42,262 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:42,314 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:42,315 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:42,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4662 backedges. 159 proven. 1002 refuted. 0 times theorem prover too weak. 3501 trivial. 0 not checked. [2020-07-21 19:20:42,415 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1243937310] [2020-07-21 19:20:42,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:20:42,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 17 [2020-07-21 19:20:42,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420122705] [2020-07-21 19:20:42,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-21 19:20:42,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:20:42,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-21 19:20:42,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-21 19:20:42,418 INFO L87 Difference]: Start difference. First operand 41 states and 73 transitions. Second operand 17 states. [2020-07-21 19:20:42,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:20:42,670 INFO L93 Difference]: Finished difference Result 72 states and 194 transitions. [2020-07-21 19:20:42,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-21 19:20:42,671 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 286 [2020-07-21 19:20:42,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:20:42,674 INFO L225 Difference]: With dead ends: 72 [2020-07-21 19:20:42,675 INFO L226 Difference]: Without dead ends: 68 [2020-07-21 19:20:42,676 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 545 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2020-07-21 19:20:42,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-21 19:20:42,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2020-07-21 19:20:42,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-21 19:20:42,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2020-07-21 19:20:42,707 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 286 [2020-07-21 19:20:42,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:20:42,712 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2020-07-21 19:20:42,712 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-21 19:20:42,712 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2020-07-21 19:20:42,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2020-07-21 19:20:42,724 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:20:42,724 INFO L422 BasicCegarLoop]: trace histogram [43, 43, 35, 21, 21, 21, 21, 21, 21, 21, 14, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:20:42,937 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:42,938 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:20:42,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:20:42,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1101007572, now seen corresponding path program 5 times [2020-07-21 19:20:42,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:20:42,940 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [219297155] [2020-07-21 19:20:42,941 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:43,088 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:20:43,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:20:43,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-21 19:20:43,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:20:43,246 INFO L134 CoverageAnalysis]: Checked inductivity of 5047 backedges. 159 proven. 1061 refuted. 0 times theorem prover too weak. 3827 trivial. 0 not checked. [2020-07-21 19:20:43,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:20:44,635 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:44,995 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:45,164 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:45,261 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:45,261 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:45,310 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5047 backedges. 159 proven. 1101 refuted. 0 times theorem prover too weak. 3787 trivial. 0 not checked. [2020-07-21 19:20:45,399 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [219297155] [2020-07-21 19:20:45,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:20:45,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 17 [2020-07-21 19:20:45,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740859285] [2020-07-21 19:20:45,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-21 19:20:45,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:20:45,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-21 19:20:45,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-21 19:20:45,402 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand 17 states. [2020-07-21 19:20:45,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:20:45,735 INFO L93 Difference]: Finished difference Result 77 states and 222 transitions. [2020-07-21 19:20:45,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-21 19:20:45,736 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 300 [2020-07-21 19:20:45,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:20:45,745 INFO L225 Difference]: With dead ends: 77 [2020-07-21 19:20:45,746 INFO L226 Difference]: Without dead ends: 73 [2020-07-21 19:20:45,748 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 572 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2020-07-21 19:20:45,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-21 19:20:45,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2020-07-21 19:20:45,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-21 19:20:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2020-07-21 19:20:45,784 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 300 [2020-07-21 19:20:45,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:20:45,786 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2020-07-21 19:20:45,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-21 19:20:45,786 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2020-07-21 19:20:45,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2020-07-21 19:20:45,791 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:20:45,792 INFO L422 BasicCegarLoop]: trace histogram [71, 71, 36, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:20:46,006 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:46,007 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:20:46,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:20:46,008 INFO L82 PathProgramCache]: Analyzing trace with hash -897924696, now seen corresponding path program 6 times [2020-07-21 19:20:46,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:20:46,008 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [160551581] [2020-07-21 19:20:46,009 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:46,236 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:20:46,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:20:46,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 1046 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-21 19:20:46,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:20:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 12915 backedges. 306 proven. 1995 refuted. 0 times theorem prover too weak. 10614 trivial. 0 not checked. [2020-07-21 19:20:46,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:20:48,657 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:49,207 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:49,485 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:49,683 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:49,684 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:49,773 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:49,827 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:49,829 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 12915 backedges. 306 proven. 2046 refuted. 0 times theorem prover too weak. 10563 trivial. 0 not checked. [2020-07-21 19:20:50,005 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [160551581] [2020-07-21 19:20:50,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:20:50,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 19 [2020-07-21 19:20:50,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938774357] [2020-07-21 19:20:50,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-21 19:20:50,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:20:50,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-21 19:20:50,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2020-07-21 19:20:50,007 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand 19 states. [2020-07-21 19:20:50,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:20:50,415 INFO L93 Difference]: Finished difference Result 82 states and 252 transitions. [2020-07-21 19:20:50,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 19:20:50,416 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 468 [2020-07-21 19:20:50,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:20:50,421 INFO L225 Difference]: With dead ends: 82 [2020-07-21 19:20:50,421 INFO L226 Difference]: Without dead ends: 78 [2020-07-21 19:20:50,422 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 943 GetRequests, 905 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2020-07-21 19:20:50,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-21 19:20:50,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 51. [2020-07-21 19:20:50,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-21 19:20:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 109 transitions. [2020-07-21 19:20:50,438 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 109 transitions. Word has length 468 [2020-07-21 19:20:50,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:20:50,439 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 109 transitions. [2020-07-21 19:20:50,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-21 19:20:50,440 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 109 transitions. [2020-07-21 19:20:50,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2020-07-21 19:20:50,444 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:20:50,444 INFO L422 BasicCegarLoop]: trace histogram [65, 65, 53, 32, 32, 32, 32, 32, 32, 32, 21, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:20:50,657 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:50,658 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:20:50,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:20:50,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1350718391, now seen corresponding path program 6 times [2020-07-21 19:20:50,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:20:50,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [633089166] [2020-07-21 19:20:50,660 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:50,898 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:20:50,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:20:50,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-21 19:20:50,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:20:51,150 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 333 proven. 1918 refuted. 0 times theorem prover too weak. 9431 trivial. 0 not checked. [2020-07-21 19:20:51,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:20:53,099 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:53,854 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:53,856 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:54,204 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:54,205 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:54,373 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:54,471 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:54,472 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:54,524 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:54,699 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 333 proven. 1975 refuted. 0 times theorem prover too weak. 9374 trivial. 0 not checked. [2020-07-21 19:20:54,699 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [633089166] [2020-07-21 19:20:54,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:20:54,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 19 [2020-07-21 19:20:54,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897888774] [2020-07-21 19:20:54,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-21 19:20:54,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:20:54,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-21 19:20:54,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2020-07-21 19:20:54,703 INFO L87 Difference]: Start difference. First operand 51 states and 109 transitions. Second operand 19 states. [2020-07-21 19:20:55,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:20:55,352 INFO L93 Difference]: Finished difference Result 87 states and 284 transitions. [2020-07-21 19:20:55,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-21 19:20:55,353 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 450 [2020-07-21 19:20:55,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:20:55,361 INFO L225 Difference]: With dead ends: 87 [2020-07-21 19:20:55,361 INFO L226 Difference]: Without dead ends: 83 [2020-07-21 19:20:55,363 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 906 GetRequests, 868 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2020-07-21 19:20:55,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-21 19:20:55,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 51. [2020-07-21 19:20:55,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-21 19:20:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 109 transitions. [2020-07-21 19:20:55,401 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 109 transitions. Word has length 450 [2020-07-21 19:20:55,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:20:55,403 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 109 transitions. [2020-07-21 19:20:55,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-21 19:20:55,404 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 109 transitions. [2020-07-21 19:20:55,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2020-07-21 19:20:55,418 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:20:55,419 INFO L422 BasicCegarLoop]: trace histogram [133, 133, 67, 66, 66, 66, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:20:55,633 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:55,634 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:20:55,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:20:55,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1701713687, now seen corresponding path program 7 times [2020-07-21 19:20:55,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:20:55,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [513625492] [2020-07-21 19:20:55,636 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:20:56,053 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:20:56,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:20:56,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 1945 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-21 19:20:56,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:20:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 45837 backedges. 778 proven. 4406 refuted. 0 times theorem prover too weak. 40653 trivial. 0 not checked. [2020-07-21 19:20:56,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:20:59,724 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:20:59,725 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:01,239 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:01,910 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:01,911 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:02,332 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:02,333 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:02,502 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:02,503 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:02,600 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:02,601 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:02,665 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 45837 backedges. 778 proven. 4476 refuted. 0 times theorem prover too weak. 40583 trivial. 0 not checked. [2020-07-21 19:21:03,098 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [513625492] [2020-07-21 19:21:03,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:21:03,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 21 [2020-07-21 19:21:03,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593341362] [2020-07-21 19:21:03,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-21 19:21:03,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:21:03,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-21 19:21:03,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2020-07-21 19:21:03,102 INFO L87 Difference]: Start difference. First operand 51 states and 109 transitions. Second operand 21 states. [2020-07-21 19:21:03,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:21:03,593 INFO L93 Difference]: Finished difference Result 92 states and 318 transitions. [2020-07-21 19:21:03,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-21 19:21:03,594 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 871 [2020-07-21 19:21:03,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:21:03,601 INFO L225 Difference]: With dead ends: 92 [2020-07-21 19:21:03,601 INFO L226 Difference]: Without dead ends: 88 [2020-07-21 19:21:03,606 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1750 GetRequests, 1707 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-21 19:21:03,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-21 19:21:03,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 56. [2020-07-21 19:21:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-21 19:21:03,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 130 transitions. [2020-07-21 19:21:03,628 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 130 transitions. Word has length 871 [2020-07-21 19:21:03,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:21:03,631 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 130 transitions. [2020-07-21 19:21:03,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-21 19:21:03,632 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 130 transitions. [2020-07-21 19:21:03,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1078 [2020-07-21 19:21:03,648 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:21:03,649 INFO L422 BasicCegarLoop]: trace histogram [157, 157, 128, 78, 78, 78, 78, 78, 78, 78, 50, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:21:03,864 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:21:03,865 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:21:03,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:21:03,865 INFO L82 PathProgramCache]: Analyzing trace with hash 860290653, now seen corresponding path program 7 times [2020-07-21 19:21:03,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:21:03,866 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1053344541] [2020-07-21 19:21:03,866 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:21:04,318 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:21:04,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:21:04,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 2393 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-21 19:21:04,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:21:05,151 INFO L134 CoverageAnalysis]: Checked inductivity of 69124 backedges. 831 proven. 5812 refuted. 0 times theorem prover too weak. 62481 trivial. 0 not checked. [2020-07-21 19:21:05,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:21:09,005 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:09,006 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:10,438 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:11,164 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:11,165 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:11,620 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:11,621 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:11,867 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:12,008 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:12,085 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 69124 backedges. 831 proven. 5889 refuted. 0 times theorem prover too weak. 62404 trivial. 0 not checked. [2020-07-21 19:21:12,967 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1053344541] [2020-07-21 19:21:12,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:21:12,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 21 [2020-07-21 19:21:12,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920407167] [2020-07-21 19:21:12,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-21 19:21:12,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:21:12,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-21 19:21:12,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2020-07-21 19:21:12,975 INFO L87 Difference]: Start difference. First operand 56 states and 130 transitions. Second operand 21 states. [2020-07-21 19:21:13,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:21:13,730 INFO L93 Difference]: Finished difference Result 97 states and 354 transitions. [2020-07-21 19:21:13,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-21 19:21:13,731 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1077 [2020-07-21 19:21:13,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:21:13,739 INFO L225 Difference]: With dead ends: 97 [2020-07-21 19:21:13,739 INFO L226 Difference]: Without dead ends: 93 [2020-07-21 19:21:13,747 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2161 GetRequests, 2118 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2020-07-21 19:21:13,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-07-21 19:21:13,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 56. [2020-07-21 19:21:13,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-21 19:21:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 130 transitions. [2020-07-21 19:21:13,769 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 130 transitions. Word has length 1077 [2020-07-21 19:21:13,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:21:13,771 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 130 transitions. [2020-07-21 19:21:13,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-21 19:21:13,771 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 130 transitions. [2020-07-21 19:21:13,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1574 [2020-07-21 19:21:13,802 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:21:13,803 INFO L422 BasicCegarLoop]: trace histogram [241, 241, 121, 120, 120, 120, 120, 120, 120, 120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:21:14,016 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:21:14,017 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:21:14,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:21:14,019 INFO L82 PathProgramCache]: Analyzing trace with hash 78333505, now seen corresponding path program 8 times [2020-07-21 19:21:14,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:21:14,020 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [315894439] [2020-07-21 19:21:14,021 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:21:14,816 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:21:14,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:21:14,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 3511 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-21 19:21:14,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:21:15,991 INFO L134 CoverageAnalysis]: Checked inductivity of 151380 backedges. 1563 proven. 9337 refuted. 0 times theorem prover too weak. 140480 trivial. 0 not checked. [2020-07-21 19:21:15,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:21:21,483 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:24,156 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:25,576 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:26,212 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:26,213 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:26,667 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:26,669 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:26,925 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:27,037 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:27,038 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:27,102 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:27,103 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:28,166 INFO L134 CoverageAnalysis]: Checked inductivity of 151380 backedges. 1563 proven. 9429 refuted. 0 times theorem prover too weak. 140388 trivial. 0 not checked. [2020-07-21 19:21:28,166 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [315894439] [2020-07-21 19:21:28,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:21:28,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 23 [2020-07-21 19:21:28,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920488445] [2020-07-21 19:21:28,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-21 19:21:28,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:21:28,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-21 19:21:28,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2020-07-21 19:21:28,172 INFO L87 Difference]: Start difference. First operand 56 states and 130 transitions. Second operand 23 states. [2020-07-21 19:21:29,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:21:29,222 INFO L93 Difference]: Finished difference Result 102 states and 392 transitions. [2020-07-21 19:21:29,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-21 19:21:29,223 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1573 [2020-07-21 19:21:29,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:21:29,230 INFO L225 Difference]: With dead ends: 102 [2020-07-21 19:21:29,231 INFO L226 Difference]: Without dead ends: 98 [2020-07-21 19:21:29,232 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3155 GetRequests, 3107 SyntacticMatches, 18 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2020-07-21 19:21:29,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-21 19:21:29,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 61. [2020-07-21 19:21:29,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-21 19:21:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 153 transitions. [2020-07-21 19:21:29,252 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 153 transitions. Word has length 1573 [2020-07-21 19:21:29,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:21:29,255 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 153 transitions. [2020-07-21 19:21:29,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-21 19:21:29,255 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 153 transitions. [2020-07-21 19:21:29,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1843 [2020-07-21 19:21:29,292 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:21:29,293 INFO L422 BasicCegarLoop]: trace histogram [269, 269, 221, 134, 134, 134, 134, 134, 134, 134, 87, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:21:29,506 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:21:29,507 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:21:29,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:21:29,508 INFO L82 PathProgramCache]: Analyzing trace with hash -323852785, now seen corresponding path program 8 times [2020-07-21 19:21:29,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:21:29,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1038841183] [2020-07-21 19:21:29,509 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:21:30,331 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:21:30,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:21:30,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 4091 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-21 19:21:30,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:21:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 204138 backedges. 1703 proven. 11413 refuted. 0 times theorem prover too weak. 191022 trivial. 0 not checked. [2020-07-21 19:21:31,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:21:38,017 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:41,250 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:41,252 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:42,949 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:42,950 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:43,743 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:44,172 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:44,173 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:44,375 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:44,489 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:44,551 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:21:46,004 INFO L134 CoverageAnalysis]: Checked inductivity of 204138 backedges. 1703 proven. 11513 refuted. 0 times theorem prover too weak. 190922 trivial. 0 not checked. [2020-07-21 19:21:46,005 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1038841183] [2020-07-21 19:21:46,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:21:46,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 22 [2020-07-21 19:21:46,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162081583] [2020-07-21 19:21:46,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-21 19:21:46,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:21:46,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-21 19:21:46,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2020-07-21 19:21:46,009 INFO L87 Difference]: Start difference. First operand 61 states and 153 transitions. Second operand 22 states. [2020-07-21 19:21:46,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:21:46,752 INFO L93 Difference]: Finished difference Result 107 states and 432 transitions. [2020-07-21 19:21:46,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-21 19:21:46,753 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1842 [2020-07-21 19:21:46,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:21:46,761 INFO L225 Difference]: With dead ends: 107 [2020-07-21 19:21:46,762 INFO L226 Difference]: Without dead ends: 103 [2020-07-21 19:21:46,763 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3692 GetRequests, 3644 SyntacticMatches, 19 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2020-07-21 19:21:46,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-21 19:21:46,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 61. [2020-07-21 19:21:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-21 19:21:46,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 153 transitions. [2020-07-21 19:21:46,780 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 153 transitions. Word has length 1842 [2020-07-21 19:21:46,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:21:46,781 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 153 transitions. [2020-07-21 19:21:46,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-21 19:21:46,782 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 153 transitions. [2020-07-21 19:21:46,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2107 [2020-07-21 19:21:46,835 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:21:46,836 INFO L422 BasicCegarLoop]: trace histogram [323, 323, 162, 161, 161, 161, 161, 161, 161, 161, 161, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:21:47,049 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:21:47,050 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:21:47,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:21:47,051 INFO L82 PathProgramCache]: Analyzing trace with hash 211951896, now seen corresponding path program 9 times [2020-07-21 19:21:47,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:21:47,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [105417438] [2020-07-21 19:21:47,051 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:21:47,986 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:21:47,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:21:48,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 4700 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-21 19:21:48,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:21:50,287 INFO L134 CoverageAnalysis]: Checked inductivity of 272412 backedges. 2152 proven. 14276 refuted. 0 times theorem prover too weak. 255984 trivial. 0 not checked. [2020-07-21 19:21:50,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:21:58,517 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:02,846 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:05,065 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:06,188 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:06,188 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:06,897 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:06,898 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:07,454 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:07,456 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:07,677 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:07,806 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:07,885 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:09,656 INFO L134 CoverageAnalysis]: Checked inductivity of 272412 backedges. 2152 proven. 14393 refuted. 0 times theorem prover too weak. 255867 trivial. 0 not checked. [2020-07-21 19:22:09,657 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [105417438] [2020-07-21 19:22:09,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:22:09,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 24 [2020-07-21 19:22:09,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702116727] [2020-07-21 19:22:09,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-21 19:22:09,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:22:09,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-21 19:22:09,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-07-21 19:22:09,663 INFO L87 Difference]: Start difference. First operand 61 states and 153 transitions. Second operand 24 states. [2020-07-21 19:22:10,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:22:10,560 INFO L93 Difference]: Finished difference Result 112 states and 474 transitions. [2020-07-21 19:22:10,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-21 19:22:10,562 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 2106 [2020-07-21 19:22:10,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:22:10,570 INFO L225 Difference]: With dead ends: 112 [2020-07-21 19:22:10,570 INFO L226 Difference]: Without dead ends: 108 [2020-07-21 19:22:10,572 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4222 GetRequests, 4169 SyntacticMatches, 21 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=385, Invalid=737, Unknown=0, NotChecked=0, Total=1122 [2020-07-21 19:22:10,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-07-21 19:22:10,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 66. [2020-07-21 19:22:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-21 19:22:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 178 transitions. [2020-07-21 19:22:10,594 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 178 transitions. Word has length 2106 [2020-07-21 19:22:10,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:22:10,596 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 178 transitions. [2020-07-21 19:22:10,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-21 19:22:10,596 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 178 transitions. [2020-07-21 19:22:10,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2370 [2020-07-21 19:22:10,646 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:22:10,647 INFO L422 BasicCegarLoop]: trace histogram [347, 347, 280, 173, 173, 173, 173, 173, 173, 173, 107, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:22:10,854 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:22:10,855 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:22:10,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:22:10,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1042406318, now seen corresponding path program 9 times [2020-07-21 19:22:10,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:22:10,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1635685982] [2020-07-21 19:22:10,858 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:22:11,914 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:22:11,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:22:11,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 5262 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-21 19:22:11,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:22:14,985 INFO L134 CoverageAnalysis]: Checked inductivity of 338696 backedges. 2716 proven. 16857 refuted. 0 times theorem prover too weak. 319123 trivial. 0 not checked. [2020-07-21 19:22:14,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:22:24,238 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:29,978 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:29,979 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:32,448 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:33,722 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:34,480 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:34,821 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:35,061 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:35,225 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:35,225 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:35,308 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:35,409 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 338696 backedges. 2726 proven. 16964 refuted. 0 times theorem prover too weak. 319006 trivial. 0 not checked. [2020-07-21 19:22:37,692 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1635685982] [2020-07-21 19:22:37,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:22:37,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 24 [2020-07-21 19:22:37,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371098640] [2020-07-21 19:22:37,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-21 19:22:37,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:22:37,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-21 19:22:37,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-07-21 19:22:37,696 INFO L87 Difference]: Start difference. First operand 66 states and 178 transitions. Second operand 24 states. [2020-07-21 19:22:38,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:22:38,588 INFO L93 Difference]: Finished difference Result 289 states and 3051 transitions. [2020-07-21 19:22:38,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-21 19:22:38,590 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 2369 [2020-07-21 19:22:38,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:22:38,600 INFO L225 Difference]: With dead ends: 289 [2020-07-21 19:22:38,601 INFO L226 Difference]: Without dead ends: 85 [2020-07-21 19:22:38,619 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4747 GetRequests, 4694 SyntacticMatches, 21 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=385, Invalid=737, Unknown=0, NotChecked=0, Total=1122 [2020-07-21 19:22:38,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-07-21 19:22:38,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-07-21 19:22:38,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-21 19:22:38,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 140 transitions. [2020-07-21 19:22:38,647 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 140 transitions. Word has length 2369 [2020-07-21 19:22:38,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:22:38,649 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 140 transitions. [2020-07-21 19:22:38,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-21 19:22:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 140 transitions. [2020-07-21 19:22:38,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1366 [2020-07-21 19:22:38,673 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:22:38,673 INFO L422 BasicCegarLoop]: trace histogram [197, 197, 176, 98, 98, 98, 98, 98, 98, 98, 78, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:22:38,887 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:22:38,887 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:22:38,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:22:38,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1651397559, now seen corresponding path program 10 times [2020-07-21 19:22:38,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:22:38,888 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [820833569] [2020-07-21 19:22:38,889 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:22:39,670 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:22:39,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:22:39,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 3029 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-21 19:22:39,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:22:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 111636 backedges. 1525 proven. 8088 refuted. 0 times theorem prover too weak. 102023 trivial. 0 not checked. [2020-07-21 19:22:40,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:22:47,167 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:49,701 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:51,230 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:52,077 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:52,652 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:52,654 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:52,949 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:52,950 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:53,081 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:53,082 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:53,149 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:53,151 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:53,202 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:53,294 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:22:54,029 INFO L134 CoverageAnalysis]: Checked inductivity of 111636 backedges. 1549 proven. 8166 refuted. 0 times theorem prover too weak. 101921 trivial. 0 not checked. [2020-07-21 19:22:54,030 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [820833569] [2020-07-21 19:22:54,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:22:54,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 22 [2020-07-21 19:22:54,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411664663] [2020-07-21 19:22:54,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-21 19:22:54,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:22:54,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-21 19:22:54,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2020-07-21 19:22:54,034 INFO L87 Difference]: Start difference. First operand 85 states and 140 transitions. Second operand 22 states. [2020-07-21 19:22:54,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:22:54,924 INFO L93 Difference]: Finished difference Result 294 states and 697 transitions. [2020-07-21 19:22:54,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-21 19:22:54,925 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1365 [2020-07-21 19:22:54,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:22:54,934 INFO L225 Difference]: With dead ends: 294 [2020-07-21 19:22:54,934 INFO L226 Difference]: Without dead ends: 93 [2020-07-21 19:22:54,954 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2738 GetRequests, 2690 SyntacticMatches, 19 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2020-07-21 19:22:54,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-07-21 19:22:54,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2020-07-21 19:22:54,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-07-21 19:22:54,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 117 transitions. [2020-07-21 19:22:54,978 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 117 transitions. Word has length 1365 [2020-07-21 19:22:54,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:22:54,979 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 117 transitions. [2020-07-21 19:22:54,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-21 19:22:54,980 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 117 transitions. [2020-07-21 19:22:55,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-07-21 19:22:55,000 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:22:55,001 INFO L422 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 19:22:55,216 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:22:55,217 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:22:55,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:22:55,218 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 11 times [2020-07-21 19:22:55,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:22:55,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2012850192] [2020-07-21 19:22:55,218 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:22:56,143 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:22:56,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-21 19:22:56,144 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 19:22:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 19:22:56,414 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 19:22:56,663 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-21 19:22:56,664 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-21 19:22:56,879 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:22:57,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 07:22:57 BoogieIcfgContainer [2020-07-21 19:22:57,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 19:22:57,169 INFO L168 Benchmark]: Toolchain (without parser) took 149128.50 ms. Allocated memory was 136.8 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 100.6 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 230.1 MB. Max. memory is 7.1 GB. [2020-07-21 19:22:57,170 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 136.8 MB. Free memory is still 118.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-21 19:22:57,170 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.55 ms. Allocated memory is still 136.8 MB. Free memory was 100.6 MB in the beginning and 91.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-21 19:22:57,172 INFO L168 Benchmark]: Boogie Preprocessor took 29.07 ms. Allocated memory is still 136.8 MB. Free memory was 91.1 MB in the beginning and 89.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-21 19:22:57,172 INFO L168 Benchmark]: RCFGBuilder took 417.52 ms. Allocated memory was 136.8 MB in the beginning and 202.4 MB in the end (delta: 65.5 MB). Free memory was 89.8 MB in the beginning and 170.1 MB in the end (delta: -80.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-21 19:22:57,173 INFO L168 Benchmark]: TraceAbstraction took 148340.02 ms. Allocated memory was 202.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 169.1 MB in the beginning and 2.5 GB in the end (delta: -2.3 GB). Peak memory consumption was 233.2 MB. Max. memory is 7.1 GB. [2020-07-21 19:22:57,175 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.48 ms. Allocated memory is still 136.8 MB. Free memory is still 118.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 326.55 ms. Allocated memory is still 136.8 MB. Free memory was 100.6 MB in the beginning and 91.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.07 ms. Allocated memory is still 136.8 MB. Free memory was 91.1 MB in the beginning and 89.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 417.52 ms. Allocated memory was 136.8 MB in the beginning and 202.4 MB in the end (delta: 65.5 MB). Free memory was 89.8 MB in the beginning and 170.1 MB in the end (delta: -80.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 148340.02 ms. Allocated memory was 202.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 169.1 MB in the beginning and 2.5 GB in the end (delta: -2.3 GB). Peak memory consumption was 233.2 MB. 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: 147.9s, OverallIterations: 22, TraceHistogramMax: 347, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 374 SDtfs, 1518 SDslu, 1869 SDs, 0 SdLazy, 2334 SolverSat, 3496 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26755 GetRequests, 26105 SyntacticMatches, 238 SemanticMatches, 412 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2320 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred 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.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 407 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 124.6s InterpolantComputationTime, 14547 NumberOfCodeBlocks, 14508 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 26603 ConstructedInterpolants, 0 QuantifiedInterpolants, 45565829 SizeOfPredicates, 140 NumberOfNonLiveVariables, 29637 ConjunctsInSsa, 280 ConjunctsInUnsatCore, 40 InterpolantComputations, 2 PerfectInterpolantSequences, 2306442/2461720 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...