/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 NUM_FUNCTIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-20 13:21:05,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 13:21:05,759 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 13:21:05,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 13:21:05,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 13:21:05,781 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 13:21:05,783 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 13:21:05,797 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 13:21:05,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 13:21:05,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 13:21:05,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 13:21:05,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 13:21:05,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 13:21:05,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 13:21:05,811 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 13:21:05,813 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 13:21:05,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 13:21:05,821 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 13:21:05,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 13:21:05,827 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 13:21:05,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 13:21:05,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 13:21:05,839 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 13:21:05,840 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 13:21:05,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 13:21:05,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 13:21:05,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 13:21:05,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 13:21:05,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 13:21:05,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 13:21:05,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 13:21:05,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 13:21:05,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 13:21:05,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 13:21:05,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 13:21:05,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 13:21:05,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 13:21:05,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 13:21:05,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 13:21:05,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 13:21:05,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 13:21:05,854 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 13:21:05,869 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 13:21:05,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 13:21:05,871 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 13:21:05,871 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 13:21:05,872 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 13:21:05,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 13:21:05,872 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 13:21:05,872 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 13:21:05,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 13:21:05,873 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 13:21:05,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 13:21:05,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 13:21:05,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 13:21:05,873 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 13:21:05,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 13:21:05,874 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 13:21:05,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 13:21:05,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 13:21:05,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 13:21:05,875 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 13:21:05,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 13:21:05,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 13:21:05,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 13:21:05,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 13:21:05,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 13:21:05,876 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 13:21:05,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:05,876 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 13:21:05,876 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 13:21:05,877 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 -> NUM_FUNCTIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 [2020-07-20 13:21:06,193 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 13:21:06,208 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 13:21:06,211 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 13:21:06,213 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 13:21:06,213 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 13:21:06,214 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-07-20 13:21:06,284 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bf984350/9a9136cd69624b62bf10258275ee4f36/FLAG82a73053e [2020-07-20 13:21:06,758 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 13:21:06,758 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-07-20 13:21:06,766 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bf984350/9a9136cd69624b62bf10258275ee4f36/FLAG82a73053e [2020-07-20 13:21:07,111 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bf984350/9a9136cd69624b62bf10258275ee4f36 [2020-07-20 13:21:07,120 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 13:21:07,123 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 13:21:07,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 13:21:07,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 13:21:07,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 13:21:07,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 01:21:07" (1/1) ... [2020-07-20 13:21:07,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f171bd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:07, skipping insertion in model container [2020-07-20 13:21:07,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 01:21:07" (1/1) ... [2020-07-20 13:21:07,141 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 13:21:07,159 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 13:21:07,369 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 13:21:07,377 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 13:21:07,400 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 13:21:07,416 INFO L208 MainTranslator]: Completed translation [2020-07-20 13:21:07,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:07 WrapperNode [2020-07-20 13:21:07,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 13:21:07,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 13:21:07,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 13:21:07,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 13:21:07,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:07" (1/1) ... [2020-07-20 13:21:07,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:07" (1/1) ... [2020-07-20 13:21:07,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:07" (1/1) ... [2020-07-20 13:21:07,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:07" (1/1) ... [2020-07-20 13:21:07,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:07" (1/1) ... [2020-07-20 13:21:07,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:07" (1/1) ... [2020-07-20 13:21:07,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:07" (1/1) ... [2020-07-20 13:21:07,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 13:21:07,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 13:21:07,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 13:21:07,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 13:21:07,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 13:21:07,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 13:21:07,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 13:21:07,609 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-07-20 13:21:07,609 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 13:21:07,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 13:21:07,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 13:21:07,610 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-07-20 13:21:07,610 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 13:21:07,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 13:21:07,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 13:21:07,796 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 13:21:07,796 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-20 13:21:07,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 01:21:07 BoogieIcfgContainer [2020-07-20 13:21:07,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 13:21:07,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 13:21:07,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 13:21:07,806 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 13:21:07,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 01:21:07" (1/3) ... [2020-07-20 13:21:07,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5c6806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 01:21:07, skipping insertion in model container [2020-07-20 13:21:07,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 01:21:07" (2/3) ... [2020-07-20 13:21:07,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5c6806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 01:21:07, skipping insertion in model container [2020-07-20 13:21:07,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 01:21:07" (3/3) ... [2020-07-20 13:21:07,810 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-07-20 13:21:07,823 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 13:21:07,833 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 13:21:07,856 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 13:21:07,891 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 13:21:07,891 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 13:21:07,891 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 13:21:07,892 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 13:21:07,892 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 13:21:07,892 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 13:21:07,892 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 13:21:07,892 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 13:21:07,918 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-20 13:21:07,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-20 13:21:07,926 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:21:07,927 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:21:07,927 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:21:07,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:21:07,936 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-07-20 13:21:07,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:21:07,946 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1095069733] [2020-07-20 13:21:07,947 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:08,030 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:21:08,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:21:08,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 13:21:08,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:21:08,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 13:21:08,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 13:21:08,141 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1095069733] [2020-07-20 13:21:08,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 13:21:08,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 13:21:08,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967668489] [2020-07-20 13:21:08,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 13:21:08,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:21:08,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 13:21:08,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 13:21:08,163 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-07-20 13:21:08,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:21:08,272 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-20 13:21:08,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 13:21:08,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-20 13:21:08,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:21:08,286 INFO L225 Difference]: With dead ends: 35 [2020-07-20 13:21:08,287 INFO L226 Difference]: Without dead ends: 21 [2020-07-20 13:21:08,291 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 13:21:08,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-20 13:21:08,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-20 13:21:08,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-20 13:21:08,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-20 13:21:08,344 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-20 13:21:08,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:21:08,345 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-20 13:21:08,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 13:21:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-20 13:21:08,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-20 13:21:08,347 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:21:08,348 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:21:08,562 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:08,563 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:21:08,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:21:08,564 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-07-20 13:21:08,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:21:08,566 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [353640223] [2020-07-20 13:21:08,566 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:08,593 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:21:08,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:21:08,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 13:21:08,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:21:08,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 13:21:08,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 13:21:08,632 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [353640223] [2020-07-20 13:21:08,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 13:21:08,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 13:21:08,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418500073] [2020-07-20 13:21:08,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 13:21:08,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:21:08,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 13:21:08,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 13:21:08,636 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-20 13:21:08,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:21:08,712 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-20 13:21:08,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 13:21:08,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-20 13:21:08,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:21:08,715 INFO L225 Difference]: With dead ends: 27 [2020-07-20 13:21:08,716 INFO L226 Difference]: Without dead ends: 23 [2020-07-20 13:21:08,717 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 13:21:08,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-20 13:21:08,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-20 13:21:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-20 13:21:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-20 13:21:08,726 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-20 13:21:08,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:21:08,726 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-20 13:21:08,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 13:21:08,727 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-20 13:21:08,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-20 13:21:08,728 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:21:08,729 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:21:08,941 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:08,942 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:21:08,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:21:08,944 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-07-20 13:21:08,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:21:08,945 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [172387917] [2020-07-20 13:21:08,945 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:08,982 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:21:08,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:21:08,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 13:21:08,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:21:09,045 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-20 13:21:09,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:21:09,222 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:09,275 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-20 13:21:09,276 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [172387917] [2020-07-20 13:21:09,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:21:09,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-20 13:21:09,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117838903] [2020-07-20 13:21:09,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 13:21:09,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:21:09,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 13:21:09,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 13:21:09,279 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-07-20 13:21:09,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:21:09,399 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2020-07-20 13:21:09,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 13:21:09,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-20 13:21:09,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:21:09,402 INFO L225 Difference]: With dead ends: 32 [2020-07-20 13:21:09,402 INFO L226 Difference]: Without dead ends: 28 [2020-07-20 13:21:09,403 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-20 13:21:09,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-20 13:21:09,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-20 13:21:09,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-20 13:21:09,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-20 13:21:09,413 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 26 [2020-07-20 13:21:09,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:21:09,414 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-20 13:21:09,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 13:21:09,414 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-20 13:21:09,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-20 13:21:09,416 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:21:09,416 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:21:09,631 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:09,632 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:21:09,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:21:09,633 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-07-20 13:21:09,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:21:09,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [735198329] [2020-07-20 13:21:09,634 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:09,665 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:21:09,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:21:09,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 13:21:09,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:21:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-20 13:21:09,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:21:09,854 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-20 13:21:09,892 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [735198329] [2020-07-20 13:21:09,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:21:09,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-20 13:21:09,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547017548] [2020-07-20 13:21:09,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 13:21:09,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:21:09,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 13:21:09,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-20 13:21:09,895 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 9 states. [2020-07-20 13:21:09,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:21:09,999 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2020-07-20 13:21:09,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 13:21:10,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-20 13:21:10,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:21:10,004 INFO L225 Difference]: With dead ends: 37 [2020-07-20 13:21:10,004 INFO L226 Difference]: Without dead ends: 33 [2020-07-20 13:21:10,005 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-20 13:21:10,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-20 13:21:10,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2020-07-20 13:21:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-20 13:21:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-20 13:21:10,014 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 27 [2020-07-20 13:21:10,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:21:10,015 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-20 13:21:10,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 13:21:10,015 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-20 13:21:10,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-20 13:21:10,017 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:21:10,017 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:21:10,233 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:10,233 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:21:10,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:21:10,234 INFO L82 PathProgramCache]: Analyzing trace with hash -2027372739, now seen corresponding path program 2 times [2020-07-20 13:21:10,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:21:10,235 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1369938676] [2020-07-20 13:21:10,235 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:10,273 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:21:10,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:21:10,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 13:21:10,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:21:10,341 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-20 13:21:10,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:21:10,615 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:10,621 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:10,686 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:10,688 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-20 13:21:10,739 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1369938676] [2020-07-20 13:21:10,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:21:10,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-20 13:21:10,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493271748] [2020-07-20 13:21:10,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 13:21:10,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:21:10,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 13:21:10,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-20 13:21:10,744 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 11 states. [2020-07-20 13:21:10,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:21:10,949 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2020-07-20 13:21:10,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 13:21:10,951 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-07-20 13:21:10,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:21:10,953 INFO L225 Difference]: With dead ends: 42 [2020-07-20 13:21:10,953 INFO L226 Difference]: Without dead ends: 38 [2020-07-20 13:21:10,956 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-20 13:21:10,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-20 13:21:10,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2020-07-20 13:21:10,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-20 13:21:10,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-20 13:21:10,972 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 39 [2020-07-20 13:21:10,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:21:10,972 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-20 13:21:10,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 13:21:10,973 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-20 13:21:10,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-20 13:21:10,975 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:21:10,975 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:21:11,188 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:11,189 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:21:11,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:21:11,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 2 times [2020-07-20 13:21:11,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:21:11,191 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [81862203] [2020-07-20 13:21:11,192 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:11,228 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:21:11,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:21:11,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 13:21:11,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:21:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-20 13:21:11,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:21:11,499 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:11,543 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:11,545 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-20 13:21:11,576 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [81862203] [2020-07-20 13:21:11,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:21:11,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-20 13:21:11,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616309980] [2020-07-20 13:21:11,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-20 13:21:11,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:21:11,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-20 13:21:11,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-20 13:21:11,578 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 11 states. [2020-07-20 13:21:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:21:11,725 INFO L93 Difference]: Finished difference Result 47 states and 84 transitions. [2020-07-20 13:21:11,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 13:21:11,726 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2020-07-20 13:21:11,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:21:11,730 INFO L225 Difference]: With dead ends: 47 [2020-07-20 13:21:11,730 INFO L226 Difference]: Without dead ends: 43 [2020-07-20 13:21:11,731 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-20 13:21:11,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-20 13:21:11,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2020-07-20 13:21:11,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-20 13:21:11,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-20 13:21:11,741 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 41 [2020-07-20 13:21:11,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:21:11,742 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-20 13:21:11,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-20 13:21:11,742 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-20 13:21:11,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-20 13:21:11,745 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:21:11,745 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:21:11,951 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:11,951 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:21:11,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:21:11,952 INFO L82 PathProgramCache]: Analyzing trace with hash -767819153, now seen corresponding path program 3 times [2020-07-20 13:21:11,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:21:11,953 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [446829177] [2020-07-20 13:21:11,954 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:11,997 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:21:11,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:21:11,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 13:21:12,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:21:12,066 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 17 proven. 79 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-07-20 13:21:12,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:21:12,476 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:12,581 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:12,582 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:12,633 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:12,635 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 17 proven. 91 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2020-07-20 13:21:12,680 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [446829177] [2020-07-20 13:21:12,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:21:12,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2020-07-20 13:21:12,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033785442] [2020-07-20 13:21:12,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-20 13:21:12,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:21:12,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-20 13:21:12,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-20 13:21:12,685 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 13 states. [2020-07-20 13:21:12,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:21:12,876 INFO L93 Difference]: Finished difference Result 52 states and 102 transitions. [2020-07-20 13:21:12,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 13:21:12,877 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2020-07-20 13:21:12,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:21:12,882 INFO L225 Difference]: With dead ends: 52 [2020-07-20 13:21:12,883 INFO L226 Difference]: Without dead ends: 48 [2020-07-20 13:21:12,884 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 111 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-07-20 13:21:12,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-20 13:21:12,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2020-07-20 13:21:12,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-20 13:21:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-20 13:21:12,905 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 65 [2020-07-20 13:21:12,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:21:12,906 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-20 13:21:12,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-20 13:21:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-20 13:21:12,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-07-20 13:21:12,910 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:21:12,911 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:21:13,124 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:13,125 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:21:13,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:21:13,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1474757101, now seen corresponding path program 3 times [2020-07-20 13:21:13,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:21:13,127 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1254051925] [2020-07-20 13:21:13,128 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:13,181 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:21:13,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:21:13,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-20 13:21:13,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:21:13,272 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-07-20 13:21:13,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:21:13,696 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:13,790 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:13,792 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:13,847 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:13,899 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 181 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2020-07-20 13:21:13,899 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1254051925] [2020-07-20 13:21:13,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:21:13,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2020-07-20 13:21:13,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160374466] [2020-07-20 13:21:13,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-20 13:21:13,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:21:13,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-20 13:21:13,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-20 13:21:13,905 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 13 states. [2020-07-20 13:21:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:21:14,062 INFO L93 Difference]: Finished difference Result 57 states and 122 transitions. [2020-07-20 13:21:14,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-20 13:21:14,065 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2020-07-20 13:21:14,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:21:14,071 INFO L225 Difference]: With dead ends: 57 [2020-07-20 13:21:14,071 INFO L226 Difference]: Without dead ends: 53 [2020-07-20 13:21:14,072 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 172 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-07-20 13:21:14,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-20 13:21:14,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2020-07-20 13:21:14,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-20 13:21:14,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-20 13:21:14,097 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 96 [2020-07-20 13:21:14,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:21:14,097 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-20 13:21:14,098 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-20 13:21:14,098 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-20 13:21:14,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-07-20 13:21:14,100 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:21:14,100 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:21:14,314 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:14,315 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:21:14,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:21:14,316 INFO L82 PathProgramCache]: Analyzing trace with hash 838335741, now seen corresponding path program 4 times [2020-07-20 13:21:14,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:21:14,318 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [78767599] [2020-07-20 13:21:14,318 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:14,382 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:21:14,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:21:14,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-20 13:21:14,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:21:14,499 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 244 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2020-07-20 13:21:14,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:21:15,106 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:15,107 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:15,290 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:15,382 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:15,435 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 54 proven. 266 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2020-07-20 13:21:15,513 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [78767599] [2020-07-20 13:21:15,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:21:15,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2020-07-20 13:21:15,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336274790] [2020-07-20 13:21:15,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-20 13:21:15,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:21:15,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-20 13:21:15,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-07-20 13:21:15,516 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 15 states. [2020-07-20 13:21:15,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:21:15,846 INFO L93 Difference]: Finished difference Result 62 states and 144 transitions. [2020-07-20 13:21:15,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 13:21:15,847 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 117 [2020-07-20 13:21:15,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:21:15,849 INFO L225 Difference]: With dead ends: 62 [2020-07-20 13:21:15,850 INFO L226 Difference]: Without dead ends: 58 [2020-07-20 13:21:15,851 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 211 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-07-20 13:21:15,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-20 13:21:15,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2020-07-20 13:21:15,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-20 13:21:15,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2020-07-20 13:21:15,863 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 73 transitions. Word has length 117 [2020-07-20 13:21:15,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:21:15,864 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 73 transitions. [2020-07-20 13:21:15,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-20 13:21:15,864 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 73 transitions. [2020-07-20 13:21:15,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-07-20 13:21:15,868 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:21:15,868 INFO L422 BasicCegarLoop]: trace histogram [27, 27, 21, 13, 13, 13, 13, 13, 13, 13, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:21:16,082 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:16,083 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:21:16,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:21:16,084 INFO L82 PathProgramCache]: Analyzing trace with hash -2072922826, now seen corresponding path program 4 times [2020-07-20 13:21:16,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:21:16,085 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1708775468] [2020-07-20 13:21:16,085 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:16,170 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:21:16,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:21:16,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-20 13:21:16,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:21:16,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 86 proven. 506 refuted. 0 times theorem prover too weak. 1334 trivial. 0 not checked. [2020-07-20 13:21:16,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:21:17,012 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:17,217 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:17,300 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:17,301 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:17,348 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:17,349 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:17,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 86 proven. 532 refuted. 0 times theorem prover too weak. 1308 trivial. 0 not checked. [2020-07-20 13:21:17,422 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1708775468] [2020-07-20 13:21:17,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:21:17,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2020-07-20 13:21:17,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897326448] [2020-07-20 13:21:17,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-20 13:21:17,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:21:17,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-20 13:21:17,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-07-20 13:21:17,427 INFO L87 Difference]: Start difference. First operand 41 states and 73 transitions. Second operand 15 states. [2020-07-20 13:21:17,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:21:17,620 INFO L93 Difference]: Finished difference Result 67 states and 168 transitions. [2020-07-20 13:21:17,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-20 13:21:17,620 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 190 [2020-07-20 13:21:17,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:21:17,622 INFO L225 Difference]: With dead ends: 67 [2020-07-20 13:21:17,623 INFO L226 Difference]: Without dead ends: 63 [2020-07-20 13:21:17,624 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 356 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-07-20 13:21:17,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-20 13:21:17,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2020-07-20 13:21:17,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-20 13:21:17,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2020-07-20 13:21:17,635 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 73 transitions. Word has length 190 [2020-07-20 13:21:17,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:21:17,636 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 73 transitions. [2020-07-20 13:21:17,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-20 13:21:17,636 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 73 transitions. [2020-07-20 13:21:17,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-07-20 13:21:17,640 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:21:17,640 INFO L422 BasicCegarLoop]: trace histogram [43, 43, 22, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:21:17,851 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:17,852 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:21:17,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:21:17,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1082984306, now seen corresponding path program 5 times [2020-07-20 13:21:17,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:21:17,854 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1070451403] [2020-07-20 13:21:17,854 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:17,975 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:21:17,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:21:17,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-20 13:21:17,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:21:18,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4662 backedges. 159 proven. 967 refuted. 0 times theorem prover too weak. 3536 trivial. 0 not checked. [2020-07-20 13:21:18,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:21:19,313 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:19,651 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:19,825 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:19,912 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:19,961 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:19,962 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:20,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4662 backedges. 159 proven. 1002 refuted. 0 times theorem prover too weak. 3501 trivial. 0 not checked. [2020-07-20 13:21:20,055 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1070451403] [2020-07-20 13:21:20,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:21:20,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 17 [2020-07-20 13:21:20,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351861242] [2020-07-20 13:21:20,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-20 13:21:20,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:21:20,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-20 13:21:20,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-20 13:21:20,060 INFO L87 Difference]: Start difference. First operand 41 states and 73 transitions. Second operand 17 states. [2020-07-20 13:21:20,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:21:20,283 INFO L93 Difference]: Finished difference Result 72 states and 194 transitions. [2020-07-20 13:21:20,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 13:21:20,284 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 286 [2020-07-20 13:21:20,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:21:20,287 INFO L225 Difference]: With dead ends: 72 [2020-07-20 13:21:20,288 INFO L226 Difference]: Without dead ends: 68 [2020-07-20 13:21:20,289 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 545 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2020-07-20 13:21:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-20 13:21:20,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2020-07-20 13:21:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-20 13:21:20,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2020-07-20 13:21:20,302 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 286 [2020-07-20 13:21:20,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:21:20,303 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2020-07-20 13:21:20,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-20 13:21:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2020-07-20 13:21:20,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2020-07-20 13:21:20,308 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:21:20,308 INFO L422 BasicCegarLoop]: trace histogram [43, 43, 34, 21, 21, 21, 21, 21, 21, 21, 13, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:21:20,522 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:20,523 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:21:20,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:21:20,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1006419304, now seen corresponding path program 5 times [2020-07-20 13:21:20,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:21:20,525 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2125173500] [2020-07-20 13:21:20,525 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:20,662 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:21:20,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:21:20,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-20 13:21:20,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:21:20,845 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 159 proven. 1055 refuted. 0 times theorem prover too weak. 3799 trivial. 0 not checked. [2020-07-20 13:21:20,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:21:22,093 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:22,453 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:22,613 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:22,695 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:22,696 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:22,741 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:22,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5013 backedges. 159 proven. 1095 refuted. 0 times theorem prover too weak. 3759 trivial. 0 not checked. [2020-07-20 13:21:22,836 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2125173500] [2020-07-20 13:21:22,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:21:22,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 17 [2020-07-20 13:21:22,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392066311] [2020-07-20 13:21:22,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-20 13:21:22,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:21:22,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-20 13:21:22,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-07-20 13:21:22,838 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand 17 states. [2020-07-20 13:21:23,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:21:23,052 INFO L93 Difference]: Finished difference Result 77 states and 222 transitions. [2020-07-20 13:21:23,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-20 13:21:23,053 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 299 [2020-07-20 13:21:23,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:21:23,056 INFO L225 Difference]: With dead ends: 77 [2020-07-20 13:21:23,057 INFO L226 Difference]: Without dead ends: 73 [2020-07-20 13:21:23,058 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 570 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2020-07-20 13:21:23,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-20 13:21:23,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2020-07-20 13:21:23,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-20 13:21:23,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2020-07-20 13:21:23,069 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 299 [2020-07-20 13:21:23,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:21:23,069 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2020-07-20 13:21:23,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-20 13:21:23,070 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2020-07-20 13:21:23,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2020-07-20 13:21:23,080 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:21:23,080 INFO L422 BasicCegarLoop]: trace histogram [77, 77, 39, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:21:23,294 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:23,295 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:21:23,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:21:23,295 INFO L82 PathProgramCache]: Analyzing trace with hash 785285043, now seen corresponding path program 6 times [2020-07-20 13:21:23,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:21:23,295 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [911339752] [2020-07-20 13:21:23,296 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:23,481 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:21:23,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:21:23,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-20 13:21:23,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:21:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 15219 backedges. 391 proven. 2126 refuted. 0 times theorem prover too weak. 12702 trivial. 0 not checked. [2020-07-20 13:21:23,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:21:25,659 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:26,215 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:26,654 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:26,850 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:26,851 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:26,940 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:26,987 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:26,988 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:27,147 INFO L134 CoverageAnalysis]: Checked inductivity of 15219 backedges. 391 proven. 2177 refuted. 0 times theorem prover too weak. 12651 trivial. 0 not checked. [2020-07-20 13:21:27,147 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [911339752] [2020-07-20 13:21:27,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:21:27,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 19 [2020-07-20 13:21:27,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590130573] [2020-07-20 13:21:27,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-20 13:21:27,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:21:27,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-20 13:21:27,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2020-07-20 13:21:27,149 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand 19 states. [2020-07-20 13:21:27,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:21:27,616 INFO L93 Difference]: Finished difference Result 82 states and 252 transitions. [2020-07-20 13:21:27,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 13:21:27,617 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 507 [2020-07-20 13:21:27,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:21:27,621 INFO L225 Difference]: With dead ends: 82 [2020-07-20 13:21:27,621 INFO L226 Difference]: Without dead ends: 78 [2020-07-20 13:21:27,622 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1021 GetRequests, 983 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2020-07-20 13:21:27,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-20 13:21:27,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 51. [2020-07-20 13:21:27,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-20 13:21:27,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 109 transitions. [2020-07-20 13:21:27,633 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 109 transitions. Word has length 507 [2020-07-20 13:21:27,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:21:27,634 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 109 transitions. [2020-07-20 13:21:27,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-20 13:21:27,635 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 109 transitions. [2020-07-20 13:21:27,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2020-07-20 13:21:27,638 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:21:27,638 INFO L422 BasicCegarLoop]: trace histogram [65, 65, 53, 32, 32, 32, 32, 32, 32, 32, 21, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:21:27,852 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:27,853 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:21:27,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:21:27,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1350718391, now seen corresponding path program 6 times [2020-07-20 13:21:27,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:21:27,854 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2050888728] [2020-07-20 13:21:27,854 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:28,038 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:21:28,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:21:28,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-20 13:21:28,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:21:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 333 proven. 1918 refuted. 0 times theorem prover too weak. 9431 trivial. 0 not checked. [2020-07-20 13:21:28,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:21:29,935 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:30,542 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:30,544 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:30,877 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:30,878 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:31,030 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:31,128 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:31,129 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:31,177 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 333 proven. 1975 refuted. 0 times theorem prover too weak. 9374 trivial. 0 not checked. [2020-07-20 13:21:31,300 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2050888728] [2020-07-20 13:21:31,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:21:31,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 19 [2020-07-20 13:21:31,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131462571] [2020-07-20 13:21:31,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-20 13:21:31,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:21:31,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-20 13:21:31,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2020-07-20 13:21:31,302 INFO L87 Difference]: Start difference. First operand 51 states and 109 transitions. Second operand 19 states. [2020-07-20 13:21:31,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:21:31,568 INFO L93 Difference]: Finished difference Result 87 states and 284 transitions. [2020-07-20 13:21:31,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 13:21:31,569 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 450 [2020-07-20 13:21:31,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:21:31,572 INFO L225 Difference]: With dead ends: 87 [2020-07-20 13:21:31,572 INFO L226 Difference]: Without dead ends: 83 [2020-07-20 13:21:31,573 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 906 GetRequests, 868 SyntacticMatches, 14 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2020-07-20 13:21:31,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-20 13:21:31,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 51. [2020-07-20 13:21:31,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-20 13:21:31,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 109 transitions. [2020-07-20 13:21:31,586 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 109 transitions. Word has length 450 [2020-07-20 13:21:31,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:21:31,587 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 109 transitions. [2020-07-20 13:21:31,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-20 13:21:31,588 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 109 transitions. [2020-07-20 13:21:31,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2020-07-20 13:21:31,598 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:21:31,599 INFO L422 BasicCegarLoop]: trace histogram [163, 163, 82, 81, 81, 81, 81, 81, 81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:21:31,812 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:31,813 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:21:31,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:21:31,814 INFO L82 PathProgramCache]: Analyzing trace with hash 40336450, now seen corresponding path program 7 times [2020-07-20 13:21:31,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:21:31,815 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1229241383] [2020-07-20 13:21:31,815 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:32,241 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:21:32,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:21:32,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 1941 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-20 13:21:32,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:21:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 69012 backedges. 797 proven. 5632 refuted. 0 times theorem prover too weak. 62583 trivial. 0 not checked. [2020-07-20 13:21:32,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:21:36,464 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:36,464 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:37,676 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:38,159 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:38,160 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:38,494 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:38,495 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:38,653 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:38,654 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:38,746 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:38,747 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:38,797 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 69012 backedges. 797 proven. 5702 refuted. 0 times theorem prover too weak. 62513 trivial. 0 not checked. [2020-07-20 13:21:39,316 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1229241383] [2020-07-20 13:21:39,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:21:39,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 21 [2020-07-20 13:21:39,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939069404] [2020-07-20 13:21:39,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-20 13:21:39,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:21:39,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-20 13:21:39,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2020-07-20 13:21:39,319 INFO L87 Difference]: Start difference. First operand 51 states and 109 transitions. Second operand 21 states. [2020-07-20 13:21:39,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:21:39,840 INFO L93 Difference]: Finished difference Result 92 states and 318 transitions. [2020-07-20 13:21:39,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 13:21:39,842 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1066 [2020-07-20 13:21:39,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:21:39,848 INFO L225 Difference]: With dead ends: 92 [2020-07-20 13:21:39,848 INFO L226 Difference]: Without dead ends: 88 [2020-07-20 13:21:39,853 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2140 GetRequests, 2097 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2020-07-20 13:21:39,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-20 13:21:39,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 56. [2020-07-20 13:21:39,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-20 13:21:39,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 130 transitions. [2020-07-20 13:21:39,874 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 130 transitions. Word has length 1066 [2020-07-20 13:21:39,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:21:39,877 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 130 transitions. [2020-07-20 13:21:39,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-20 13:21:39,878 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 130 transitions. [2020-07-20 13:21:39,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2020-07-20 13:21:39,883 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:21:39,883 INFO L422 BasicCegarLoop]: trace histogram [95, 95, 79, 47, 47, 47, 47, 47, 47, 47, 32, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:21:40,096 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:40,097 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:21:40,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:21:40,097 INFO L82 PathProgramCache]: Analyzing trace with hash -312379166, now seen corresponding path program 7 times [2020-07-20 13:21:40,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:21:40,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1178813727] [2020-07-20 13:21:40,098 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:40,388 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:21:40,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:21:40,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 1186 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-20 13:21:40,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:21:40,750 INFO L134 CoverageAnalysis]: Checked inductivity of 25265 backedges. 501 proven. 3394 refuted. 0 times theorem prover too weak. 21370 trivial. 0 not checked. [2020-07-20 13:21:40,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:21:43,297 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:43,298 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:44,155 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:44,603 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:44,604 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:44,865 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:44,866 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:45,056 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:45,152 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:45,200 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 25265 backedges. 501 proven. 3471 refuted. 0 times theorem prover too weak. 21293 trivial. 0 not checked. [2020-07-20 13:21:45,551 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1178813727] [2020-07-20 13:21:45,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:21:45,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 21 [2020-07-20 13:21:45,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912816467] [2020-07-20 13:21:45,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-20 13:21:45,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:21:45,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-20 13:21:45,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2020-07-20 13:21:45,556 INFO L87 Difference]: Start difference. First operand 56 states and 130 transitions. Second operand 21 states. [2020-07-20 13:21:46,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:21:46,021 INFO L93 Difference]: Finished difference Result 97 states and 354 transitions. [2020-07-20 13:21:46,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 13:21:46,021 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 656 [2020-07-20 13:21:46,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:21:46,026 INFO L225 Difference]: With dead ends: 97 [2020-07-20 13:21:46,026 INFO L226 Difference]: Without dead ends: 93 [2020-07-20 13:21:46,027 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1319 GetRequests, 1276 SyntacticMatches, 16 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2020-07-20 13:21:46,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-07-20 13:21:46,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 56. [2020-07-20 13:21:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-20 13:21:46,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 130 transitions. [2020-07-20 13:21:46,048 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 130 transitions. Word has length 656 [2020-07-20 13:21:46,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:21:46,049 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 130 transitions. [2020-07-20 13:21:46,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-20 13:21:46,050 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 130 transitions. [2020-07-20 13:21:46,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1275 [2020-07-20 13:21:46,071 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:21:46,072 INFO L422 BasicCegarLoop]: trace histogram [195, 195, 98, 97, 97, 97, 97, 97, 97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:21:46,284 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:46,285 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:21:46,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:21:46,286 INFO L82 PathProgramCache]: Analyzing trace with hash 971855614, now seen corresponding path program 8 times [2020-07-20 13:21:46,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:21:46,287 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [542911643] [2020-07-20 13:21:46,287 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:46,752 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:21:46,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:21:46,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 2318 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-20 13:21:46,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:21:47,427 INFO L134 CoverageAnalysis]: Checked inductivity of 98940 backedges. 1168 proven. 7570 refuted. 0 times theorem prover too weak. 90202 trivial. 0 not checked. [2020-07-20 13:21:47,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:21:51,987 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:53,750 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:54,590 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:55,098 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:55,099 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:55,443 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:55,444 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:55,681 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:55,788 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:55,789 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:55,845 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:55,846 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:21:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 98940 backedges. 1168 proven. 7662 refuted. 0 times theorem prover too weak. 90110 trivial. 0 not checked. [2020-07-20 13:21:56,465 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [542911643] [2020-07-20 13:21:56,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:21:56,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 23 [2020-07-20 13:21:56,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600122010] [2020-07-20 13:21:56,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-20 13:21:56,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:21:56,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-20 13:21:56,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2020-07-20 13:21:56,470 INFO L87 Difference]: Start difference. First operand 56 states and 130 transitions. Second operand 23 states. [2020-07-20 13:21:57,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:21:57,224 INFO L93 Difference]: Finished difference Result 102 states and 392 transitions. [2020-07-20 13:21:57,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 13:21:57,225 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1274 [2020-07-20 13:21:57,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:21:57,230 INFO L225 Difference]: With dead ends: 102 [2020-07-20 13:21:57,231 INFO L226 Difference]: Without dead ends: 98 [2020-07-20 13:21:57,232 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2557 GetRequests, 2509 SyntacticMatches, 18 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2020-07-20 13:21:57,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-20 13:21:57,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 61. [2020-07-20 13:21:57,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-20 13:21:57,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 153 transitions. [2020-07-20 13:21:57,253 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 153 transitions. Word has length 1274 [2020-07-20 13:21:57,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:21:57,256 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 153 transitions. [2020-07-20 13:21:57,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-20 13:21:57,256 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 153 transitions. [2020-07-20 13:21:57,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1821 [2020-07-20 13:21:57,290 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:21:57,291 INFO L422 BasicCegarLoop]: trace histogram [267, 267, 211, 133, 133, 133, 133, 133, 133, 133, 78, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:21:57,506 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:57,507 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:21:57,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:21:57,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1926911020, now seen corresponding path program 8 times [2020-07-20 13:21:57,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:21:57,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1974629250] [2020-07-20 13:21:57,510 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:21:58,184 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:21:58,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:21:58,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 3288 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-20 13:21:58,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:21:59,624 INFO L134 CoverageAnalysis]: Checked inductivity of 199311 backedges. 1523 proven. 11417 refuted. 0 times theorem prover too weak. 186371 trivial. 0 not checked. [2020-07-20 13:21:59,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:22:05,898 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:07,904 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:07,905 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:09,116 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:09,117 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:09,649 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:10,031 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:10,032 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:10,238 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:10,334 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:10,385 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:11,542 INFO L134 CoverageAnalysis]: Checked inductivity of 199311 backedges. 1523 proven. 11517 refuted. 0 times theorem prover too weak. 186271 trivial. 0 not checked. [2020-07-20 13:22:11,543 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1974629250] [2020-07-20 13:22:11,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:22:11,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 22 [2020-07-20 13:22:11,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410818209] [2020-07-20 13:22:11,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-20 13:22:11,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:22:11,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-20 13:22:11,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2020-07-20 13:22:11,546 INFO L87 Difference]: Start difference. First operand 61 states and 153 transitions. Second operand 22 states. [2020-07-20 13:22:12,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:22:12,297 INFO L93 Difference]: Finished difference Result 107 states and 432 transitions. [2020-07-20 13:22:12,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 13:22:12,298 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1820 [2020-07-20 13:22:12,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:22:12,304 INFO L225 Difference]: With dead ends: 107 [2020-07-20 13:22:12,305 INFO L226 Difference]: Without dead ends: 103 [2020-07-20 13:22:12,306 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3648 GetRequests, 3600 SyntacticMatches, 19 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2020-07-20 13:22:12,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-20 13:22:12,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 61. [2020-07-20 13:22:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-20 13:22:12,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 153 transitions. [2020-07-20 13:22:12,326 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 153 transitions. Word has length 1820 [2020-07-20 13:22:12,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:22:12,329 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 153 transitions. [2020-07-20 13:22:12,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-20 13:22:12,329 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 153 transitions. [2020-07-20 13:22:12,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2029 [2020-07-20 13:22:12,370 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:22:12,370 INFO L422 BasicCegarLoop]: trace histogram [311, 311, 156, 155, 155, 155, 155, 155, 155, 155, 155, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:22:12,583 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:22:12,584 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:22:12,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:22:12,585 INFO L82 PathProgramCache]: Analyzing trace with hash -2013442466, now seen corresponding path program 9 times [2020-07-20 13:22:12,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:22:12,585 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1077199225] [2020-07-20 13:22:12,585 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:22:13,269 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:22:13,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:22:13,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 3683 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-20 13:22:13,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:22:15,119 INFO L134 CoverageAnalysis]: Checked inductivity of 252495 backedges. 2059 proven. 13739 refuted. 0 times theorem prover too weak. 236697 trivial. 0 not checked. [2020-07-20 13:22:15,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:22:21,932 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:25,299 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:27,145 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:27,967 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:27,968 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:28,565 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:28,566 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:28,860 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:28,861 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:29,048 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:29,145 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:29,198 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:30,617 INFO L134 CoverageAnalysis]: Checked inductivity of 252495 backedges. 2059 proven. 13856 refuted. 0 times theorem prover too weak. 236580 trivial. 0 not checked. [2020-07-20 13:22:30,617 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1077199225] [2020-07-20 13:22:30,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:22:30,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 24 [2020-07-20 13:22:30,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080684540] [2020-07-20 13:22:30,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-20 13:22:30,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:22:30,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-20 13:22:30,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-07-20 13:22:30,621 INFO L87 Difference]: Start difference. First operand 61 states and 153 transitions. Second operand 24 states. [2020-07-20 13:22:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:22:31,718 INFO L93 Difference]: Finished difference Result 112 states and 474 transitions. [2020-07-20 13:22:31,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 13:22:31,719 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 2028 [2020-07-20 13:22:31,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:22:31,727 INFO L225 Difference]: With dead ends: 112 [2020-07-20 13:22:31,727 INFO L226 Difference]: Without dead ends: 108 [2020-07-20 13:22:31,728 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4066 GetRequests, 4013 SyntacticMatches, 21 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=385, Invalid=737, Unknown=0, NotChecked=0, Total=1122 [2020-07-20 13:22:31,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-07-20 13:22:31,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 66. [2020-07-20 13:22:31,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-20 13:22:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 178 transitions. [2020-07-20 13:22:31,744 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 178 transitions. Word has length 2028 [2020-07-20 13:22:31,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:22:31,746 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 178 transitions. [2020-07-20 13:22:31,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-20 13:22:31,746 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 178 transitions. [2020-07-20 13:22:31,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3145 [2020-07-20 13:22:31,826 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:22:31,827 INFO L422 BasicCegarLoop]: trace histogram [461, 461, 371, 230, 230, 230, 230, 230, 230, 230, 141, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:22:32,040 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:22:32,041 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:22:32,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:22:32,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1076189233, now seen corresponding path program 9 times [2020-07-20 13:22:32,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:22:32,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [326311841] [2020-07-20 13:22:32,044 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:22:33,075 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:22:33,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:22:33,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 5676 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-20 13:22:33,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:22:36,548 INFO L134 CoverageAnalysis]: Checked inductivity of 598095 backedges. 3449 proven. 22734 refuted. 0 times theorem prover too weak. 571912 trivial. 0 not checked. [2020-07-20 13:22:36,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:22:46,059 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:51,302 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:51,303 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:54,134 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:55,388 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:55,982 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:56,253 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:56,430 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:56,552 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:56,553 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:56,617 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:56,700 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:22:59,846 INFO L134 CoverageAnalysis]: Checked inductivity of 598095 backedges. 3459 proven. 22841 refuted. 0 times theorem prover too weak. 571795 trivial. 0 not checked. [2020-07-20 13:22:59,846 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [326311841] [2020-07-20 13:22:59,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:22:59,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 24 [2020-07-20 13:22:59,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355359203] [2020-07-20 13:22:59,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-20 13:22:59,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:22:59,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-20 13:22:59,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-07-20 13:22:59,850 INFO L87 Difference]: Start difference. First operand 66 states and 178 transitions. Second operand 24 states. [2020-07-20 13:23:00,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:23:00,466 INFO L93 Difference]: Finished difference Result 289 states and 3051 transitions. [2020-07-20 13:23:00,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 13:23:00,467 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 3144 [2020-07-20 13:23:00,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:23:00,476 INFO L225 Difference]: With dead ends: 289 [2020-07-20 13:23:00,476 INFO L226 Difference]: Without dead ends: 85 [2020-07-20 13:23:00,492 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6297 GetRequests, 6244 SyntacticMatches, 21 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=385, Invalid=737, Unknown=0, NotChecked=0, Total=1122 [2020-07-20 13:23:00,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-07-20 13:23:00,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-07-20 13:23:00,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-20 13:23:00,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 140 transitions. [2020-07-20 13:23:00,513 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 140 transitions. Word has length 3144 [2020-07-20 13:23:00,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:23:00,514 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 140 transitions. [2020-07-20 13:23:00,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-20 13:23:00,514 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 140 transitions. [2020-07-20 13:23:00,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1336 [2020-07-20 13:23:00,531 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:23:00,532 INFO L422 BasicCegarLoop]: trace histogram [195, 195, 158, 97, 97, 97, 97, 97, 97, 97, 61, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:23:00,744 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:23:00,745 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:23:00,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:23:00,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1195644188, now seen corresponding path program 10 times [2020-07-20 13:23:00,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:23:00,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2092452650] [2020-07-20 13:23:00,748 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:23:01,415 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:23:01,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:23:01,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 2414 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-20 13:23:01,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:23:03,208 INFO L134 CoverageAnalysis]: Checked inductivity of 106687 backedges. 2285 proven. 8111 refuted. 0 times theorem prover too weak. 96291 trivial. 0 not checked. [2020-07-20 13:23:03,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:23:08,987 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:11,235 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:12,664 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:13,351 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:13,804 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:13,805 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:14,113 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:14,306 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:14,417 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:14,418 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:14,477 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:14,623 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 106687 backedges. 2291 proven. 8231 refuted. 0 times theorem prover too weak. 96165 trivial. 0 not checked. [2020-07-20 13:23:15,600 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2092452650] [2020-07-20 13:23:15,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:23:15,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 24 [2020-07-20 13:23:15,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128114613] [2020-07-20 13:23:15,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-20 13:23:15,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:23:15,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-20 13:23:15,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-07-20 13:23:15,603 INFO L87 Difference]: Start difference. First operand 85 states and 140 transitions. Second operand 24 states. [2020-07-20 13:23:16,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:23:16,261 INFO L93 Difference]: Finished difference Result 163 states and 283 transitions. [2020-07-20 13:23:16,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 13:23:16,262 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1335 [2020-07-20 13:23:16,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:23:16,270 INFO L225 Difference]: With dead ends: 163 [2020-07-20 13:23:16,271 INFO L226 Difference]: Without dead ends: 123 [2020-07-20 13:23:16,277 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2679 GetRequests, 2626 SyntacticMatches, 21 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=385, Invalid=737, Unknown=0, NotChecked=0, Total=1122 [2020-07-20 13:23:16,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-07-20 13:23:16,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2020-07-20 13:23:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-20 13:23:16,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 185 transitions. [2020-07-20 13:23:16,305 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 185 transitions. Word has length 1335 [2020-07-20 13:23:16,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:23:16,306 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 185 transitions. [2020-07-20 13:23:16,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-20 13:23:16,306 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 185 transitions. [2020-07-20 13:23:16,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1228 [2020-07-20 13:23:16,335 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:23:16,336 INFO L422 BasicCegarLoop]: trace histogram [177, 177, 158, 88, 88, 88, 88, 88, 88, 88, 70, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:23:16,551 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:23:16,552 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:23:16,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:23:16,553 INFO L82 PathProgramCache]: Analyzing trace with hash 534372127, now seen corresponding path program 11 times [2020-07-20 13:23:16,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:23:16,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [5985701] [2020-07-20 13:23:16,553 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:23:17,293 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:23:17,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:23:17,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 2216 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-20 13:23:17,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:23:18,013 INFO L134 CoverageAnalysis]: Checked inductivity of 90019 backedges. 1377 proven. 7214 refuted. 0 times theorem prover too weak. 81428 trivial. 0 not checked. [2020-07-20 13:23:18,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:23:22,974 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:22,974 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:24,830 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:25,979 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:25,980 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:26,663 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:26,663 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:27,063 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:27,064 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:27,291 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:27,291 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:27,395 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:27,455 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:27,493 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:27,525 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 90019 backedges. 1401 proven. 7292 refuted. 0 times theorem prover too weak. 81326 trivial. 0 not checked. [2020-07-20 13:23:28,102 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [5985701] [2020-07-20 13:23:28,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:23:28,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 22 [2020-07-20 13:23:28,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152924879] [2020-07-20 13:23:28,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-20 13:23:28,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:23:28,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-20 13:23:28,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2020-07-20 13:23:28,104 INFO L87 Difference]: Start difference. First operand 105 states and 185 transitions. Second operand 22 states. [2020-07-20 13:23:28,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:23:28,580 INFO L93 Difference]: Finished difference Result 319 states and 661 transitions. [2020-07-20 13:23:28,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 13:23:28,584 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1227 [2020-07-20 13:23:28,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:23:28,589 INFO L225 Difference]: With dead ends: 319 [2020-07-20 13:23:28,589 INFO L226 Difference]: Without dead ends: 115 [2020-07-20 13:23:28,604 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2462 GetRequests, 2414 SyntacticMatches, 19 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2020-07-20 13:23:28,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-07-20 13:23:28,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2020-07-20 13:23:28,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-20 13:23:28,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 158 transitions. [2020-07-20 13:23:28,621 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 158 transitions. Word has length 1227 [2020-07-20 13:23:28,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:23:28,622 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 158 transitions. [2020-07-20 13:23:28,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-20 13:23:28,622 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 158 transitions. [2020-07-20 13:23:28,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1278 [2020-07-20 13:23:28,638 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:23:28,638 INFO L422 BasicCegarLoop]: trace histogram [187, 187, 148, 93, 93, 93, 93, 93, 93, 93, 55, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:23:28,852 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:23:28,853 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:23:28,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:23:28,854 INFO L82 PathProgramCache]: Analyzing trace with hash -315238118, now seen corresponding path program 12 times [2020-07-20 13:23:28,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:23:28,855 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1404327268] [2020-07-20 13:23:28,856 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:23:29,558 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:23:29,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:23:29,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 2312 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-20 13:23:29,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:23:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 97554 backedges. 1511 proven. 8401 refuted. 0 times theorem prover too weak. 87642 trivial. 0 not checked. [2020-07-20 13:23:30,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:23:36,416 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:36,417 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:38,678 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:40,207 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:41,116 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:41,116 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:41,664 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:41,665 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:41,993 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:41,994 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:42,171 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:42,172 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:42,288 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:42,351 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:42,410 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:43,012 INFO L134 CoverageAnalysis]: Checked inductivity of 97554 backedges. 1523 proven. 8515 refuted. 0 times theorem prover too weak. 87516 trivial. 0 not checked. [2020-07-20 13:23:43,013 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1404327268] [2020-07-20 13:23:43,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:23:43,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 24 [2020-07-20 13:23:43,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573413215] [2020-07-20 13:23:43,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-20 13:23:43,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:23:43,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-20 13:23:43,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-07-20 13:23:43,016 INFO L87 Difference]: Start difference. First operand 105 states and 158 transitions. Second operand 24 states. [2020-07-20 13:23:43,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:23:43,757 INFO L93 Difference]: Finished difference Result 309 states and 507 transitions. [2020-07-20 13:23:43,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 13:23:43,758 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1277 [2020-07-20 13:23:43,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:23:43,764 INFO L225 Difference]: With dead ends: 309 [2020-07-20 13:23:43,764 INFO L226 Difference]: Without dead ends: 105 [2020-07-20 13:23:43,777 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2563 GetRequests, 2510 SyntacticMatches, 21 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=385, Invalid=737, Unknown=0, NotChecked=0, Total=1122 [2020-07-20 13:23:43,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-07-20 13:23:43,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2020-07-20 13:23:43,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-07-20 13:23:43,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2020-07-20 13:23:43,793 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 1277 [2020-07-20 13:23:43,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:23:43,794 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2020-07-20 13:23:43,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-20 13:23:43,794 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2020-07-20 13:23:43,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1218 [2020-07-20 13:23:43,811 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:23:43,811 INFO L422 BasicCegarLoop]: trace histogram [177, 177, 148, 88, 88, 88, 88, 88, 88, 88, 60, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:23:44,024 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:23:44,025 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:23:44,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:23:44,026 INFO L82 PathProgramCache]: Analyzing trace with hash -323469021, now seen corresponding path program 13 times [2020-07-20 13:23:44,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:23:44,027 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1408718873] [2020-07-20 13:23:44,027 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:23:44,792 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:23:44,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:23:44,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 2202 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-20 13:23:44,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:23:45,575 INFO L134 CoverageAnalysis]: Checked inductivity of 88494 backedges. 1616 proven. 6885 refuted. 0 times theorem prover too weak. 79993 trivial. 0 not checked. [2020-07-20 13:23:45,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:23:51,037 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:53,091 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:54,552 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:54,553 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:55,513 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:55,514 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:55,893 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:56,163 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:56,164 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:56,322 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:56,323 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:56,409 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:56,465 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:56,570 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:23:57,364 INFO L134 CoverageAnalysis]: Checked inductivity of 88494 backedges. 1636 proven. 6967 refuted. 0 times theorem prover too weak. 79891 trivial. 0 not checked. [2020-07-20 13:23:57,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1408718873] [2020-07-20 13:23:57,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:23:57,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 22 [2020-07-20 13:23:57,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482198225] [2020-07-20 13:23:57,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-20 13:23:57,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:23:57,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-20 13:23:57,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2020-07-20 13:23:57,367 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand 22 states. [2020-07-20 13:23:57,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:23:57,846 INFO L93 Difference]: Finished difference Result 166 states and 233 transitions. [2020-07-20 13:23:57,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 13:23:57,848 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1217 [2020-07-20 13:23:57,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:23:57,853 INFO L225 Difference]: With dead ends: 166 [2020-07-20 13:23:57,853 INFO L226 Difference]: Without dead ends: 139 [2020-07-20 13:23:57,857 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2442 GetRequests, 2394 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-20 13:23:57,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-07-20 13:23:57,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 102. [2020-07-20 13:23:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-07-20 13:23:57,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2020-07-20 13:23:57,872 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 1217 [2020-07-20 13:23:57,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:23:57,873 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2020-07-20 13:23:57,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-20 13:23:57,873 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2020-07-20 13:23:57,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1278 [2020-07-20 13:23:57,890 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:23:57,891 INFO L422 BasicCegarLoop]: trace histogram [187, 187, 148, 93, 93, 93, 93, 93, 93, 93, 55, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:23:58,105 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:23:58,106 INFO L427 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:23:58,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:23:58,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1135992952, now seen corresponding path program 14 times [2020-07-20 13:23:58,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:23:58,108 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [932068351] [2020-07-20 13:23:58,108 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:23:58,884 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:23:58,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:23:58,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 2312 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-20 13:23:58,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:23:59,706 INFO L134 CoverageAnalysis]: Checked inductivity of 97554 backedges. 1726 proven. 7205 refuted. 0 times theorem prover too weak. 88623 trivial. 0 not checked. [2020-07-20 13:23:59,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:24:05,674 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:05,675 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:08,072 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:09,562 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:10,113 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-07-20 13:24:10,497 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:10,498 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:10,867 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:10,868 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:11,136 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:11,137 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:11,267 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:11,267 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:11,341 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:11,400 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:11,499 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:12,252 INFO L134 CoverageAnalysis]: Checked inductivity of 97554 backedges. 1744 proven. 7289 refuted. 0 times theorem prover too weak. 88521 trivial. 0 not checked. [2020-07-20 13:24:12,252 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [932068351] [2020-07-20 13:24:12,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:24:12,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 22 [2020-07-20 13:24:12,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23027215] [2020-07-20 13:24:12,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-20 13:24:12,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:24:12,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-20 13:24:12,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2020-07-20 13:24:12,255 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand 22 states. [2020-07-20 13:24:12,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:24:12,933 INFO L93 Difference]: Finished difference Result 161 states and 225 transitions. [2020-07-20 13:24:12,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-20 13:24:12,935 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1277 [2020-07-20 13:24:12,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:24:12,941 INFO L225 Difference]: With dead ends: 161 [2020-07-20 13:24:12,941 INFO L226 Difference]: Without dead ends: 134 [2020-07-20 13:24:12,946 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2562 GetRequests, 2514 SyntacticMatches, 19 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2020-07-20 13:24:12,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-07-20 13:24:12,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 102. [2020-07-20 13:24:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-07-20 13:24:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2020-07-20 13:24:12,967 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 1277 [2020-07-20 13:24:12,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:24:12,968 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2020-07-20 13:24:12,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-20 13:24:12,969 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2020-07-20 13:24:12,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1278 [2020-07-20 13:24:12,989 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:24:12,989 INFO L422 BasicCegarLoop]: trace histogram [187, 187, 148, 93, 93, 93, 93, 93, 93, 93, 55, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:24:13,204 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:24:13,205 INFO L427 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:24:13,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:24:13,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1087556544, now seen corresponding path program 15 times [2020-07-20 13:24:13,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:24:13,206 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [735761935] [2020-07-20 13:24:13,206 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:24:14,232 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 13:24:14,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 13:24:14,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 2312 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-20 13:24:14,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 13:24:15,351 INFO L134 CoverageAnalysis]: Checked inductivity of 97554 backedges. 1808 proven. 8104 refuted. 0 times theorem prover too weak. 87642 trivial. 0 not checked. [2020-07-20 13:24:15,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 13:24:22,757 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:25,279 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:26,937 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:26,938 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:28,040 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:28,041 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:28,533 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:28,534 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:28,888 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:29,117 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:29,251 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:29,326 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:29,327 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:29,461 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 13:24:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 97554 backedges. 1816 proven. 8222 refuted. 0 times theorem prover too weak. 87516 trivial. 0 not checked. [2020-07-20 13:24:30,555 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [735761935] [2020-07-20 13:24:30,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 13:24:30,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 24 [2020-07-20 13:24:30,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018845234] [2020-07-20 13:24:30,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-20 13:24:30,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 13:24:30,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-20 13:24:30,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2020-07-20 13:24:30,558 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand 24 states. [2020-07-20 13:24:31,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 13:24:31,141 INFO L93 Difference]: Finished difference Result 145 states and 202 transitions. [2020-07-20 13:24:31,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-20 13:24:31,142 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1277 [2020-07-20 13:24:31,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 13:24:31,147 INFO L225 Difference]: With dead ends: 145 [2020-07-20 13:24:31,148 INFO L226 Difference]: Without dead ends: 118 [2020-07-20 13:24:31,151 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2563 GetRequests, 2510 SyntacticMatches, 21 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=385, Invalid=737, Unknown=0, NotChecked=0, Total=1122 [2020-07-20 13:24:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-07-20 13:24:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2020-07-20 13:24:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-07-20 13:24:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 124 transitions. [2020-07-20 13:24:31,165 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 124 transitions. Word has length 1277 [2020-07-20 13:24:31,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 13:24:31,166 INFO L479 AbstractCegarLoop]: Abstraction has 89 states and 124 transitions. [2020-07-20 13:24:31,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-20 13:24:31,166 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 124 transitions. [2020-07-20 13:24:31,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-07-20 13:24:31,187 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 13:24:31,188 INFO L422 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 13:24:31,401 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:24:31,402 INFO L427 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 13:24:31,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 13:24:31,403 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 16 times [2020-07-20 13:24:31,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 13:24:31,404 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2066284252] [2020-07-20 13:24:31,404 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:24:32,428 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 13:24:32,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-20 13:24:32,429 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 13:24:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 13:24:32,687 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 13:24:32,894 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-20 13:24:32,894 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 13:24:33,109 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 13:24:33,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 01:24:33 BoogieIcfgContainer [2020-07-20 13:24:33,314 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 13:24:33,316 INFO L168 Benchmark]: Toolchain (without parser) took 206195.05 ms. Allocated memory was 144.2 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 100.5 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2020-07-20 13:24:33,317 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 144.2 MB. Free memory was 119.1 MB in the beginning and 118.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-20 13:24:33,317 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.08 ms. Allocated memory is still 144.2 MB. Free memory was 100.1 MB in the beginning and 90.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-07-20 13:24:33,318 INFO L168 Benchmark]: Boogie Preprocessor took 29.25 ms. Allocated memory is still 144.2 MB. Free memory was 90.8 MB in the beginning and 89.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-20 13:24:33,319 INFO L168 Benchmark]: RCFGBuilder took 354.38 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 89.4 MB in the beginning and 169.4 MB in the end (delta: -80.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-20 13:24:33,319 INFO L168 Benchmark]: TraceAbstraction took 205511.75 ms. Allocated memory was 201.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 169.4 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2020-07-20 13:24:33,322 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.25 ms. Allocated memory is still 144.2 MB. Free memory was 119.1 MB in the beginning and 118.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 293.08 ms. Allocated memory is still 144.2 MB. Free memory was 100.1 MB in the beginning and 90.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.25 ms. Allocated memory is still 144.2 MB. Free memory was 90.8 MB in the beginning and 89.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 354.38 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 89.4 MB in the beginning and 169.4 MB in the end (delta: -80.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 205511.75 ms. Allocated memory was 201.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 169.4 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 10; VAL [x=10] [L25] CALL, EXPR fibo(x) VAL [\old(n)=10] [L6] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L8] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L6] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L8] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L6] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L8] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=9, fibo(n-1)=21, n=9] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=9, fibo(n-1)=21, fibo(n-2)=13, n=9] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=10, fibo(n-1)=34, n=10] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L6] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L8] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=10, fibo(n-1)=34, fibo(n-2)=21, n=10] [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) VAL [fibo(x)=55, x=10] [L25] int result = fibo(x); [L26] COND TRUE result == 55 VAL [result=55, x=10] [L27] __VERIFIER_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 205.2s, OverallIterations: 27, TraceHistogramMax: 461, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 602 SDtfs, 2048 SDslu, 2748 SDs, 0 SdLazy, 3948 SolverSat, 4835 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39664 GetRequests, 38759 SyntacticMatches, 339 SemanticMatches, 566 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3519 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 525 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 4.5s SatisfiabilityAnalysisTime, 176.5s InterpolantComputationTime, 20980 NumberOfCodeBlocks, 16071 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 39459 ConstructedInterpolants, 0 QuantifiedInterpolants, 69279757 SizeOfPredicates, 193 NumberOfNonLiveVariables, 35858 ConjunctsInSsa, 386 ConjunctsInUnsatCore, 50 InterpolantComputations, 2 PerfectInterpolantSequences, 3485294/3721774 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...