/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_VARIABLES --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 2 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 16:02:06,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 16:02:06,143 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 16:02:06,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 16:02:06,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 16:02:06,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 16:02:06,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 16:02:06,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 16:02:06,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 16:02:06,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 16:02:06,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 16:02:06,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 16:02:06,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 16:02:06,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 16:02:06,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 16:02:06,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 16:02:06,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 16:02:06,179 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 16:02:06,180 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 16:02:06,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 16:02:06,184 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 16:02:06,185 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 16:02:06,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 16:02:06,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 16:02:06,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 16:02:06,189 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 16:02:06,189 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 16:02:06,190 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 16:02:06,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 16:02:06,191 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 16:02:06,192 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 16:02:06,192 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 16:02:06,193 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 16:02:06,194 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 16:02:06,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 16:02:06,195 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 16:02:06,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 16:02:06,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 16:02:06,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 16:02:06,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 16:02:06,198 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 16:02:06,199 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-21 16:02:06,214 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 16:02:06,214 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 16:02:06,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 16:02:06,216 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 16:02:06,216 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 16:02:06,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 16:02:06,216 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 16:02:06,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 16:02:06,217 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 16:02:06,217 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 16:02:06,217 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 16:02:06,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 16:02:06,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 16:02:06,218 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 16:02:06,218 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 16:02:06,218 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 16:02:06,218 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 16:02:06,218 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 16:02:06,219 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 16:02:06,219 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 16:02:06,219 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 16:02:06,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 16:02:06,219 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 16:02:06,220 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 16:02:06,220 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 16:02:06,220 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 16:02:06,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:06,220 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 16:02:06,221 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 16:02:06,221 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_VARIABLES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 2 [2020-07-21 16:02:06,483 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 16:02:06,497 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 16:02:06,500 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 16:02:06,502 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 16:02:06,502 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 16:02:06,503 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-07-21 16:02:06,579 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f787b1eb8/766d6885e0dc45af9bd19564a5add09d/FLAGb77c794d8 [2020-07-21 16:02:07,069 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 16:02:07,070 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-07-21 16:02:07,079 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f787b1eb8/766d6885e0dc45af9bd19564a5add09d/FLAGb77c794d8 [2020-07-21 16:02:07,422 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f787b1eb8/766d6885e0dc45af9bd19564a5add09d [2020-07-21 16:02:07,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 16:02:07,437 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 16:02:07,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 16:02:07,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 16:02:07,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 16:02:07,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 04:02:07" (1/1) ... [2020-07-21 16:02:07,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b58d8f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:02:07, skipping insertion in model container [2020-07-21 16:02:07,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 04:02:07" (1/1) ... [2020-07-21 16:02:07,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 16:02:07,476 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 16:02:07,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 16:02:07,651 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 16:02:07,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 16:02:07,684 INFO L208 MainTranslator]: Completed translation [2020-07-21 16:02:07,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:02:07 WrapperNode [2020-07-21 16:02:07,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 16:02:07,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 16:02:07,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 16:02:07,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 16:02:07,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:02:07" (1/1) ... [2020-07-21 16:02:07,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:02:07" (1/1) ... [2020-07-21 16:02:07,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:02:07" (1/1) ... [2020-07-21 16:02:07,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:02:07" (1/1) ... [2020-07-21 16:02:07,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:02:07" (1/1) ... [2020-07-21 16:02:07,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:02:07" (1/1) ... [2020-07-21 16:02:07,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:02:07" (1/1) ... [2020-07-21 16:02:07,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 16:02:07,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 16:02:07,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 16:02:07,716 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 16:02:07,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:02: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-21 16:02:07,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 16:02:07,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 16:02:07,880 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-07-21 16:02:07,880 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 16:02:07,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 16:02:07,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 16:02:07,881 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-07-21 16:02:07,881 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 16:02:07,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 16:02:07,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 16:02:08,058 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 16:02:08,058 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-21 16:02:08,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 04:02:08 BoogieIcfgContainer [2020-07-21 16:02:08,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 16:02:08,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 16:02:08,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 16:02:08,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 16:02:08,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 04:02:07" (1/3) ... [2020-07-21 16:02:08,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a2b844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 04:02:08, skipping insertion in model container [2020-07-21 16:02:08,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:02:07" (2/3) ... [2020-07-21 16:02:08,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a2b844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 04:02:08, skipping insertion in model container [2020-07-21 16:02:08,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 04:02:08" (3/3) ... [2020-07-21 16:02:08,073 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2020-07-21 16:02:08,087 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 16:02:08,095 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 16:02:08,110 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 16:02:08,143 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 16:02:08,143 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 16:02:08,144 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 16:02:08,144 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 16:02:08,144 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 16:02:08,144 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 16:02:08,145 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 16:02:08,145 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 16:02:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-21 16:02:08,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-21 16:02:08,180 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 16:02:08,184 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 16:02:08,185 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 16:02:08,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 16:02:08,196 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-07-21 16:02:08,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 16:02:08,222 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1045124442] [2020-07-21 16:02:08,223 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:08,311 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 16:02:08,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 16:02:08,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 16:02:08,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 16:02:08,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 16:02:08,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 16:02:08,405 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1045124442] [2020-07-21 16:02:08,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 16:02:08,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 16:02:08,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470814827] [2020-07-21 16:02:08,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 16:02:08,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 16:02:08,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 16:02:08,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 16:02:08,427 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-07-21 16:02:08,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 16:02:08,537 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-21 16:02:08,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 16:02:08,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-21 16:02:08,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 16:02:08,551 INFO L225 Difference]: With dead ends: 35 [2020-07-21 16:02:08,551 INFO L226 Difference]: Without dead ends: 21 [2020-07-21 16:02:08,555 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 16:02:08,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-21 16:02:08,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-21 16:02:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-21 16:02:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-21 16:02:08,607 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-07-21 16:02:08,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 16:02:08,608 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-21 16:02:08,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 16:02:08,608 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-21 16:02:08,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-21 16:02:08,611 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 16:02:08,611 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 16:02:08,822 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:08,823 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 16:02:08,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 16:02:08,824 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-07-21 16:02:08,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 16:02:08,825 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1656064485] [2020-07-21 16:02:08,826 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:08,852 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 16:02:08,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 16:02:08,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 16:02:08,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 16:02:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-21 16:02:08,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 16:02:08,905 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1656064485] [2020-07-21 16:02:08,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 16:02:08,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 16:02:08,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022088919] [2020-07-21 16:02:08,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 16:02:08,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 16:02:08,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 16:02:08,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 16:02:08,915 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-07-21 16:02:09,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 16:02:09,002 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-21 16:02:09,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 16:02:09,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-21 16:02:09,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 16:02:09,005 INFO L225 Difference]: With dead ends: 27 [2020-07-21 16:02:09,006 INFO L226 Difference]: Without dead ends: 23 [2020-07-21 16:02:09,007 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 16:02:09,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-21 16:02:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-21 16:02:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-21 16:02:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-07-21 16:02:09,028 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-07-21 16:02:09,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 16:02:09,028 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-21 16:02:09,029 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 16:02:09,029 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-21 16:02:09,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-21 16:02:09,034 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 16:02:09,034 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 16:02:09,248 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:09,249 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 16:02:09,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 16:02:09,252 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-07-21 16:02:09,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 16:02:09,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [196173223] [2020-07-21 16:02:09,253 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:09,289 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 16:02:09,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 16:02:09,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 16:02:09,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 16:02:09,340 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-21 16:02:09,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 16:02:09,541 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:09,604 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-21 16:02:09,605 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [196173223] [2020-07-21 16:02:09,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 16:02:09,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-21 16:02:09,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315447534] [2020-07-21 16:02:09,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-21 16:02:09,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 16:02:09,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-21 16:02:09,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-21 16:02:09,608 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-07-21 16:02:09,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 16:02:09,747 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2020-07-21 16:02:09,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 16:02:09,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-07-21 16:02:09,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 16:02:09,749 INFO L225 Difference]: With dead ends: 32 [2020-07-21 16:02:09,750 INFO L226 Difference]: Without dead ends: 28 [2020-07-21 16:02:09,752 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-21 16:02:09,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-21 16:02:09,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-21 16:02:09,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-21 16:02:09,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-21 16:02:09,766 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 26 [2020-07-21 16:02:09,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 16:02:09,766 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-21 16:02:09,766 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-21 16:02:09,767 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-21 16:02:09,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-21 16:02:09,770 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 16:02:09,770 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 16:02:09,984 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:09,985 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 16:02:09,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 16:02:09,986 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-07-21 16:02:09,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 16:02:09,987 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1584935298] [2020-07-21 16:02:09,987 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:10,028 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 16:02:10,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 16:02:10,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-21 16:02:10,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 16:02:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-21 16:02:10,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 16:02:10,218 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-21 16:02:10,252 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1584935298] [2020-07-21 16:02:10,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 16:02:10,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2020-07-21 16:02:10,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803393796] [2020-07-21 16:02:10,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-21 16:02:10,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 16:02:10,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-21 16:02:10,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-21 16:02:10,254 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 9 states. [2020-07-21 16:02:10,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 16:02:10,335 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2020-07-21 16:02:10,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 16:02:10,336 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-21 16:02:10,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 16:02:10,339 INFO L225 Difference]: With dead ends: 37 [2020-07-21 16:02:10,339 INFO L226 Difference]: Without dead ends: 33 [2020-07-21 16:02:10,340 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-21 16:02:10,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-21 16:02:10,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2020-07-21 16:02:10,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-21 16:02:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-07-21 16:02:10,350 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 27 [2020-07-21 16:02:10,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 16:02:10,350 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-07-21 16:02:10,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-21 16:02:10,351 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-07-21 16:02:10,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-21 16:02:10,352 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 16:02:10,352 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 16:02:10,565 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:10,566 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 16:02:10,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 16:02:10,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2027372739, now seen corresponding path program 2 times [2020-07-21 16:02:10,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 16:02:10,567 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [203285914] [2020-07-21 16:02:10,567 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:10,606 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 16:02:10,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 16:02:10,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 16:02:10,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 16:02:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-21 16:02:10,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 16:02:10,914 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:10,915 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:10,976 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:10,977 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-21 16:02:11,027 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [203285914] [2020-07-21 16:02:11,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 16:02:11,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-21 16:02:11,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961151952] [2020-07-21 16:02:11,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-21 16:02:11,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 16:02:11,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-21 16:02:11,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-21 16:02:11,030 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 11 states. [2020-07-21 16:02:11,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 16:02:11,200 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2020-07-21 16:02:11,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 16:02:11,203 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-07-21 16:02:11,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 16:02:11,205 INFO L225 Difference]: With dead ends: 42 [2020-07-21 16:02:11,205 INFO L226 Difference]: Without dead ends: 38 [2020-07-21 16:02:11,206 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-21 16:02:11,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-21 16:02:11,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2020-07-21 16:02:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-21 16:02:11,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-21 16:02:11,215 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 39 [2020-07-21 16:02:11,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 16:02:11,216 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-21 16:02:11,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-21 16:02:11,216 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-21 16:02:11,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-21 16:02:11,218 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 16:02:11,218 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 16:02:11,423 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:11,424 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 16:02:11,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 16:02:11,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 2 times [2020-07-21 16:02:11,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 16:02:11,426 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [345648769] [2020-07-21 16:02:11,426 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:11,457 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 16:02:11,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 16:02:11,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 16:02:11,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 16:02:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-21 16:02:11,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 16:02:11,718 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:11,771 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:11,772 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:11,811 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-21 16:02:11,812 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [345648769] [2020-07-21 16:02:11,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 16:02:11,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2020-07-21 16:02:11,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445306968] [2020-07-21 16:02:11,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-21 16:02:11,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 16:02:11,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-21 16:02:11,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-21 16:02:11,814 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 11 states. [2020-07-21 16:02:11,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 16:02:11,953 INFO L93 Difference]: Finished difference Result 47 states and 84 transitions. [2020-07-21 16:02:11,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 16:02:11,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2020-07-21 16:02:11,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 16:02:11,956 INFO L225 Difference]: With dead ends: 47 [2020-07-21 16:02:11,956 INFO L226 Difference]: Without dead ends: 43 [2020-07-21 16:02:11,957 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-07-21 16:02:11,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-21 16:02:11,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2020-07-21 16:02:11,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-21 16:02:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-21 16:02:11,968 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 41 [2020-07-21 16:02:11,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 16:02:11,969 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-21 16:02:11,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-21 16:02:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-21 16:02:11,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-21 16:02:11,971 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 16:02:11,972 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 16:02:12,186 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:12,186 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 16:02:12,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 16:02:12,187 INFO L82 PathProgramCache]: Analyzing trace with hash -767819153, now seen corresponding path program 3 times [2020-07-21 16:02:12,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 16:02:12,188 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1197341870] [2020-07-21 16:02:12,188 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:12,233 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 16:02:12,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 16:02:12,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 16:02:12,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 16:02:12,299 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 17 proven. 79 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-07-21 16:02:12,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 16:02:12,750 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:12,846 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:12,848 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:12,896 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:12,897 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 17 proven. 91 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2020-07-21 16:02:12,944 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1197341870] [2020-07-21 16:02:12,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 16:02:12,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2020-07-21 16:02:12,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303215038] [2020-07-21 16:02:12,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-21 16:02:12,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 16:02:12,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-21 16:02:12,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-21 16:02:12,948 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 13 states. [2020-07-21 16:02:13,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 16:02:13,103 INFO L93 Difference]: Finished difference Result 52 states and 102 transitions. [2020-07-21 16:02:13,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 16:02:13,103 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2020-07-21 16:02:13,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 16:02:13,106 INFO L225 Difference]: With dead ends: 52 [2020-07-21 16:02:13,106 INFO L226 Difference]: Without dead ends: 48 [2020-07-21 16:02:13,107 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 111 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-07-21 16:02:13,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-21 16:02:13,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2020-07-21 16:02:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-21 16:02:13,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 58 transitions. [2020-07-21 16:02:13,120 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 58 transitions. Word has length 65 [2020-07-21 16:02:13,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 16:02:13,120 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 58 transitions. [2020-07-21 16:02:13,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-21 16:02:13,121 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2020-07-21 16:02:13,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-07-21 16:02:13,123 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 16:02:13,123 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 16:02:13,337 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:13,338 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 16:02:13,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 16:02:13,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1474757101, now seen corresponding path program 3 times [2020-07-21 16:02:13,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 16:02:13,340 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1245581592] [2020-07-21 16:02:13,340 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:13,388 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 16:02:13,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 16:02:13,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-21 16:02:13,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 16:02:13,538 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 115 proven. 171 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2020-07-21 16:02:13,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 16:02:14,219 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:14,315 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:14,377 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:14,665 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:14,666 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:14,714 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:14,766 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 115 proven. 193 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2020-07-21 16:02:14,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1245581592] [2020-07-21 16:02:14,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 16:02:14,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 21 [2020-07-21 16:02:14,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677170486] [2020-07-21 16:02:14,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-21 16:02:14,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 16:02:14,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-21 16:02:14,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-07-21 16:02:14,772 INFO L87 Difference]: Start difference. First operand 36 states and 58 transitions. Second operand 21 states. [2020-07-21 16:02:15,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 16:02:15,339 INFO L93 Difference]: Finished difference Result 94 states and 184 transitions. [2020-07-21 16:02:15,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-21 16:02:15,340 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 96 [2020-07-21 16:02:15,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 16:02:15,342 INFO L225 Difference]: With dead ends: 94 [2020-07-21 16:02:15,342 INFO L226 Difference]: Without dead ends: 64 [2020-07-21 16:02:15,348 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 164 SyntacticMatches, 13 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=981, Unknown=0, NotChecked=0, Total=1332 [2020-07-21 16:02:15,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-21 16:02:15,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2020-07-21 16:02:15,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-21 16:02:15,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2020-07-21 16:02:15,367 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 96 [2020-07-21 16:02:15,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 16:02:15,369 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2020-07-21 16:02:15,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-21 16:02:15,370 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2020-07-21 16:02:15,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-21 16:02:15,373 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 16:02:15,374 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 16:02:15,592 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:15,592 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 16:02:15,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 16:02:15,594 INFO L82 PathProgramCache]: Analyzing trace with hash 2001184551, now seen corresponding path program 4 times [2020-07-21 16:02:15,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 16:02:15,595 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [453276629] [2020-07-21 16:02:15,595 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:15,646 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 16:02:15,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 16:02:15,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-21 16:02:15,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 16:02:15,705 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-21 16:02:15,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 16:02:16,069 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:16,152 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:16,192 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 103 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-07-21 16:02:16,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [453276629] [2020-07-21 16:02:16,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 16:02:16,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 13 [2020-07-21 16:02:16,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418244301] [2020-07-21 16:02:16,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-21 16:02:16,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 16:02:16,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-21 16:02:16,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-21 16:02:16,225 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand 13 states. [2020-07-21 16:02:16,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 16:02:16,347 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2020-07-21 16:02:16,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-21 16:02:16,348 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2020-07-21 16:02:16,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 16:02:16,350 INFO L225 Difference]: With dead ends: 65 [2020-07-21 16:02:16,350 INFO L226 Difference]: Without dead ends: 61 [2020-07-21 16:02:16,351 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 116 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2020-07-21 16:02:16,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-21 16:02:16,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-07-21 16:02:16,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-21 16:02:16,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2020-07-21 16:02:16,360 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 68 [2020-07-21 16:02:16,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 16:02:16,361 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2020-07-21 16:02:16,361 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-21 16:02:16,361 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2020-07-21 16:02:16,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-07-21 16:02:16,363 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 16:02:16,363 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 16:02:16,569 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:16,570 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 16:02:16,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 16:02:16,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1200034344, now seen corresponding path program 5 times [2020-07-21 16:02:16,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 16:02:16,572 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [234760304] [2020-07-21 16:02:16,572 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:16,649 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 16:02:16,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 16:02:16,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-21 16:02:16,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 16:02:16,717 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-07-21 16:02:16,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 16:02:17,274 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:17,436 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:17,438 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:17,516 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:17,557 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 255 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2020-07-21 16:02:17,606 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [234760304] [2020-07-21 16:02:17,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 16:02:17,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 15 [2020-07-21 16:02:17,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380820672] [2020-07-21 16:02:17,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-21 16:02:17,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 16:02:17,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-21 16:02:17,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-07-21 16:02:17,608 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 15 states. [2020-07-21 16:02:17,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 16:02:17,762 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2020-07-21 16:02:17,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-21 16:02:17,763 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 109 [2020-07-21 16:02:17,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 16:02:17,765 INFO L225 Difference]: With dead ends: 68 [2020-07-21 16:02:17,765 INFO L226 Difference]: Without dead ends: 64 [2020-07-21 16:02:17,766 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 194 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2020-07-21 16:02:17,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-21 16:02:17,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-07-21 16:02:17,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-21 16:02:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2020-07-21 16:02:17,774 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 109 [2020-07-21 16:02:17,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 16:02:17,775 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2020-07-21 16:02:17,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-21 16:02:17,775 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2020-07-21 16:02:17,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-07-21 16:02:17,778 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 16:02:17,778 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 16:02:17,993 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:17,994 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 16:02:17,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 16:02:17,995 INFO L82 PathProgramCache]: Analyzing trace with hash 706081956, now seen corresponding path program 6 times [2020-07-21 16:02:17,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 16:02:17,996 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [303532160] [2020-07-21 16:02:17,997 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:18,086 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 16:02:18,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 16:02:18,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-21 16:02:18,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 16:02:18,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 463 proven. 839 refuted. 0 times theorem prover too weak. 1278 trivial. 0 not checked. [2020-07-21 16:02:18,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 16:02:19,459 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:19,621 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:19,708 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:19,755 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:19,756 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:20,358 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:20,360 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:20,506 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:20,602 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:20,653 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:20,654 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:20,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 463 proven. 891 refuted. 0 times theorem prover too weak. 1226 trivial. 0 not checked. [2020-07-21 16:02:20,716 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [303532160] [2020-07-21 16:02:20,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 16:02:20,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23] total 25 [2020-07-21 16:02:20,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673024739] [2020-07-21 16:02:20,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-21 16:02:20,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 16:02:20,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-21 16:02:20,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2020-07-21 16:02:20,718 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand 25 states. [2020-07-21 16:02:21,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 16:02:21,472 INFO L93 Difference]: Finished difference Result 144 states and 221 transitions. [2020-07-21 16:02:21,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-21 16:02:21,473 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 218 [2020-07-21 16:02:21,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 16:02:21,476 INFO L225 Difference]: With dead ends: 144 [2020-07-21 16:02:21,476 INFO L226 Difference]: Without dead ends: 88 [2020-07-21 16:02:21,478 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 391 SyntacticMatches, 21 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=539, Invalid=1531, Unknown=0, NotChecked=0, Total=2070 [2020-07-21 16:02:21,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-21 16:02:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2020-07-21 16:02:21,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-21 16:02:21,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2020-07-21 16:02:21,502 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 218 [2020-07-21 16:02:21,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 16:02:21,503 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2020-07-21 16:02:21,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-21 16:02:21,503 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2020-07-21 16:02:21,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-07-21 16:02:21,508 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 16:02:21,508 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 16:02:21,722 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:21,722 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 16:02:21,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 16:02:21,723 INFO L82 PathProgramCache]: Analyzing trace with hash 259499213, now seen corresponding path program 7 times [2020-07-21 16:02:21,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 16:02:21,724 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1878953848] [2020-07-21 16:02:21,724 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:21,846 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 16:02:21,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 16:02:21,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-21 16:02:21,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 16:02:21,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-07-21 16:02:21,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 16:02:22,888 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:22,890 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:23,146 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:23,292 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:23,294 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:23,382 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:23,424 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 16:02:23,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 573 refuted. 0 times theorem prover too weak. 988 trivial. 0 not checked. [2020-07-21 16:02:23,472 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1878953848] [2020-07-21 16:02:23,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 16:02:23,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15] total 16 [2020-07-21 16:02:23,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715706942] [2020-07-21 16:02:23,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-21 16:02:23,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 16:02:23,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-21 16:02:23,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2020-07-21 16:02:23,474 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand 16 states. [2020-07-21 16:02:23,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 16:02:23,671 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2020-07-21 16:02:23,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-21 16:02:23,672 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 177 [2020-07-21 16:02:23,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 16:02:23,675 INFO L225 Difference]: With dead ends: 85 [2020-07-21 16:02:23,675 INFO L226 Difference]: Without dead ends: 81 [2020-07-21 16:02:23,676 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 326 SyntacticMatches, 13 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2020-07-21 16:02:23,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-21 16:02:23,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-07-21 16:02:23,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-21 16:02:23,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 107 transitions. [2020-07-21 16:02:23,685 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 107 transitions. Word has length 177 [2020-07-21 16:02:23,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 16:02:23,685 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 107 transitions. [2020-07-21 16:02:23,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-21 16:02:23,686 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 107 transitions. [2020-07-21 16:02:23,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-07-21 16:02:23,690 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 16:02:23,690 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 16:02:23,905 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:23,906 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 16:02:23,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 16:02:23,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1425621089, now seen corresponding path program 8 times [2020-07-21 16:02:23,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 16:02:23,908 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1566268056] [2020-07-21 16:02:23,908 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:24,076 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 16:02:24,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-21 16:02:24,078 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 16:02:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-21 16:02:24,141 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-21 16:02:24,195 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-21 16:02:24,196 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-21 16:02:24,410 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 16:02:24,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 04:02:24 BoogieIcfgContainer [2020-07-21 16:02:24,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 16:02:24,484 INFO L168 Benchmark]: Toolchain (without parser) took 17047.38 ms. Allocated memory was 137.4 MB in the beginning and 383.3 MB in the end (delta: 245.9 MB). Free memory was 101.9 MB in the beginning and 149.5 MB in the end (delta: -47.6 MB). Peak memory consumption was 198.3 MB. Max. memory is 7.1 GB. [2020-07-21 16:02:24,484 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-21 16:02:24,485 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.58 ms. Allocated memory is still 137.4 MB. Free memory was 101.5 MB in the beginning and 92.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-07-21 16:02:24,486 INFO L168 Benchmark]: Boogie Preprocessor took 29.64 ms. Allocated memory is still 137.4 MB. Free memory was 92.3 MB in the beginning and 90.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-21 16:02:24,487 INFO L168 Benchmark]: RCFGBuilder took 346.89 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 90.9 MB in the beginning and 168.9 MB in the end (delta: -78.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-21 16:02:24,488 INFO L168 Benchmark]: TraceAbstraction took 16416.28 ms. Allocated memory was 201.9 MB in the beginning and 383.3 MB in the end (delta: 181.4 MB). Free memory was 168.2 MB in the beginning and 149.5 MB in the end (delta: 18.8 MB). Peak memory consumption was 200.2 MB. Max. memory is 7.1 GB. [2020-07-21 16:02:24,491 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 247.58 ms. Allocated memory is still 137.4 MB. Free memory was 101.5 MB in the beginning and 92.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.64 ms. Allocated memory is still 137.4 MB. Free memory was 92.3 MB in the beginning and 90.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 346.89 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 90.9 MB in the beginning and 168.9 MB in the end (delta: -78.0 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16416.28 ms. Allocated memory was 201.9 MB in the beginning and 383.3 MB in the end (delta: 181.4 MB). Free memory was 168.2 MB in the beginning and 149.5 MB in the end (delta: 18.8 MB). Peak memory consumption was 200.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 7; VAL [x=7] [L25] CALL, EXPR fibo(x) 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); [L25] RET, EXPR fibo(x) VAL [fibo(x)=13, x=7] [L25] int result = fibo(x); [L26] COND TRUE result == 13 VAL [result=13, x=7] [L27] __VERIFIER_error() VAL [result=13, x=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.2s, OverallIterations: 13, TraceHistogramMax: 41, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 212 SDtfs, 844 SDslu, 818 SDs, 0 SdLazy, 995 SolverSat, 830 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1828 GetRequests, 1538 SyntacticMatches, 93 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 55 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 1179 NumberOfCodeBlocks, 1022 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1737 ConstructedInterpolants, 0 QuantifiedInterpolants, 437007 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1782 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 22 InterpolantComputations, 2 PerfectInterpolantSequences, 7254/11428 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...