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/dll_extends_pointer_true-valid-memsafety.i_37.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:05:17,620 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:05:17,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:05:17,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:05:17,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:05:17,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:05:17,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:05:17,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:05:17,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:05:17,641 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:05:17,642 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:05:17,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:05:17,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:05:17,643 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:05:17,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:05:17,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:05:17,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:05:17,647 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:05:17,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:05:17,651 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:05:17,653 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:05:17,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:05:17,655 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:05:17,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:05:17,659 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:05:17,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:05:17,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:05:17,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:05:17,661 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:05:17,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:05:17,662 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:05:17,663 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:05:17,664 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:05:17,665 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:05:17,666 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:05:17,666 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:05:17,667 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:05:17,667 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:05:17,667 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:05:17,668 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:05:17,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:05:17,696 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:05:17,708 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:05:17,712 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:05:17,714 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:05:17,715 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:05:17,716 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/dll_extends_pointer_true-valid-memsafety.i_37.bpl [2019-08-05 11:05:17,716 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/dll_extends_pointer_true-valid-memsafety.i_37.bpl' [2019-08-05 11:05:17,771 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:05:17,773 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:05:17,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:05:17,775 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:05:17,775 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:05:17,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "dll_extends_pointer_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:17" (1/1) ... [2019-08-05 11:05:17,811 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "dll_extends_pointer_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:17" (1/1) ... [2019-08-05 11:05:17,835 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:05:17,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:05:17,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:05:17,837 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:05:17,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "dll_extends_pointer_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:17" (1/1) ... [2019-08-05 11:05:17,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "dll_extends_pointer_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:17" (1/1) ... [2019-08-05 11:05:17,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "dll_extends_pointer_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:17" (1/1) ... [2019-08-05 11:05:17,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "dll_extends_pointer_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:17" (1/1) ... [2019-08-05 11:05:17,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "dll_extends_pointer_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:17" (1/1) ... [2019-08-05 11:05:17,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "dll_extends_pointer_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:17" (1/1) ... [2019-08-05 11:05:17,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "dll_extends_pointer_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:17" (1/1) ... [2019-08-05 11:05:17,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:05:17,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:05:17,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:05:17,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:05:17,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "dll_extends_pointer_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:17" (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:05:17,962 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:05:17,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:05:17,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:05:18,399 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:05:18,399 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:05:18,401 INFO L202 PluginConnector]: Adding new model dll_extends_pointer_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:05:18 BoogieIcfgContainer [2019-08-05 11:05:18,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:05:18,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:05:18,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:05:18,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:05:18,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "dll_extends_pointer_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:05:17" (1/2) ... [2019-08-05 11:05:18,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ad1229e and model type dll_extends_pointer_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:05:18, skipping insertion in model container [2019-08-05 11:05:18,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "dll_extends_pointer_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:05:18" (2/2) ... [2019-08-05 11:05:18,411 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer_true-valid-memsafety.i_37.bpl [2019-08-05 11:05:18,423 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:05:18,433 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:05:18,455 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:05:18,493 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:05:18,494 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:05:18,494 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:05:18,496 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:05:18,496 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:05:18,497 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:05:18,497 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:05:18,497 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:05:18,497 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:05:18,518 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 11:05:18,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:05:18,528 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:18,529 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:05:18,541 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:18,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:18,551 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2019-08-05 11:05:18,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:18,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:05:18,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:18,806 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:05:18,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:18,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:18,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:18,832 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-08-05 11:05:18,871 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:05:18,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:05:18,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:05:18,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:05:18,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:05:18,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:05:18,891 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2019-08-05 11:05:19,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:19,043 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 11:05:19,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:05:19,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 11:05:19,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:19,056 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:05:19,056 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:05:19,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:05:19,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:05:19,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:05:19,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:05:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 11:05:19,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-08-05 11:05:19,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:19,093 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 11:05:19,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:05:19,093 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 11:05:19,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:05:19,094 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:19,094 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:05:19,095 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:19,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:19,095 INFO L82 PathProgramCache]: Analyzing trace with hash 149049733, now seen corresponding path program 1 times [2019-08-05 11:05:19,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:19,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:05:19,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:19,285 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 13 treesize of output 9 [2019-08-05 11:05:19,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:19,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:19,377 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 13 treesize of output 9 [2019-08-05 11:05:19,378 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:19,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:19,410 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:05:19,411 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:25 [2019-08-05 11:05:19,498 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:05:19,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:05:19,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:05:19,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:05:19,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:05:19,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:05:19,502 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2019-08-05 11:05:19,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:19,606 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 11:05:19,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:05:19,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-08-05 11:05:19,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:19,607 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:05:19,607 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:05:19,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:05:19,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:05:19,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:05:19,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:05:19,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 11:05:19,612 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-08-05 11:05:19,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:19,612 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 11:05:19,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:05:19,612 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 11:05:19,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:05:19,613 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:19,614 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:05:19,614 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:19,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:19,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2019-08-05 11:05:19,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:19,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:05:19,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:19,980 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:05:19,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:20,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:20,042 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:05:20,043 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-08-05 11:05:20,077 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_11|], 3=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:05:20,204 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:20,205 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:05:20,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:20,365 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-08-05 11:05:20,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:20,422 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:20,422 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-08-05 11:05:20,423 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:20,579 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-08-05 11:05:20,579 INFO L567 ElimStorePlain]: treesize reduction 14, result has 86.5 percent of original size [2019-08-05 11:05:20,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:20,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 26 [2019-08-05 11:05:20,666 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:20,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:20,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:20,706 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:98, output treesize:62 [2019-08-05 11:05:20,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:20,872 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:05:20,921 INFO L341 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2019-08-05 11:05:20,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 32 [2019-08-05 11:05:20,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:21,002 INFO L567 ElimStorePlain]: treesize reduction 22, result has 72.5 percent of original size [2019-08-05 11:05:21,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:21,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:21,017 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:05:21,044 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:21,045 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 50 [2019-08-05 11:05:21,047 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:21,051 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:21,052 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:21,356 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 19 [2019-08-05 11:05:21,357 INFO L567 ElimStorePlain]: treesize reduction 30, result has 48.3 percent of original size [2019-08-05 11:05:21,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:21,360 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:88, output treesize:16 [2019-08-05 11:05:21,463 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:05:21,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:21,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:05:21,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:05:21,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:05:21,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:05:21,465 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 7 states. [2019-08-05 11:05:21,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:21,814 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 11:05:21,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:05:21,816 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 11:05:21,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:21,817 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:05:21,817 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:05:21,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:05:21,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:05:21,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:05:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:05:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 11:05:21,822 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-08-05 11:05:21,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:21,822 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 11:05:21,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:05:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 11:05:21,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:05:21,823 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:21,823 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:05:21,823 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:21,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:21,824 INFO L82 PathProgramCache]: Analyzing trace with hash 2135429881, now seen corresponding path program 2 times [2019-08-05 11:05:21,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:21,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:05:21,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:22,010 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:05:22,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:22,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:22,108 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 13 treesize of output 9 [2019-08-05 11:05:22,108 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:22,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:22,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:22,130 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:26 [2019-08-05 11:05:22,227 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:22,228 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:05:22,229 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:22,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:22,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:22,323 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_11|], 6=[|v_#memory_$Pointer$.offset_10|]} [2019-08-05 11:05:22,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:22,335 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 63 treesize of output 24 [2019-08-05 11:05:22,336 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:22,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:22,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:22,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:22,413 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 0 case distinctions, treesize of input 75 treesize of output 38 [2019-08-05 11:05:22,414 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:22,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:22,452 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:05:22,453 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:168, output treesize:77 [2019-08-05 11:05:22,593 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:05:22,611 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:22,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 56 [2019-08-05 11:05:22,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:22,721 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-08-05 11:05:22,722 INFO L567 ElimStorePlain]: treesize reduction 18, result has 75.0 percent of original size [2019-08-05 11:05:22,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:22,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:90, output treesize:48 [2019-08-05 11:05:22,834 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:05:22,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:22,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:05:22,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:05:22,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:05:22,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:05:22,836 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-08-05 11:05:35,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:35,560 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-08-05 11:05:35,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:05:35,561 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-05 11:05:35,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:35,562 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:05:35,562 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:05:35,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:05:35,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:05:35,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:05:35,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:05:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 11:05:35,565 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-08-05 11:05:35,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:35,565 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 11:05:35,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:05:35,566 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 11:05:35,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:05:35,566 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:35,567 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 11:05:35,567 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:35,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:35,567 INFO L82 PathProgramCache]: Analyzing trace with hash 87273139, now seen corresponding path program 3 times [2019-08-05 11:05:35,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:35,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-05 11:05:35,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:36,019 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:36,020 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-08-05 11:05:36,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:36,044 INFO L567 ElimStorePlain]: treesize reduction 10, result has 66.7 percent of original size [2019-08-05 11:05:36,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:05:36,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:20 [2019-08-05 11:05:36,071 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:36,163 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:05:36,337 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-08-05 11:05:36,337 INFO L341 Elim1Store]: treesize reduction 14, result has 88.2 percent of original size [2019-08-05 11:05:36,338 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 105 treesize of output 197 [2019-08-05 11:05:36,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:36,365 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:05:36,445 INFO L341 Elim1Store]: treesize reduction 3, result has 95.0 percent of original size [2019-08-05 11:05:36,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 100 treesize of output 146 [2019-08-05 11:05:36,447 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:36,712 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-08-05 11:05:36,712 INFO L567 ElimStorePlain]: treesize reduction 74, result has 73.1 percent of original size [2019-08-05 11:05:36,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 66 [2019-08-05 11:05:36,757 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:36,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 54 [2019-08-05 11:05:36,924 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:37,105 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-08-05 11:05:37,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:37,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-08-05 11:05:37,108 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:204, output treesize:144 [2019-08-05 11:05:37,276 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:37,279 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:05:37,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:05:37,331 INFO L392 ElimStorePlain]: Different costs {29=[|v_#valid_16|], 67=[v_prenex_6]} [2019-08-05 11:05:37,558 INFO L235 Elim1Store]: Index analysis took 134 ms [2019-08-05 11:05:37,779 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-08-05 11:05:37,779 INFO L341 Elim1Store]: treesize reduction 98, result has 69.1 percent of original size [2019-08-05 11:05:37,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 263 treesize of output 443 [2019-08-05 11:05:37,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:39,708 WARN L188 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 144 DAG size of output: 135 [2019-08-05 11:05:39,709 INFO L567 ElimStorePlain]: treesize reduction 134, result has 84.9 percent of original size [2019-08-05 11:05:40,046 INFO L235 Elim1Store]: Index analysis took 310 ms [2019-08-05 11:05:40,525 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2019-08-05 11:05:40,526 INFO L341 Elim1Store]: treesize reduction 87, result has 72.8 percent of original size [2019-08-05 11:05:40,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 164 treesize of output 372 [2019-08-05 11:05:40,529 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:40,732 INFO L235 Elim1Store]: Index analysis took 172 ms [2019-08-05 11:05:41,003 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-08-05 11:05:41,004 INFO L341 Elim1Store]: treesize reduction 77, result has 70.5 percent of original size [2019-08-05 11:05:41,005 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 155 treesize of output 316 [2019-08-05 11:05:41,007 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:41,364 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-08-05 11:05:41,365 INFO L341 Elim1Store]: treesize reduction 77, result has 70.5 percent of original size [2019-08-05 11:05:41,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 162 treesize of output 323 [2019-08-05 11:05:41,367 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:43,775 WARN L188 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 163 DAG size of output: 147 [2019-08-05 11:05:43,776 INFO L567 ElimStorePlain]: treesize reduction 257, result has 77.1 percent of original size [2019-08-05 11:05:43,779 INFO L392 ElimStorePlain]: Different costs {18=[|v_#memory_$Pointer$.base_13|], 52=[v_prenex_5]} [2019-08-05 11:05:43,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:43,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:43,844 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:05:43,845 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:05:43,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:43,934 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:43,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 274 treesize of output 214 [2019-08-05 11:05:43,937 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:43,939 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:43,941 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:43,942 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:43,943 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:45,244 WARN L188 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 165 DAG size of output: 143 [2019-08-05 11:05:45,245 INFO L567 ElimStorePlain]: treesize reduction 150, result has 83.0 percent of original size [2019-08-05 11:05:45,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:45,392 INFO L235 Elim1Store]: Index analysis took 119 ms [2019-08-05 11:05:45,694 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-08-05 11:05:45,694 INFO L341 Elim1Store]: treesize reduction 20, result has 87.6 percent of original size [2019-08-05 11:05:45,695 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 268 [2019-08-05 11:05:45,697 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:45,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:45,962 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-08-05 11:05:45,963 INFO L341 Elim1Store]: treesize reduction 20, result has 87.6 percent of original size [2019-08-05 11:05:45,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 201 treesize of output 262 [2019-08-05 11:05:45,966 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:45,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:46,157 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-08-05 11:05:46,157 INFO L341 Elim1Store]: treesize reduction 20, result has 87.6 percent of original size [2019-08-05 11:05:46,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 186 treesize of output 255 [2019-08-05 11:05:46,161 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:46,958 WARN L188 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 128 [2019-08-05 11:05:46,959 INFO L567 ElimStorePlain]: treesize reduction 581, result has 49.4 percent of original size [2019-08-05 11:05:46,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-08-05 11:05:46,965 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:755, output treesize:787 [2019-08-05 11:05:47,123 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2019-08-05 11:05:47,712 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 195 [2019-08-05 11:05:47,718 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:47,719 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-08-05 11:05:47,725 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-08-05 11:05:47,768 INFO L392 ElimStorePlain]: Different costs {19=[v_prenex_17], 20=[v_prenex_23, v_prenex_15, v_prenex_21], 26=[v_prenex_25], 27=[|v_#valid_17|, v_prenex_27, v_prenex_38, v_prenex_42], 35=[v_prenex_33]} [2019-08-05 11:05:47,814 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-08-05 11:05:47,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:50,238 WARN L188 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 496 DAG size of output: 284 [2019-08-05 11:05:50,239 INFO L567 ElimStorePlain]: treesize reduction 1016, result has 53.7 percent of original size [2019-08-05 11:05:50,239 INFO L464 ElimStorePlain]: Eliminatee v_prenex_23 vanished before elimination [2019-08-05 11:05:50,239 INFO L464 ElimStorePlain]: Eliminatee v_prenex_15 vanished before elimination [2019-08-05 11:05:50,240 INFO L464 ElimStorePlain]: Eliminatee v_prenex_21 vanished before elimination [2019-08-05 11:05:50,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:50,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:50,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:50,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:50,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:50,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 252 [2019-08-05 11:05:50,274 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:51,253 WARN L188 SmtUtils]: Spent 978.00 ms on a formula simplification. DAG size of input: 280 DAG size of output: 270 [2019-08-05 11:05:51,254 INFO L567 ElimStorePlain]: treesize reduction 74, result has 93.7 percent of original size [2019-08-05 11:05:51,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:51,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:51,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:51,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:51,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:51,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 228 [2019-08-05 11:05:51,394 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:52,273 WARN L188 SmtUtils]: Spent 878.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 254 [2019-08-05 11:05:52,274 INFO L567 ElimStorePlain]: treesize reduction 74, result has 93.1 percent of original size [2019-08-05 11:05:52,274 INFO L464 ElimStorePlain]: Eliminatee v_prenex_27 vanished before elimination [2019-08-05 11:05:52,287 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:05:52,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:52,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 217 [2019-08-05 11:05:52,309 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:53,034 WARN L188 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 248 DAG size of output: 240 [2019-08-05 11:05:53,035 INFO L567 ElimStorePlain]: treesize reduction 58, result has 94.1 percent of original size [2019-08-05 11:05:53,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:53,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:53,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:53,051 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:05:53,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 225 [2019-08-05 11:05:53,066 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:53,691 WARN L188 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 222 [2019-08-05 11:05:53,692 INFO L567 ElimStorePlain]: treesize reduction 58, result has 93.7 percent of original size [2019-08-05 11:05:53,732 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:05:53,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:53,863 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-08-05 11:05:53,864 INFO L341 Elim1Store]: treesize reduction 3, result has 97.4 percent of original size [2019-08-05 11:05:53,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 257 treesize of output 367 [2019-08-05 11:05:53,866 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:54,450 WARN L188 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 207 [2019-08-05 11:05:54,451 INFO L567 ElimStorePlain]: treesize reduction 159, result has 83.1 percent of original size [2019-08-05 11:05:54,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 31 dim-0 vars, 10 dim-1 vars, End of recursive call: 18 dim-0 vars, and 5 xjuncts. [2019-08-05 11:05:54,456 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 41 variables, input treesize:2455, output treesize:783 [2019-08-05 11:05:54,774 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 230 [2019-08-05 11:05:54,780 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:55,893 WARN L188 SmtUtils]: Spent 952.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 239 [2019-08-05 11:05:55,899 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:55,900 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-08-05 11:05:55,906 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-08-05 11:05:55,911 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-08-05 11:05:55,946 INFO L392 ElimStorePlain]: Different costs {36=[v_prenex_47, v_prenex_54, v_prenex_51], 45=[|v_#valid_18|], 49=[v_prenex_49]} [2019-08-05 11:05:55,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:56,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:56,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:56,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:56,188 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:05:56,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:56,251 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:05:56,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:56,599 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:05:56,697 INFO L235 Elim1Store]: Index analysis took 684 ms [2019-08-05 11:05:57,173 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-08-05 11:05:57,173 INFO L341 Elim1Store]: treesize reduction 11, result has 95.0 percent of original size [2019-08-05 11:05:57,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 212 treesize of output 384 [2019-08-05 11:05:57,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:57,192 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-08-05 11:05:57,193 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:58,325 WARN L188 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 318 DAG size of output: 214 [2019-08-05 11:05:58,326 INFO L567 ElimStorePlain]: treesize reduction 1327, result has 35.9 percent of original size [2019-08-05 11:05:58,349 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:05:58,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:58,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:58,509 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-08-05 11:05:58,510 INFO L341 Elim1Store]: treesize reduction 107, result has 64.8 percent of original size [2019-08-05 11:05:58,510 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 175 treesize of output 336 [2019-08-05 11:05:58,512 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:59,146 WARN L188 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 213 [2019-08-05 11:05:59,147 INFO L567 ElimStorePlain]: treesize reduction 115, result has 86.7 percent of original size [2019-08-05 11:05:59,147 INFO L464 ElimStorePlain]: Eliminatee v_prenex_51 vanished before elimination [2019-08-05 11:05:59,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:59,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:59,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:59,198 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:05:59,442 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-08-05 11:05:59,443 INFO L341 Elim1Store]: treesize reduction 132, result has 69.1 percent of original size [2019-08-05 11:05:59,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 215 treesize of output 472 [2019-08-05 11:05:59,446 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:00,087 WARN L188 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 214 [2019-08-05 11:06:00,088 INFO L567 ElimStorePlain]: treesize reduction 180, result has 80.9 percent of original size [2019-08-05 11:06:00,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:00,116 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:00,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:00,268 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-08-05 11:06:00,269 INFO L341 Elim1Store]: treesize reduction 107, result has 66.6 percent of original size [2019-08-05 11:06:00,270 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 191 treesize of output 376 [2019-08-05 11:06:00,271 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:01,249 WARN L188 SmtUtils]: Spent 976.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 214 [2019-08-05 11:06:01,250 INFO L567 ElimStorePlain]: treesize reduction 155, result has 83.3 percent of original size [2019-08-05 11:06:01,326 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:01,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:01,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:01,434 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:01,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:01,456 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:01,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:01,491 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:01,555 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:01,562 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:01,563 INFO L235 Elim1Store]: Index analysis took 269 ms [2019-08-05 11:06:01,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:01,567 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:01,624 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:01,625 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 4 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 24 case distinctions, treesize of input 177 treesize of output 167 [2019-08-05 11:06:01,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,628 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,629 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,630 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,630 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,631 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,637 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,638 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,638 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,639 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,642 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,643 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,643 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,644 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,644 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,645 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,646 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,646 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,647 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,648 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,649 INFO L496 ElimStorePlain]: Start of recursive call 7: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:01,680 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:01,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:01,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:01,690 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:01,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:01,692 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:01,704 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:01,711 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:01,712 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:01,768 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:01,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 4 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 19 case distinctions, treesize of input 222 treesize of output 191 [2019-08-05 11:06:01,771 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,772 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,772 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,773 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,774 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,774 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,775 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,776 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,777 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,777 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,779 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,779 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,780 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,780 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,781 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,782 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,782 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,783 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,784 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,785 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,786 INFO L496 ElimStorePlain]: Start of recursive call 8: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:01,849 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:01,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:01,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:01,867 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:01,867 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:01,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:01,877 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:01,882 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:01,892 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:01,893 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:01,947 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:01,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 3 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 23 case distinctions, treesize of input 194 treesize of output 173 [2019-08-05 11:06:01,951 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,951 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,952 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,952 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,953 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,953 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,953 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,955 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,955 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,956 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,957 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,958 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,958 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,959 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,959 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,960 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,961 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:01,962 INFO L496 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:02,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:02,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:02,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:02,087 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:02,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:02,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:02,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:02,172 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:02,184 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:02,197 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:02,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:03,397 WARN L188 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 62 [2019-08-05 11:06:03,398 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:03,398 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 5 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 30 case distinctions, treesize of input 178 treesize of output 200 [2019-08-05 11:06:03,400 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:03,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:03,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:03,402 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:03,402 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:03,403 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:03,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:03,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:03,406 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:03,407 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:03,408 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:03,409 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:03,410 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:03,410 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:03,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:03,411 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:03,412 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:03,413 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:03,413 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:03,414 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:03,415 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:03,417 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:03,418 INFO L496 ElimStorePlain]: Start of recursive call 10: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:03,977 WARN L188 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 149 [2019-08-05 11:06:03,978 INFO L567 ElimStorePlain]: treesize reduction 286, result has 50.9 percent of original size [2019-08-05 11:06:03,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 23 dim-0 vars, 5 dim-1 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2019-08-05 11:06:03,981 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 29 variables, input treesize:2130, output treesize:225 [2019-08-05 11:06:04,163 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 62 [2019-08-05 11:06:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:04,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:04,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:06:04,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:06:04,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:06:04,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=70, Unknown=2, NotChecked=0, Total=90 [2019-08-05 11:06:04,324 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 10 states. [2019-08-05 11:06:05,257 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification that was a NOOP. DAG size: 337 [2019-08-05 11:06:06,373 WARN L188 SmtUtils]: Spent 977.00 ms on a formula simplification that was a NOOP. DAG size: 296 [2019-08-05 11:06:06,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:06,665 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-08-05 11:06:06,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:06:06,666 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-08-05 11:06:06,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:06,667 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:06:06,667 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:06:06,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=31, Invalid=120, Unknown=5, NotChecked=0, Total=156 [2019-08-05 11:06:06,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:06:06,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-08-05 11:06:06,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:06:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-08-05 11:06:06,671 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2019-08-05 11:06:06,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:06,671 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-08-05 11:06:06,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:06:06,671 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-08-05 11:06:06,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:06:06,672 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:06,672 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1] [2019-08-05 11:06:06,672 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:06,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:06,672 INFO L82 PathProgramCache]: Analyzing trace with hash -2029806995, now seen corresponding path program 4 times [2019-08-05 11:06:06,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:06,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 11:06:06,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:07,046 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:07,046 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 6 treesize of output 1 [2019-08-05 11:06:07,047 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:07,174 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 11:06:07,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:07,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-08-05 11:06:07,214 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:07,343 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 11:06:07,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:07,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:07,343 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:20 [2019-08-05 11:06:07,481 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 11:06:07,527 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:07,580 INFO L341 Elim1Store]: treesize reduction 3, result has 93.2 percent of original size [2019-08-05 11:06:07,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 64 [2019-08-05 11:06:07,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:07,639 INFO L567 ElimStorePlain]: treesize reduction 27, result has 77.5 percent of original size [2019-08-05 11:06:07,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 32 [2019-08-05 11:06:07,645 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:07,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:07,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:07,667 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:106, output treesize:65 [2019-08-05 11:06:07,908 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 11:06:07,909 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:07,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 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:06:07,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:07,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:07,955 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:07,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 110 treesize of output 96 [2019-08-05 11:06:07,956 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:08,013 INFO L567 ElimStorePlain]: treesize reduction 68, result has 48.5 percent of original size [2019-08-05 11:06:08,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:08,014 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:121, output treesize:78 [2019-08-05 11:06:08,164 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:08,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:08,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:06:08,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:06:08,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:06:08,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:06:08,166 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 10 states. [2019-08-05 11:06:08,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:08,550 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-08-05 11:06:08,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:06:08,550 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 11:06:08,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:08,551 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:06:08,551 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:06:08,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:06:08,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:06:08,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:06:08,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:06:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-08-05 11:06:08,555 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 16 [2019-08-05 11:06:08,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:08,555 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-08-05 11:06:08,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:06:08,555 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-08-05 11:06:08,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:06:08,556 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:08,556 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1] [2019-08-05 11:06:08,556 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:08,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:08,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1096334355, now seen corresponding path program 5 times [2019-08-05 11:06:08,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:08,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 123 conjunts are in the unsatisfiable core [2019-08-05 11:06:08,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:09,209 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-08-05 11:06:09,209 INFO L341 Elim1Store]: treesize reduction 27, result has 65.8 percent of original size [2019-08-05 11:06:09,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 82 [2019-08-05 11:06:09,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:09,268 INFO L567 ElimStorePlain]: treesize reduction 17, result has 84.7 percent of original size [2019-08-05 11:06:09,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 24 [2019-08-05 11:06:09,275 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:09,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:09,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:09,296 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:102, output treesize:68 [2019-08-05 11:06:09,554 INFO L235 Elim1Store]: Index analysis took 163 ms [2019-08-05 11:06:09,927 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-08-05 11:06:09,927 INFO L341 Elim1Store]: treesize reduction 77, result has 70.5 percent of original size [2019-08-05 11:06:09,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 47 treesize of output 208 [2019-08-05 11:06:09,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:10,097 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-08-05 11:06:10,097 INFO L567 ElimStorePlain]: treesize reduction 83, result has 69.1 percent of original size [2019-08-05 11:06:10,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:10,253 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-08-05 11:06:10,253 INFO L341 Elim1Store]: treesize reduction 20, result has 87.6 percent of original size [2019-08-05 11:06:10,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 222 [2019-08-05 11:06:10,255 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:10,414 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2019-08-05 11:06:10,414 INFO L567 ElimStorePlain]: treesize reduction 191, result has 43.0 percent of original size [2019-08-05 11:06:10,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:10,416 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:154, output treesize:226 [2019-08-05 11:06:10,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:10,484 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:10,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:10,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 67 [2019-08-05 11:06:10,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:10,580 INFO L567 ElimStorePlain]: treesize reduction 74, result has 69.0 percent of original size [2019-08-05 11:06:10,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:10,582 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:252, output treesize:165 [2019-08-05 11:06:10,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:10,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:10,809 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:10,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:10,897 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:10,923 INFO L235 Elim1Store]: Index analysis took 232 ms [2019-08-05 11:06:11,450 WARN L188 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-08-05 11:06:11,450 INFO L341 Elim1Store]: treesize reduction 13, result has 94.6 percent of original size [2019-08-05 11:06:11,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 82 treesize of output 278 [2019-08-05 11:06:11,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:11,612 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-08-05 11:06:11,612 INFO L567 ElimStorePlain]: treesize reduction 211, result has 46.4 percent of original size [2019-08-05 11:06:11,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:11,618 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:11,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:11,621 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:11,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:11,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:11,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:11,626 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:11,627 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:06:11,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:11,733 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-08-05 11:06:11,733 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:11,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 4 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 33 case distinctions, treesize of input 160 treesize of output 207 [2019-08-05 11:06:11,735 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:11,736 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:11,736 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:11,737 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:11,737 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:11,737 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:11,738 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:11,739 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:11,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:11,741 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:11,741 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:11,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:11,743 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:11,744 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:11,744 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:11,745 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:11,745 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:11,746 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:11,747 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:11,748 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:11,749 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:11,749 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:11,750 INFO L496 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:11,987 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 40 [2019-08-05 11:06:11,988 INFO L567 ElimStorePlain]: treesize reduction 84, result has 44.7 percent of original size [2019-08-05 11:06:11,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:11,989 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:205, output treesize:50 [2019-08-05 11:06:12,047 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 6 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:12,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:12,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:06:12,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:06:12,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:06:12,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=67, Unknown=2, NotChecked=0, Total=90 [2019-08-05 11:06:12,048 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2019-08-05 11:06:18,170 WARN L193 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2019-08-05 11:06:18,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:06:18,172 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:207) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:224) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:899) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:696) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:625) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:467) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:204) ... 43 more [2019-08-05 11:06:18,176 INFO L168 Benchmark]: Toolchain (without parser) took 60404.15 ms. Allocated memory was 134.2 MB in the beginning and 415.8 MB in the end (delta: 281.5 MB). Free memory was 109.7 MB in the beginning and 192.4 MB in the end (delta: -82.7 MB). Peak memory consumption was 198.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:18,177 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 134.2 MB. Free memory was 111.8 MB in the beginning and 111.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 11:06:18,177 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.62 ms. Allocated memory is still 134.2 MB. Free memory was 109.7 MB in the beginning and 108.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:18,178 INFO L168 Benchmark]: Boogie Preprocessor took 57.52 ms. Allocated memory is still 134.2 MB. Free memory was 108.0 MB in the beginning and 106.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:18,178 INFO L168 Benchmark]: RCFGBuilder took 507.39 ms. Allocated memory is still 134.2 MB. Free memory was 106.2 MB in the beginning and 89.3 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:18,179 INFO L168 Benchmark]: TraceAbstraction took 59771.21 ms. Allocated memory was 134.2 MB in the beginning and 415.8 MB in the end (delta: 281.5 MB). Free memory was 89.0 MB in the beginning and 192.4 MB in the end (delta: -103.4 MB). Peak memory consumption was 178.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:18,183 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.22 ms. Allocated memory is still 134.2 MB. Free memory was 111.8 MB in the beginning and 111.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.62 ms. Allocated memory is still 134.2 MB. Free memory was 109.7 MB in the beginning and 108.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.52 ms. Allocated memory is still 134.2 MB. Free memory was 108.0 MB in the beginning and 106.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 507.39 ms. Allocated memory is still 134.2 MB. Free memory was 106.2 MB in the beginning and 89.3 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 59771.21 ms. Allocated memory was 134.2 MB in the beginning and 415.8 MB in the end (delta: 281.5 MB). Free memory was 89.0 MB in the beginning and 192.4 MB in the end (delta: -103.4 MB). Peak memory consumption was 178.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:207) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...