java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_42.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:01:40,475 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:01:40,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:01:40,489 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:01:40,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:01:40,491 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:01:40,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:01:40,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:01:40,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:01:40,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:01:40,498 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:01:40,499 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:01:40,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:01:40,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:01:40,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:01:40,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:01:40,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:01:40,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:01:40,507 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:01:40,509 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:01:40,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:01:40,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:01:40,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:01:40,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:01:40,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:01:40,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:01:40,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:01:40,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:01:40,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:01:40,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:01:40,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:01:40,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:01:40,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:01:40,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:01:40,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:01:40,525 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:01:40,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:01:40,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:01:40,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:01:40,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:01:40,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:01:40,556 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:01:40,569 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:01:40,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:01:40,574 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:01:40,574 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:01:40,575 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_42.bpl [2019-08-05 11:01:40,576 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_42.bpl' [2019-08-05 11:01:40,660 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:01:40,661 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:01:40,662 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:01:40,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:01:40,663 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:01:40,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_42.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:40" (1/1) ... [2019-08-05 11:01:40,715 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_42.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:40" (1/1) ... [2019-08-05 11:01:40,728 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:01:40,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:01:40,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:01:40,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:01:40,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_42.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:40" (1/1) ... [2019-08-05 11:01:40,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_42.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:40" (1/1) ... [2019-08-05 11:01:40,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_42.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:40" (1/1) ... [2019-08-05 11:01:40,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_42.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:40" (1/1) ... [2019-08-05 11:01:40,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_42.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:40" (1/1) ... [2019-08-05 11:01:40,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_42.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:40" (1/1) ... [2019-08-05 11:01:40,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_42.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:40" (1/1) ... [2019-08-05 11:01:40,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:01:40,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:01:40,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:01:40,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:01:40,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_42.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:40" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:01:40,865 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:01:40,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:01:40,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:01:41,282 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:01:41,283 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:01:41,284 INFO L202 PluginConnector]: Adding new model sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_42.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:01:41 BoogieIcfgContainer [2019-08-05 11:01:41,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:01:41,286 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:01:41,286 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:01:41,289 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:01:41,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_42.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:40" (1/2) ... [2019-08-05 11:01:41,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be8e083 and model type sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_42.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:01:41, skipping insertion in model container [2019-08-05 11:01:41,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_42.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:01:41" (2/2) ... [2019-08-05 11:01:41,292 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_42.bpl [2019-08-05 11:01:41,302 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:01:41,310 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:01:41,328 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:01:41,356 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:01:41,357 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:01:41,357 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:01:41,357 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:01:41,357 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:01:41,357 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:01:41,358 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:01:41,358 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:01:41,358 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:01:41,371 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 11:01:41,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:01:41,379 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:41,380 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:01:41,382 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:41,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:41,388 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2019-08-05 11:01:41,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:41,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:01:41,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:41,653 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:01:41,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:41,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:41,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:41,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-08-05 11:01:41,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:41,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:01:41,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:01:41,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:01:41,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:01:41,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:01:41,855 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 5 states. [2019-08-05 11:01:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:42,406 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2019-08-05 11:01:42,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:01:42,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:01:42,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:42,417 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:01:42,417 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:01:42,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:01:42,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:01:42,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2019-08-05 11:01:42,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:01:42,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-08-05 11:01:42,447 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 6 [2019-08-05 11:01:42,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:42,447 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-08-05 11:01:42,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:01:42,447 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-08-05 11:01:42,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:01:42,448 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:42,448 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:01:42,448 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:42,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:42,449 INFO L82 PathProgramCache]: Analyzing trace with hash 149049733, now seen corresponding path program 1 times [2019-08-05 11:01:42,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:42,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:01:42,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:42,569 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 11:01:42,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:42,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:42,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 11:01:42,614 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:42,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:42,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:42,642 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-08-05 11:01:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:42,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:01:42,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:01:42,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:01:42,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:01:42,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:01:42,776 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 5 states. [2019-08-05 11:01:43,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:43,116 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-05 11:01:43,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:01:43,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 11:01:43,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:43,119 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:01:43,119 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:01:43,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:01:43,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:01:43,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:01:43,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:01:43,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 11:01:43,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 8 [2019-08-05 11:01:43,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:43,123 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 11:01:43,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:01:43,123 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 11:01:43,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:01:43,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:43,124 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:01:43,125 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:43,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:43,125 INFO L82 PathProgramCache]: Analyzing trace with hash 198621957, now seen corresponding path program 1 times [2019-08-05 11:01:43,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:43,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:01:43,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:43,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:43,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:43,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:01:43,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:01:43,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:01:43,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:01:43,364 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 6 states. [2019-08-05 11:01:43,688 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2019-08-05 11:01:43,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:43,882 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-08-05 11:01:43,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:01:43,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 11:01:43,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:43,887 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:01:43,888 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:01:43,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:01:43,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:01:43,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2019-08-05 11:01:43,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:01:43,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-08-05 11:01:43,891 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 8 [2019-08-05 11:01:43,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:43,892 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-08-05 11:01:43,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:01:43,892 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-08-05 11:01:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:01:43,893 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:43,893 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:01:43,893 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:43,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:43,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2019-08-05 11:01:43,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:44,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:01:44,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:44,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:01:44,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:44,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:44,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:44,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-08-05 11:01:44,351 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:44,352 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-08-05 11:01:44,353 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:44,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:44,492 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-08-05 11:01:44,493 INFO L567 ElimStorePlain]: treesize reduction 3, result has 97.5 percent of original size [2019-08-05 11:01:44,497 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_7|], 1=[|v_#memory_$Pointer$.base_7|]} [2019-08-05 11:01:44,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:44,508 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 22 [2019-08-05 11:01:44,509 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:44,615 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-08-05 11:01:44,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:44,651 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 54 [2019-08-05 11:01:44,672 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:44,702 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:44,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2019-08-05 11:01:44,720 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:44,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:44,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-08-05 11:01:44,785 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:44,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:44,885 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:44,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:44,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:44,921 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:125, output treesize:34 [2019-08-05 11:01:45,033 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:45,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-08-05 11:01:45,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:45,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:45,096 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:45,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-08-05 11:01:45,097 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:45,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:45,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:45,117 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:9 [2019-08-05 11:01:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:45,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:45,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:01:45,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:01:45,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:01:45,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:01:45,211 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 7 states. [2019-08-05 11:01:45,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:45,651 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-08-05 11:01:45,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:01:45,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 11:01:45,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:45,653 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:01:45,653 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:01:45,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:01:45,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:01:45,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2019-08-05 11:01:45,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:01:45,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-08-05 11:01:45,658 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2019-08-05 11:01:45,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:45,658 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-08-05 11:01:45,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:01:45,658 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-08-05 11:01:45,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:01:45,659 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:45,659 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2019-08-05 11:01:45,659 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:45,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:45,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1946764223, now seen corresponding path program 2 times [2019-08-05 11:01:45,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:45,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:01:45,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:45,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:01:45,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:45,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:45,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:45,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-08-05 11:01:45,923 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:45,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-08-05 11:01:45,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:45,955 INFO L567 ElimStorePlain]: treesize reduction 19, result has 47.2 percent of original size [2019-08-05 11:01:45,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:45,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:17 [2019-08-05 11:01:46,018 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:46,019 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-08-05 11:01:46,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:46,044 INFO L567 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2019-08-05 11:01:46,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:46,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2019-08-05 11:01:46,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:01:46,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:46,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:01:46,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:01:46,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:01:46,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:01:46,077 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 6 states. [2019-08-05 11:01:46,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:46,303 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-08-05 11:01:46,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:01:46,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 11:01:46,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:46,306 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:01:46,306 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:01:46,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:01:46,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:01:46,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-08-05 11:01:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:01:46,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-08-05 11:01:46,310 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2019-08-05 11:01:46,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:46,310 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-08-05 11:01:46,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:01:46,310 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-08-05 11:01:46,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:01:46,311 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:46,311 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:01:46,311 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:46,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:46,312 INFO L82 PathProgramCache]: Analyzing trace with hash 2135429881, now seen corresponding path program 2 times [2019-08-05 11:01:46,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:46,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:01:46,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:46,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:01:46,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:46,632 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:01:46,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:46,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:46,633 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-08-05 11:01:46,774 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:01:46,822 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:46,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-08-05 11:01:46,824 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:46,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:46,898 INFO L567 ElimStorePlain]: treesize reduction 3, result has 97.4 percent of original size [2019-08-05 11:01:46,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-08-05 11:01:46,911 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:46,914 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:46,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-08-05 11:01:46,922 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:46,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:46,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:46,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:46,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2019-08-05 11:01:46,945 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:46,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:46,953 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:46,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:46,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2019-08-05 11:01:46,992 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:46,994 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:46,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-08-05 11:01:46,998 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:47,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:47,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-08-05 11:01:47,017 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:47,121 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 11:01:47,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:47,121 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:47,237 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-08-05 11:01:47,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:47,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:47,240 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:121, output treesize:53 [2019-08-05 11:01:47,526 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:47,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:47,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:01:47,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:01:47,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:01:47,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:01:47,528 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 7 states. [2019-08-05 11:01:47,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:47,737 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-08-05 11:01:47,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:01:47,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-05 11:01:47,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:47,739 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:01:47,739 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:01:47,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:01:47,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:01:47,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:01:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:01:47,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 11:01:47,742 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 12 [2019-08-05 11:01:47,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:47,742 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 11:01:47,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:01:47,742 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 11:01:47,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:01:47,743 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:47,743 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:01:47,743 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:47,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:47,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1765270407, now seen corresponding path program 3 times [2019-08-05 11:01:47,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:47,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 11:01:47,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:47,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:01:47,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:48,352 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-08-05 11:01:48,354 INFO L567 ElimStorePlain]: treesize reduction 4, result has 86.7 percent of original size [2019-08-05 11:01:48,380 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:01:48,380 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:48,555 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:01:48,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:48,556 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:48,557 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2019-08-05 11:01:48,748 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:01:48,771 INFO L392 ElimStorePlain]: Different costs {1=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 6=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:01:48,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:48,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:01:48,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:49,046 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-08-05 11:01:49,046 INFO L567 ElimStorePlain]: treesize reduction 8, result has 93.3 percent of original size [2019-08-05 11:01:49,080 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:49,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 55 [2019-08-05 11:01:49,082 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:49,210 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-08-05 11:01:49,210 INFO L567 ElimStorePlain]: treesize reduction 22, result has 82.8 percent of original size [2019-08-05 11:01:49,212 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_9|], 1=[|v_#memory_$Pointer$.base_9|]} [2019-08-05 11:01:49,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:49,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-08-05 11:01:49,226 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:49,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:49,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2019-08-05 11:01:49,278 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:49,280 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:49,285 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-08-05 11:01:49,286 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:49,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:49,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-08-05 11:01:49,327 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:49,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:49,354 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:49,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:49,401 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:49,403 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:121, output treesize:65 [2019-08-05 11:01:49,647 INFO L392 ElimStorePlain]: Different costs {3=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 10=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:01:49,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:49,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:49,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2019-08-05 11:01:49,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:49,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:49,913 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:49,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 117 [2019-08-05 11:01:49,915 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:50,305 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-08-05 11:01:50,305 INFO L567 ElimStorePlain]: treesize reduction 56, result has 75.9 percent of original size [2019-08-05 11:01:50,359 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:50,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 89 [2019-08-05 11:01:50,361 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:50,517 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-08-05 11:01:50,517 INFO L567 ElimStorePlain]: treesize reduction 44, result has 79.1 percent of original size [2019-08-05 11:01:50,607 INFO L341 Elim1Store]: treesize reduction 23, result has 75.3 percent of original size [2019-08-05 11:01:50,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 113 [2019-08-05 11:01:50,609 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:50,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:01:50,611 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:50,611 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:01:50,613 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:50,613 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:01:50,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:50,615 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:01:50,617 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:50,618 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:01:50,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:50,619 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:01:50,620 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:50,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:01:50,621 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:50,622 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:01:50,623 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:50,804 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-08-05 11:01:50,804 INFO L567 ElimStorePlain]: treesize reduction 43, result has 75.6 percent of original size [2019-08-05 11:01:50,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:50,808 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:50,809 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:50,811 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:50,812 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:50,816 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:50,821 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:50,822 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:50,825 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:50,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 16 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:50,827 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 13 variables, input treesize:175, output treesize:381 [2019-08-05 11:01:50,828 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:51,143 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 79 [2019-08-05 11:01:51,205 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:51,371 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:51,385 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 12=[|#memory_$Pointer$.base|]} [2019-08-05 11:01:51,395 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:51,396 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:51,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 101 [2019-08-05 11:01:51,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:51,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2019-08-05 11:01:51,433 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:51,708 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-08-05 11:01:51,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:51,749 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:51,751 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:51,760 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:51,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 86 [2019-08-05 11:01:51,761 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:51,767 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:51,768 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2019-08-05 11:01:51,768 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:51,938 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-08-05 11:01:51,939 INFO L567 ElimStorePlain]: treesize reduction 8, result has 94.4 percent of original size [2019-08-05 11:01:51,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-08-05 11:01:51,942 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:190, output treesize:107 [2019-08-05 11:01:52,059 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:52,139 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:52,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 77 [2019-08-05 11:01:52,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:52,268 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:52,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 73 [2019-08-05 11:01:52,270 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:52,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:52,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:52,293 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:123, output treesize:38 [2019-08-05 11:01:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:52,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:52,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:01:52,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:01:52,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:01:52,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:01:52,324 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 8 states. [2019-08-05 11:01:53,022 WARN L188 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 111 [2019-08-05 11:01:53,254 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 83 [2019-08-05 11:01:53,653 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 121 [2019-08-05 11:01:53,866 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 93 [2019-08-05 11:01:54,069 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 119 [2019-08-05 11:01:54,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:54,280 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-08-05 11:01:54,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:01:54,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 11:01:54,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:54,282 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:01:54,282 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:01:54,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=60, Invalid=147, Unknown=3, NotChecked=0, Total=210 [2019-08-05 11:01:54,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:01:54,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2019-08-05 11:01:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:01:54,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 11:01:54,285 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-08-05 11:01:54,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:54,285 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 11:01:54,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:01:54,285 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 11:01:54,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:01:54,286 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:54,286 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 11:01:54,286 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:54,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:54,286 INFO L82 PathProgramCache]: Analyzing trace with hash 87273139, now seen corresponding path program 4 times [2019-08-05 11:01:54,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:54,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 11:01:54,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:54,562 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:01:54,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:54,724 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-08-05 11:01:54,724 INFO L567 ElimStorePlain]: treesize reduction 5, result has 91.2 percent of original size [2019-08-05 11:01:54,737 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2019-08-05 11:01:54,737 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:54,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:54,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 11:01:54,758 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:54,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:54,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:54,777 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:58, output treesize:28 [2019-08-05 11:01:54,820 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:54,833 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:54,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 29 [2019-08-05 11:01:54,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:55,000 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-08-05 11:01:55,000 INFO L567 ElimStorePlain]: treesize reduction 12, result has 90.5 percent of original size [2019-08-05 11:01:55,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2019-08-05 11:01:55,020 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:55,021 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:55,024 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:55,030 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:55,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2019-08-05 11:01:55,034 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:55,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:55,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:55,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:55,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-08-05 11:01:55,058 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:55,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:55,069 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:55,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:55,128 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2019-08-05 11:01:55,159 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:55,168 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:55,175 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-08-05 11:01:55,176 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:55,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:55,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-08-05 11:01:55,202 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:55,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:55,210 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:55,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:55,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:55,254 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 10 variables, input treesize:124, output treesize:55 [2019-08-05 11:01:55,288 INFO L392 ElimStorePlain]: Different costs {0=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 3=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:01:55,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:01:55,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:55,470 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-08-05 11:01:55,471 INFO L567 ElimStorePlain]: treesize reduction 3, result has 98.5 percent of original size [2019-08-05 11:01:55,489 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:55,490 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-08-05 11:01:55,491 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:55,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:55,556 INFO L392 ElimStorePlain]: Different costs {3=[|v_#memory_$Pointer$.base_12|], 4=[|v_#memory_$Pointer$.offset_12|]} [2019-08-05 11:01:55,584 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:55,585 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 147 treesize of output 122 [2019-08-05 11:01:55,586 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:55,586 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:55,587 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:55,588 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:55,589 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:55,589 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:55,590 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:55,606 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:55,612 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:55,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 93 [2019-08-05 11:01:55,628 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:56,018 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-08-05 11:01:56,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:56,027 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:56,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 82 [2019-08-05 11:01:56,043 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:56,407 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2019-08-05 11:01:56,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:56,438 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:56,458 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:56,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 95 [2019-08-05 11:01:56,460 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:57,175 WARN L188 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 104 [2019-08-05 11:01:57,176 INFO L567 ElimStorePlain]: treesize reduction 52, result has 88.6 percent of original size [2019-08-05 11:01:57,250 INFO L341 Elim1Store]: treesize reduction 8, result has 88.4 percent of original size [2019-08-05 11:01:57,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 120 treesize of output 150 [2019-08-05 11:01:57,252 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,253 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,254 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,254 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,255 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,255 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,255 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,256 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,256 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,257 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,258 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,258 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,260 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,262 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,263 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,264 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,264 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,265 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,266 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,267 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,268 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,268 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,269 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,270 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,271 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,271 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,272 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,273 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,274 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,275 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,277 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,277 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,278 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,280 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,283 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,285 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,285 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,286 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,287 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,287 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:57,328 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:57,337 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:57,338 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_57], 1=[v_arrayElimCell_56]} [2019-08-05 11:01:57,355 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedRefinementStrategy.getTraceCheck(FixedRefinementStrategy.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-08-05 11:01:57,360 INFO L168 Benchmark]: Toolchain (without parser) took 16699.31 ms. Allocated memory was 138.9 MB in the beginning and 330.8 MB in the end (delta: 191.9 MB). Free memory was 108.4 MB in the beginning and 199.9 MB in the end (delta: -91.6 MB). Peak memory consumption was 208.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:57,361 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 110.4 MB in the beginning and 110.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:01:57,361 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.51 ms. Allocated memory is still 138.9 MB. Free memory was 108.4 MB in the beginning and 106.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:57,362 INFO L168 Benchmark]: Boogie Preprocessor took 56.52 ms. Allocated memory is still 138.9 MB. Free memory was 106.5 MB in the beginning and 105.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:57,362 INFO L168 Benchmark]: RCFGBuilder took 497.91 ms. Allocated memory is still 138.9 MB. Free memory was 104.9 MB in the beginning and 88.2 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:57,363 INFO L168 Benchmark]: TraceAbstraction took 16073.08 ms. Allocated memory was 138.9 MB in the beginning and 330.8 MB in the end (delta: 191.9 MB). Free memory was 87.8 MB in the beginning and 199.9 MB in the end (delta: -112.1 MB). Peak memory consumption was 188.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:57,365 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 110.4 MB in the beginning and 110.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.51 ms. Allocated memory is still 138.9 MB. Free memory was 108.4 MB in the beginning and 106.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.52 ms. Allocated memory is still 138.9 MB. Free memory was 106.5 MB in the beginning and 105.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 497.91 ms. Allocated memory is still 138.9 MB. Free memory was 104.9 MB in the beginning and 88.2 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16073.08 ms. Allocated memory was 138.9 MB in the beginning and 330.8 MB in the end (delta: 191.9 MB). Free memory was 87.8 MB in the beginning and 199.9 MB in the end (delta: -112.1 MB). Peak memory consumption was 188.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...