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_30.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:04:35,615 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:04:35,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:04:35,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:04:35,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:04:35,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:04:35,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:04:35,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:04:35,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:04:35,637 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:04:35,639 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:04:35,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:04:35,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:04:35,641 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:04:35,642 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:04:35,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:04:35,647 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:04:35,648 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:04:35,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:04:35,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:04:35,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:04:35,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:04:35,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:04:35,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:04:35,677 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:04:35,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:04:35,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:04:35,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:04:35,679 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:04:35,679 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:04:35,680 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:04:35,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:04:35,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:04:35,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:04:35,688 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:04:35,688 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:04:35,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:04:35,689 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:04:35,690 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:04:35,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:04:35,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:04:35,728 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:04:35,745 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:04:35,749 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:04:35,751 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:04:35,752 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:04:35,754 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_30.bpl [2019-08-05 11:04:35,754 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/dll_extends_pointer_true-valid-memsafety.i_30.bpl' [2019-08-05 11:04:35,828 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:04:35,830 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:04:35,831 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:04:35,831 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:04:35,831 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:04:35,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "dll_extends_pointer_true-valid-memsafety.i_30.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:35" (1/1) ... [2019-08-05 11:04:35,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "dll_extends_pointer_true-valid-memsafety.i_30.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:35" (1/1) ... [2019-08-05 11:04:35,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:04:35,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:04:35,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:04:35,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:04:35,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "dll_extends_pointer_true-valid-memsafety.i_30.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:35" (1/1) ... [2019-08-05 11:04:35,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "dll_extends_pointer_true-valid-memsafety.i_30.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:35" (1/1) ... [2019-08-05 11:04:35,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "dll_extends_pointer_true-valid-memsafety.i_30.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:35" (1/1) ... [2019-08-05 11:04:35,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "dll_extends_pointer_true-valid-memsafety.i_30.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:35" (1/1) ... [2019-08-05 11:04:35,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "dll_extends_pointer_true-valid-memsafety.i_30.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:35" (1/1) ... [2019-08-05 11:04:35,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "dll_extends_pointer_true-valid-memsafety.i_30.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:35" (1/1) ... [2019-08-05 11:04:35,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "dll_extends_pointer_true-valid-memsafety.i_30.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:35" (1/1) ... [2019-08-05 11:04:35,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:04:35,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:04:35,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:04:35,951 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:04:35,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "dll_extends_pointer_true-valid-memsafety.i_30.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:35" (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:04:36,023 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:04:36,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:04:36,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:04:36,378 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:04:36,378 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:04:36,380 INFO L202 PluginConnector]: Adding new model dll_extends_pointer_true-valid-memsafety.i_30.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:04:36 BoogieIcfgContainer [2019-08-05 11:04:36,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:04:36,382 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:04:36,382 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:04:36,385 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:04:36,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "dll_extends_pointer_true-valid-memsafety.i_30.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:35" (1/2) ... [2019-08-05 11:04:36,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5cdb8d and model type dll_extends_pointer_true-valid-memsafety.i_30.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:04:36, skipping insertion in model container [2019-08-05 11:04:36,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "dll_extends_pointer_true-valid-memsafety.i_30.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:04:36" (2/2) ... [2019-08-05 11:04:36,389 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer_true-valid-memsafety.i_30.bpl [2019-08-05 11:04:36,400 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:04:36,409 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:04:36,429 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:04:36,458 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:04:36,459 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:04:36,459 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:04:36,459 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:04:36,460 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:04:36,460 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:04:36,460 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:04:36,460 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:04:36,461 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:04:36,475 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 11:04:36,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:04:36,484 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:36,486 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:04:36,488 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:36,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:36,495 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2019-08-05 11:04:36,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:36,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:04:36,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:36,761 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:04:36,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:36,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:36,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:36,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:04:36,915 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:04:36,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:04:36,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:04:36,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:04:36,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:04:36,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:04:36,935 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2019-08-05 11:04:37,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:37,125 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 11:04:37,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:04:37,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 11:04:37,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:37,138 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:04:37,138 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:04:37,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:04:37,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:04:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:04:37,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:04:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 11:04:37,202 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-08-05 11:04:37,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:37,203 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 11:04:37,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:04:37,203 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 11:04:37,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:04:37,204 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:37,204 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:04:37,206 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:37,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:37,207 INFO L82 PathProgramCache]: Analyzing trace with hash 149049733, now seen corresponding path program 1 times [2019-08-05 11:04:37,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:37,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:04:37,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:37,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:37,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:37,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:37,411 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 19 treesize of output 24 [2019-08-05 11:04:37,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:37,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:37,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:37,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:37,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:37,575 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 19 treesize of output 24 [2019-08-05 11:04:37,577 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:37,688 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-08-05 11:04:37,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:37,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:37,693 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:50, output treesize:39 [2019-08-05 11:04:37,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:37,977 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:37,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-08-05 11:04:37,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:38,088 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:38,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:38,150 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:38,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 13 [2019-08-05 11:04:38,151 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,254 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 11:04:38,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:38,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,258 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:59, output treesize:7 [2019-08-05 11:04:38,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:38,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:38,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:04:38,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:04:38,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:04:38,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:04:38,303 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-08-05 11:04:38,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:38,568 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-08-05 11:04:38,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:04:38,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 11:04:38,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:38,570 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:04:38,570 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:04:38,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:04:38,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:04:38,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:04:38,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:04:38,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 11:04:38,574 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-08-05 11:04:38,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:38,574 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 11:04:38,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:04:38,575 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 11:04:38,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:04:38,575 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:38,575 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:04:38,576 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:38,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:38,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2019-08-05 11:04:38,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:38,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:04:38,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:38,818 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:04:38,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:38,868 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:04:38,868 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:38,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,885 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2019-08-05 11:04:38,984 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:38,984 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:04:38,986 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:39,115 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-08-05 11:04:39,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:39,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:04:39,169 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:39,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:39,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:39,284 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 59 treesize of output 22 [2019-08-05 11:04:39,285 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:39,539 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-08-05 11:04:39,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:39,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:39,551 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 59 treesize of output 22 [2019-08-05 11:04:39,551 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:39,663 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-08-05 11:04:39,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:39,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:39,666 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:151, output treesize:53 [2019-08-05 11:04:39,808 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:39,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:39,813 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:39,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 26 [2019-08-05 11:04:39,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:39,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:39,845 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:39,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-08-05 11:04:39,848 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:39,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:39,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:39,864 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:73, output treesize:9 [2019-08-05 11:04:39,966 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:04:39,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:39,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:04:39,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:04:39,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:04:39,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:04:39,971 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 7 states. [2019-08-05 11:04:40,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:40,176 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 11:04:40,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:04:40,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 11:04:40,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:40,178 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:04:40,178 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:04:40,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:04:40,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:04:40,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:04:40,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:04:40,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 11:04:40,181 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-08-05 11:04:40,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:40,182 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 11:04:40,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:04:40,182 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 11:04:40,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:04:40,183 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:40,183 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:04:40,183 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:40,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:40,184 INFO L82 PathProgramCache]: Analyzing trace with hash 2135429881, now seen corresponding path program 2 times [2019-08-05 11:04:40,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:40,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:04:40,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:40,375 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:04:40,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:40,515 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-08-05 11:04:40,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:40,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:40,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:40,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:40,545 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 19 treesize of output 24 [2019-08-05 11:04:40,545 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:40,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:40,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:40,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:40,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:40,591 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 19 treesize of output 24 [2019-08-05 11:04:40,591 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:40,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:40,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:40,664 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:59, output treesize:47 [2019-08-05 11:04:40,818 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:40,818 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:04:40,819 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:40,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:40,970 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-08-05 11:04:40,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:40,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:40,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:40,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:41,015 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:41,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 72 [2019-08-05 11:04:41,017 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:41,135 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-08-05 11:04:41,135 INFO L567 ElimStorePlain]: treesize reduction 18, result has 89.3 percent of original size [2019-08-05 11:04:41,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:41,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:41,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:41,167 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:41,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 72 [2019-08-05 11:04:41,169 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:41,329 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-08-05 11:04:41,330 INFO L567 ElimStorePlain]: treesize reduction 18, result has 86.9 percent of original size [2019-08-05 11:04:41,333 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:41,334 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:41,336 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:04:41,336 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:189, output treesize:134 [2019-08-05 11:04:41,337 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:41,338 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:41,353 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:41,354 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:41,438 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:41,439 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:41,468 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:41,469 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:41,647 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,024 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,138 INFO L392 ElimStorePlain]: Different costs {72=[|#memory_$Pointer$.offset|], 110=[|#memory_$Pointer$.base|]} [2019-08-05 11:04:42,145 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:42,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:42,149 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:42,156 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:42,175 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:42,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 119 [2019-08-05 11:04:42,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,178 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,179 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,180 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,180 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,181 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,182 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:42,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:42,205 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:42,220 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:42,221 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 109 [2019-08-05 11:04:42,222 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,222 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,223 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,224 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,225 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,225 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,226 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,228 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,228 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,229 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,230 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,231 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,231 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,232 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,233 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:04:42,418 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-08-05 11:04:42,419 INFO L567 ElimStorePlain]: treesize reduction 47, result has 77.2 percent of original size [2019-08-05 11:04:42,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:42,426 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:42,427 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:42,427 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:42,461 INFO L341 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2019-08-05 11:04:42,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 74 [2019-08-05 11:04:42,463 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,464 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,464 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:42,512 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:42,527 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:42,537 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:42,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:42,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:42,799 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-08-05 11:04:42,799 INFO L341 Elim1Store]: treesize reduction 16, result has 71.4 percent of original size [2019-08-05 11:04:42,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 87 treesize of output 92 [2019-08-05 11:04:42,801 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,802 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,803 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:42,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:42,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:42,855 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:272, output treesize:7 [2019-08-05 11:04:42,878 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:42,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:42,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:04:42,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:04:42,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:04:42,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=42, Unknown=1, NotChecked=0, Total=56 [2019-08-05 11:04:42,880 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 8 states. [2019-08-05 11:04:46,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:46,654 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-08-05 11:04:46,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:04:46,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-08-05 11:04:46,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:46,656 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:04:46,656 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:04:46,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=68, Unknown=1, NotChecked=0, Total=90 [2019-08-05 11:04:46,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:04:46,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:04:46,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:04:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 11:04:46,659 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-08-05 11:04:46,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:46,660 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 11:04:46,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:04:46,660 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 11:04:46,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:04:46,661 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:46,661 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 11:04:46,661 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:46,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:46,661 INFO L82 PathProgramCache]: Analyzing trace with hash 87273139, now seen corresponding path program 3 times [2019-08-05 11:04:46,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:46,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 11:04:46,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:46,881 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:04:46,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:46,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:46,917 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:04:46,917 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:46,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:46,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:46,934 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2019-08-05 11:04:47,069 INFO L392 ElimStorePlain]: Different costs {1=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 3=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:04:47,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:47,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:04:47,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:47,326 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-08-05 11:04:47,326 INFO L567 ElimStorePlain]: treesize reduction 5, result has 97.2 percent of original size [2019-08-05 11:04:47,349 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:47,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-08-05 11:04:47,350 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:47,493 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-08-05 11:04:47,493 INFO L567 ElimStorePlain]: treesize reduction 14, result has 92.4 percent of original size [2019-08-05 11:04:47,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:47,502 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:04:47,503 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:47,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:47,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:47,556 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:47,558 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:04:47,559 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:47,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:47,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:47,601 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:179, output treesize:89 [2019-08-05 11:04:47,635 INFO L392 ElimStorePlain]: Different costs {1=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 3=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:04:47,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:47,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-08-05 11:04:47,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:47,816 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-08-05 11:04:47,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:47,844 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:47,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-08-05 11:04:47,846 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:47,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:47,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:47,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:47,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:47,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:48,033 INFO L341 Elim1Store]: treesize reduction 15, result has 87.1 percent of original size [2019-08-05 11:04:48,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 163 [2019-08-05 11:04:48,036 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:48,231 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-08-05 11:04:48,231 INFO L567 ElimStorePlain]: treesize reduction 111, result has 63.0 percent of original size [2019-08-05 11:04:48,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:48,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:48,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 69 [2019-08-05 11:04:48,259 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:48,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:48,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:48,331 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:237, output treesize:179 [2019-08-05 11:04:48,553 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-08-05 11:04:48,923 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-08-05 11:04:48,927 INFO L392 ElimStorePlain]: Different costs {20=[|#memory_$Pointer$.offset|], 30=[|#memory_$Pointer$.base|]} [2019-08-05 11:04:48,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:48,962 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:48,963 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:48,970 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:48,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 71 [2019-08-05 11:04:48,972 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:48,972 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:48,973 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:49,072 INFO L567 ElimStorePlain]: treesize reduction 8, result has 93.6 percent of original size [2019-08-05 11:04:49,080 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:49,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:49,083 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:49,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:49,087 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:04:49,162 INFO L341 Elim1Store]: treesize reduction 16, result has 72.4 percent of original size [2019-08-05 11:04:49,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 85 treesize of output 73 [2019-08-05 11:04:49,163 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:49,164 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:49,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:49,165 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:49,166 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:04:49,254 INFO L567 ElimStorePlain]: treesize reduction 18, result has 73.5 percent of original size [2019-08-05 11:04:49,255 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:49,256 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:202, output treesize:12 [2019-08-05 11:04:49,324 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:49,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:49,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:04:49,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:04:49,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:04:49,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:04:49,325 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 10 states. [2019-08-05 11:05:10,667 WARN L193 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2019-08-05 11:05:10,668 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) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:122) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:137) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:660) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:264) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:279) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:712) 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: java.io.IOException: Broken pipe at java.io.FileOutputStream.writeBytes(Native Method) at java.io.FileOutputStream.write(FileOutputStream.java:326) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:119) ... 28 more [2019-08-05 11:05:10,673 INFO L168 Benchmark]: Toolchain (without parser) took 34843.41 ms. Allocated memory was 140.5 MB in the beginning and 289.4 MB in the end (delta: 148.9 MB). Free memory was 109.2 MB in the beginning and 163.4 MB in the end (delta: -54.1 MB). Peak memory consumption was 94.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:05:10,674 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.30 ms. Allocated memory is still 140.5 MB. Free memory is still 110.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:05:10,674 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.44 ms. Allocated memory is still 140.5 MB. Free memory was 109.2 MB in the beginning and 107.5 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:05:10,675 INFO L168 Benchmark]: Boogie Preprocessor took 51.08 ms. Allocated memory is still 140.5 MB. Free memory was 107.5 MB in the beginning and 105.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:05:10,676 INFO L168 Benchmark]: RCFGBuilder took 430.41 ms. Allocated memory is still 140.5 MB. Free memory was 105.7 MB in the beginning and 89.9 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:05:10,676 INFO L168 Benchmark]: TraceAbstraction took 34289.50 ms. Allocated memory was 140.5 MB in the beginning and 289.4 MB in the end (delta: 148.9 MB). Free memory was 89.5 MB in the beginning and 163.4 MB in the end (delta: -73.9 MB). Peak memory consumption was 75.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:05:10,680 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.30 ms. Allocated memory is still 140.5 MB. Free memory is still 110.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.44 ms. Allocated memory is still 140.5 MB. Free memory was 109.2 MB in the beginning and 107.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.08 ms. Allocated memory is still 140.5 MB. Free memory was 107.5 MB in the beginning and 105.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 430.41 ms. Allocated memory is still 140.5 MB. Free memory was 105.7 MB in the beginning and 89.9 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34289.50 ms. Allocated memory was 140.5 MB in the beginning and 289.4 MB in the end (delta: 148.9 MB). Free memory was 89.5 MB in the beginning and 163.4 MB in the end (delta: -73.9 MB). Peak memory consumption was 75.0 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) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:122) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...