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/ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:04:32,706 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:04:32,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:04:32,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:04:32,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:04:32,721 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:04:32,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:04:32,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:04:32,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:04:32,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:04:32,729 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:04:32,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:04:32,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:04:32,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:04:32,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:04:32,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:04:32,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:04:32,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:04:32,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:04:32,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:04:32,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:04:32,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:04:32,743 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:04:32,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:04:32,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:04:32,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:04:32,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:04:32,748 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:04:32,749 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:04:32,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:04:32,751 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:04:32,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:04:32,752 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:04:32,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:04:32,755 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:04:32,755 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:04:32,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:04:32,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:04:32,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:04:32,757 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:04:32,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:04:32,787 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:04:32,800 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:04:32,804 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:04:32,806 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:04:32,807 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:04:32,808 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl [2019-08-05 11:04:32,808 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl' [2019-08-05 11:04:32,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:04:32,880 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:04:32,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:04:32,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:04:32,881 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:04:32,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:32" (1/1) ... [2019-08-05 11:04:32,915 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:32" (1/1) ... [2019-08-05 11:04:32,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:04:32,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:04:32,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:04:32,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:04:32,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:32" (1/1) ... [2019-08-05 11:04:32,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:32" (1/1) ... [2019-08-05 11:04:32,942 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:32" (1/1) ... [2019-08-05 11:04:32,942 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:32" (1/1) ... [2019-08-05 11:04:32,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:32" (1/1) ... [2019-08-05 11:04:32,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:32" (1/1) ... [2019-08-05 11:04:32,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:32" (1/1) ... [2019-08-05 11:04:32,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:04:32,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:04:32,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:04:32,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:04:32,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:32" (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:33,052 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:04:33,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:04:33,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:04:33,400 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:04:33,401 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:04:33,402 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:04:33 BoogieIcfgContainer [2019-08-05 11:04:33,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:04:33,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:04:33,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:04:33,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:04:33,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:32" (1/2) ... [2019-08-05 11:04:33,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c5640e and model type ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:04:33, skipping insertion in model container [2019-08-05 11:04:33,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:04:33" (2/2) ... [2019-08-05 11:04:33,410 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl [2019-08-05 11:04:33,420 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:04:33,428 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:04:33,444 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:04:33,470 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:04:33,471 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:04:33,471 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:04:33,471 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:04:33,471 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:04:33,472 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:04:33,472 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:04:33,472 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:04:33,472 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:04:33,486 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 11:04:33,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:04:33,495 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:33,496 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:04:33,498 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:33,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:33,504 INFO L82 PathProgramCache]: Analyzing trace with hash 889573358, now seen corresponding path program 1 times [2019-08-05 11:04:33,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:33,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:04:33,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:33,777 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:33,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:33,910 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 11:04:33,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:33,929 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:33,930 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:34,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:34,011 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:34,012 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2019-08-05 11:04:34,095 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:34,096 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:34,098 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:34,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:34,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:34,161 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:34,162 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:34,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:34,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:34,217 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-08-05 11:04:34,318 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:34,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:04:34,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:04:34,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:04:34,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:04:34,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:04:34,344 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 5 states. [2019-08-05 11:04:34,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:34,729 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-08-05 11:04:34,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:04:34,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:04:34,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:34,742 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:04:34,742 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:04:34,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:04:34,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:04:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-08-05 11:04:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:04:34,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-08-05 11:04:34,777 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 6 [2019-08-05 11:04:34,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:34,777 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-08-05 11:04:34,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:04:34,778 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2019-08-05 11:04:34,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:04:34,778 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:34,778 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:04:34,779 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:34,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:34,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1630061887, now seen corresponding path program 1 times [2019-08-05 11:04:34,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:34,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:04:34,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:34,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:34,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:04:34,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:04:34,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:04:34,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:04:34,984 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand 6 states. [2019-08-05 11:04:35,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:35,264 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2019-08-05 11:04:35,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:04:35,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 11:04:35,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:35,271 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:04:35,272 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:04:35,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:04:35,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:04:35,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-08-05 11:04:35,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:04:35,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-08-05 11:04:35,276 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 10 [2019-08-05 11:04:35,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:35,276 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-08-05 11:04:35,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:04:35,277 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-08-05 11:04:35,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:04:35,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:35,278 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:04:35,278 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:35,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:35,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1007742771, now seen corresponding path program 1 times [2019-08-05 11:04:35,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:35,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:04:35,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:35,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:04:35,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:35,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:04:35,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:04:35,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:04:35,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:04:35,445 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 5 states. [2019-08-05 11:04:35,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:35,739 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2019-08-05 11:04:35,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:04:35,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-08-05 11:04:35,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:35,742 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:04:35,742 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:04:35,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:04:35,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:04:35,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:04:35,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:04:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-08-05 11:04:35,746 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 11 [2019-08-05 11:04:35,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:35,746 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-08-05 11:04:35,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:04:35,747 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2019-08-05 11:04:35,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:04:35,747 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:35,748 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:04:35,748 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:35,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:35,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1224255158, now seen corresponding path program 1 times [2019-08-05 11:04:35,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:35,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:04:35,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:35,925 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:35,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:35,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:35,977 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:35,977 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:35,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:35,994 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:35,994 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2019-08-05 11:04:36,037 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:36,038 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:36,039 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:36,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:36,081 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:36,082 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:36,219 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 11:04:36,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:36,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:36,220 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-08-05 11:04:36,486 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:36,487 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:36,488 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:36,628 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 11:04:36,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:36,637 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:36,637 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:36,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:36,659 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:36,660 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:15 [2019-08-05 11:04:36,750 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:04:36,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:36,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:04:36,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:04:36,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:04:36,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:04:36,752 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand 9 states. [2019-08-05 11:04:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:36,924 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2019-08-05 11:04:36,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:04:36,924 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-08-05 11:04:36,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:36,926 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:04:36,926 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:04:36,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:04:36,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:04:36,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-08-05 11:04:36,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:04:36,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-08-05 11:04:36,931 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 12 [2019-08-05 11:04:36,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:36,931 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-08-05 11:04:36,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:04:36,932 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2019-08-05 11:04:36,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:04:36,932 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:36,933 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1] [2019-08-05 11:04:36,933 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:36,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:36,933 INFO L82 PathProgramCache]: Analyzing trace with hash -388937858, now seen corresponding path program 2 times [2019-08-05 11:04:36,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:37,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:04:37,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:37,117 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 11:04:37,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:37,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:04:37,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:04:37,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:04:37,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:04:37,120 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 7 states. [2019-08-05 11:04:37,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:37,330 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2019-08-05 11:04:37,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:04:37,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-05 11:04:37,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:37,332 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:04:37,333 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:04:37,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:04:37,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:04:37,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2019-08-05 11:04:37,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:04:37,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-08-05 11:04:37,339 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 18 [2019-08-05 11:04:37,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:37,339 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-08-05 11:04:37,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:04:37,339 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2019-08-05 11:04:37,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:04:37,340 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:37,340 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1] [2019-08-05 11:04:37,340 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:37,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:37,341 INFO L82 PathProgramCache]: Analyzing trace with hash 876828619, now seen corresponding path program 3 times [2019-08-05 11:04:37,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:37,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:04:37,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 11:04:37,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:37,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:04:37,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:04:37,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:04:37,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:04:37,621 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 8 states. [2019-08-05 11:04:37,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:37,865 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-08-05 11:04:37,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:04:37,866 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-08-05 11:04:37,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:37,867 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:04:37,868 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:04:37,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:04:37,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:04:37,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-08-05 11:04:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:04:37,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2019-08-05 11:04:37,873 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 19 [2019-08-05 11:04:37,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:37,873 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-08-05 11:04:37,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:04:37,873 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2019-08-05 11:04:37,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:04:37,874 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:37,874 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1] [2019-08-05 11:04:37,874 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:37,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:37,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1411937129, now seen corresponding path program 4 times [2019-08-05 11:04:37,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:37,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:04:37,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:38,023 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,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:38,064 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,064 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:38,075 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,076 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2019-08-05 11:04:38,100 INFO L392 ElimStorePlain]: Different costs {1=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 3=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:04:38,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:38,114 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:38,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:38,164 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:38,165 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:38,166 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,167 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,202 INFO L567 ElimStorePlain]: treesize reduction 14, result has 66.7 percent of original size [2019-08-05 11:04:38,203 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,203 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2019-08-05 11:04:38,250 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 0 case distinctions, treesize of input 17 treesize of output 17 [2019-08-05 11:04:38,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,277 INFO L567 ElimStorePlain]: treesize reduction 4, result has 82.6 percent of original size [2019-08-05 11:04:38,277 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:04:38,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:19 [2019-08-05 11:04:38,346 INFO L392 ElimStorePlain]: Different costs {1=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 3=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:04:38,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:38,373 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:38,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:38,422 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:38,422 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 16 treesize of output 34 [2019-08-05 11:04:38,423 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,424 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,425 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:38,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,443 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:33, output treesize:12 [2019-08-05 11:04:38,547 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:38,548 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,549 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:38,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:38,652 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:38,652 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:38,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,678 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:18 [2019-08-05 11:04:39,202 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:04:39,224 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:04:39,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:39,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:04:39,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:04:39,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:04:39,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:04:39,226 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 14 states. [2019-08-05 11:04:40,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:40,573 INFO L93 Difference]: Finished difference Result 60 states and 83 transitions. [2019-08-05 11:04:40,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:04:40,574 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2019-08-05 11:04:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:40,576 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:04:40,576 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:04:40,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=280, Invalid=712, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:04:40,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:04:40,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 30. [2019-08-05 11:04:40,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:04:40,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2019-08-05 11:04:40,582 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 20 [2019-08-05 11:04:40,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:40,582 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-08-05 11:04:40,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:04:40,582 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2019-08-05 11:04:40,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:04:40,583 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:40,583 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1] [2019-08-05 11:04:40,584 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:40,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:40,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1957190538, now seen corresponding path program 5 times [2019-08-05 11:04:40,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:40,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:04:40,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:41,174 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 11:04:41,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:41,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:04:41,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:04:41,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:04:41,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:04:41,176 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand 9 states. [2019-08-05 11:04:41,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:41,446 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2019-08-05 11:04:41,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:04:41,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-08-05 11:04:41,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:41,448 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:04:41,448 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:04:41,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:04:41,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:04:41,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 39. [2019-08-05 11:04:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:04:41,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2019-08-05 11:04:41,455 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 21 [2019-08-05 11:04:41,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:41,456 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-08-05 11:04:41,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:04:41,456 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2019-08-05 11:04:41,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:04:41,457 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:41,457 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1] [2019-08-05 11:04:41,458 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:41,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:41,458 INFO L82 PathProgramCache]: Analyzing trace with hash -543310818, now seen corresponding path program 6 times [2019-08-05 11:04:41,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:41,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:04:41,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-08-05 11:04:41,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:41,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:04:41,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:04:41,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:04:41,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:04:41,826 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand 8 states. [2019-08-05 11:04:42,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:42,132 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2019-08-05 11:04:42,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:04:42,132 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-08-05 11:04:42,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:42,133 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:04:42,133 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:04:42,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:04:42,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:04:42,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2019-08-05 11:04:42,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:04:42,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2019-08-05 11:04:42,140 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 22 [2019-08-05 11:04:42,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:42,141 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2019-08-05 11:04:42,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:04:42,141 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2019-08-05 11:04:42,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:04:42,142 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:42,142 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 1, 1, 1] [2019-08-05 11:04:42,142 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:42,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:42,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1449624849, now seen corresponding path program 7 times [2019-08-05 11:04:42,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:42,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:04:42,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:42,348 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:42,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:42,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:42,406 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:42,406 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:42,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:42,417 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:42,417 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2019-08-05 11:04:42,451 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:42,451 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:42,452 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:42,574 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 11:04:42,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:42,602 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:42,603 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:42,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:42,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:42,631 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2019-08-05 11:04:42,684 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:42,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-08-05 11:04:42,685 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:42,712 INFO L567 ElimStorePlain]: treesize reduction 10, result has 72.2 percent of original size [2019-08-05 11:04:42,714 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:42,717 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:23 [2019-08-05 11:04:42,717 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,740 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,755 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,770 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,785 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,856 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:42,973 INFO L392 ElimStorePlain]: Different costs {1=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|], 3=[|ULTIMATE.start_#Ultimate.alloc_old_#length|]} [2019-08-05 11:04:43,019 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:43,019 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:43,020 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:43,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:43,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:43,051 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:43,052 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 29 treesize of output 54 [2019-08-05 11:04:43,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:43,053 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:43,054 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:43,130 INFO L567 ElimStorePlain]: treesize reduction 36, result has 53.8 percent of original size [2019-08-05 11:04:43,132 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:43,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:43,134 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:45, output treesize:9 [2019-08-05 11:04:43,176 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:43,176 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:43,177 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:43,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:43,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:43,255 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:43,256 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:43,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:43,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:43,269 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:15 [2019-08-05 11:04:43,405 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 35 proven. 47 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-08-05 11:04:43,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:43,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:04:43,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:04:43,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:04:43,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:04:43,407 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand 14 states. [2019-08-05 11:04:57,529 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-08-05 11:05:10,216 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-08-05 11:05:15,612 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-08-05 11:05:16,026 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-08-05 11:05:17,408 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-08-05 11:05:31,508 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-08-05 11:05:34,656 WARN L188 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-08-05 11:05:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:34,714 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2019-08-05 11:05:34,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:05:34,715 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-08-05 11:05:34,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:34,716 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:05:34,717 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:05:34,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=251, Invalid=679, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:05:34,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:05:34,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 43. [2019-08-05 11:05:34,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:05:34,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2019-08-05 11:05:34,722 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 30 [2019-08-05 11:05:34,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:34,723 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-08-05 11:05:34,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:05:34,723 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2019-08-05 11:05:34,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:05:34,724 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:34,724 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 4, 3, 1, 1, 1] [2019-08-05 11:05:34,724 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:34,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:34,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1781805912, now seen corresponding path program 8 times [2019-08-05 11:05:34,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:34,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:05:34,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:34,916 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 43 proven. 55 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-08-05 11:05:34,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:34,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:05:34,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:05:34,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:05:34,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:05:34,918 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand 10 states. [2019-08-05 11:05:35,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:35,389 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2019-08-05 11:05:35,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:05:35,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-08-05 11:05:35,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:35,390 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:05:35,390 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:05:35,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:05:35,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:05:35,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-08-05 11:05:35,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:05:35,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2019-08-05 11:05:35,396 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 31 [2019-08-05 11:05:35,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:35,396 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2019-08-05 11:05:35,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:05:35,397 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2019-08-05 11:05:35,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:05:35,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:35,398 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 4, 1, 1, 1] [2019-08-05 11:05:35,398 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:35,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:35,399 INFO L82 PathProgramCache]: Analyzing trace with hash -945697851, now seen corresponding path program 9 times [2019-08-05 11:05:35,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:35,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:05:35,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 127 proven. 22 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-08-05 11:05:36,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:36,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:05:36,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:05:36,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:05:36,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:05:36,453 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand 9 states. [2019-08-05 11:05:36,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:36,663 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2019-08-05 11:05:36,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:05:36,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2019-08-05 11:05:36,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:36,665 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:05:36,665 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:05:36,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:05:36,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:05:36,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 11:05:36,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:05:36,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-08-05 11:05:36,672 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 39 [2019-08-05 11:05:36,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:36,672 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-08-05 11:05:36,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:05:36,672 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2019-08-05 11:05:36,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:05:36,675 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:36,675 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 5, 5, 5, 4, 1, 1, 1] [2019-08-05 11:05:36,675 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:36,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:36,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1289418576, now seen corresponding path program 10 times [2019-08-05 11:05:36,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:36,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:05:36,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:36,936 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 116 proven. 45 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 11:05:36,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:36,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:05:36,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:05:36,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:05:36,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:05:36,939 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 12 states. [2019-08-05 11:05:37,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:37,513 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2019-08-05 11:05:37,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:05:37,514 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2019-08-05 11:05:37,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:37,515 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:05:37,515 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:05:37,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:05:37,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:05:37,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2019-08-05 11:05:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:05:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2019-08-05 11:05:37,519 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 41 [2019-08-05 11:05:37,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:37,520 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2019-08-05 11:05:37,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:05:37,520 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2019-08-05 11:05:37,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:05:37,521 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:37,521 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 4, 1, 1, 1] [2019-08-05 11:05:37,521 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:37,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:37,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1317216476, now seen corresponding path program 11 times [2019-08-05 11:05:37,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:37,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 11:05:37,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:38,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:38,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:38,164 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 11:05:38,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:38,194 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:38,194 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:38,316 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-08-05 11:05:38,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:38,316 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:05:38,317 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2019-08-05 11:05:38,402 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:38,403 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:38,404 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:38,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:38,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:38,419 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:05:38,420 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:38,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:38,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:38,426 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2019-08-05 11:05:38,453 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:38,454 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:38,454 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:38,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:38,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:38,473 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:05:38,474 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:38,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:38,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:38,513 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2019-08-05 11:05:38,532 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:38,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-08-05 11:05:38,534 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:38,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:38,580 INFO L567 ElimStorePlain]: treesize reduction 10, result has 74.4 percent of original size [2019-08-05 11:05:38,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:38,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:26 [2019-08-05 11:05:38,671 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:38,794 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:38,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2019-08-05 11:05:38,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:38,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-08-05 11:05:38,823 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:38,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:38,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-08-05 11:05:38,862 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:70, output treesize:60 [2019-08-05 11:05:38,904 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:39,011 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:39,012 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 3 case distinctions, treesize of input 29 treesize of output 68 [2019-08-05 11:05:39,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:39,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:39,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:39,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:39,015 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:39,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:39,099 INFO L567 ElimStorePlain]: treesize reduction 102, result has 36.6 percent of original size [2019-08-05 11:05:39,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:39,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:39,102 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:39,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:39,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:46, output treesize:55 [2019-08-05 11:05:39,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:39,104 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:39,105 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:40,607 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:40,608 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:40,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:50,018 WARN L188 SmtUtils]: Spent 9.25 s on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-08-05 11:05:51,153 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:51,181 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:51,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 59 [2019-08-05 11:05:51,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:51,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2019-08-05 11:05:51,188 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:51,296 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-08-05 11:05:51,297 INFO L567 ElimStorePlain]: treesize reduction 10, result has 88.8 percent of original size [2019-08-05 11:05:51,298 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:51,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-08-05 11:05:51,300 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:82, output treesize:79 [2019-08-05 11:05:51,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:51,358 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:51,360 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:51,363 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:51,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:51,462 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:51,462 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 16 treesize of output 26 [2019-08-05 11:05:51,463 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:51,464 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:51,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:51,730 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-08-05 11:05:51,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:52,021 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:05:52,021 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:52,022 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 29 treesize of output 54 [2019-08-05 11:05:52,023 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:52,025 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:52,026 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:52,785 WARN L188 SmtUtils]: Spent 758.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-08-05 11:05:52,785 INFO L567 ElimStorePlain]: treesize reduction 35, result has 59.3 percent of original size [2019-08-05 11:05:52,786 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:52,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:52,788 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:59, output treesize:18 [2019-08-05 11:05:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 54 proven. 147 refuted. 2 times theorem prover too weak. 27 trivial. 0 not checked. [2019-08-05 11:05:53,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:53,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:05:53,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:05:53,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:05:53,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=358, Unknown=2, NotChecked=0, Total=420 [2019-08-05 11:05:53,139 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 21 states. [2019-08-05 11:06:05,475 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2019-08-05 11:06:05,736 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-08-05 11:06:05,941 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-08-05 11:06:06,728 WARN L188 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2019-08-05 11:06:07,436 WARN L188 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2019-08-05 11:06:08,754 WARN L188 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-08-05 11:06:11,406 WARN L188 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-08-05 11:06:12,072 WARN L188 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2019-08-05 11:06:13,157 WARN L188 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-08-05 11:06:14,134 WARN L188 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 39 [2019-08-05 11:06:22,487 WARN L188 SmtUtils]: Spent 8.14 s on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2019-08-05 11:06:24,071 WARN L188 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-08-05 11:06:25,430 WARN L188 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2019-08-05 11:06:25,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:25,491 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2019-08-05 11:06:25,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:06:25,491 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2019-08-05 11:06:25,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:25,492 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:06:25,492 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:06:25,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=259, Invalid=1070, Unknown=3, NotChecked=0, Total=1332 [2019-08-05 11:06:25,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:06:25,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2019-08-05 11:06:25,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:06:25,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2019-08-05 11:06:25,496 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 42 [2019-08-05 11:06:25,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:25,497 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2019-08-05 11:06:25,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:06:25,497 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2019-08-05 11:06:25,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:06:25,498 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:25,498 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 5, 5, 5, 4, 1, 1, 1] [2019-08-05 11:06:25,499 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:25,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:25,499 INFO L82 PathProgramCache]: Analyzing trace with hash -4316837, now seen corresponding path program 12 times [2019-08-05 11:06:25,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:25,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:06:25,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:26,189 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 124 proven. 15 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-08-05 11:06:26,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:26,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:06:26,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:06:26,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:06:26,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:06:26,191 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand 13 states. [2019-08-05 11:06:26,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:26,675 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2019-08-05 11:06:26,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:06:26,676 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2019-08-05 11:06:26,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:26,677 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:06:26,677 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:06:26,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:06:26,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:06:26,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2019-08-05 11:06:26,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:06:26,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2019-08-05 11:06:26,682 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 43 [2019-08-05 11:06:26,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:26,682 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2019-08-05 11:06:26,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:06:26,683 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2019-08-05 11:06:26,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:06:26,684 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:26,684 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 5, 5, 5, 4, 1, 1, 1] [2019-08-05 11:06:26,684 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:26,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:26,684 INFO L82 PathProgramCache]: Analyzing trace with hash -133768231, now seen corresponding path program 13 times [2019-08-05 11:06:26,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:26,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:06:26,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-08-05 11:06:26,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:26,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:06:26,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:06:26,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:06:26,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:06:26,966 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 13 states. [2019-08-05 11:06:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:27,358 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2019-08-05 11:06:27,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:06:27,358 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-08-05 11:06:27,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:27,359 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:06:27,360 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:06:27,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:06:27,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:06:27,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2019-08-05 11:06:27,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:06:27,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2019-08-05 11:06:27,365 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 44 [2019-08-05 11:06:27,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:27,365 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2019-08-05 11:06:27,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:06:27,365 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2019-08-05 11:06:27,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 11:06:27,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:27,366 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 6, 6, 6, 5, 1, 1, 1] [2019-08-05 11:06:27,367 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:27,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:27,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1728079700, now seen corresponding path program 14 times [2019-08-05 11:06:27,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:27,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 1225 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 11:06:27,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:27,960 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:06:27,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:28,081 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 11:06:28,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:28,108 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:06:28,109 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:28,227 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-08-05 11:06:28,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:28,228 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:06:28,229 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2019-08-05 11:06:28,479 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:28,480 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:06:28,480 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:28,481 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:28,591 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 11:06:28,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:28,623 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:06:28,623 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:28,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:28,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:28,697 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2019-08-05 11:06:28,716 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:28,716 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:06:28,717 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:28,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:28,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:28,726 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:06:28,726 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:28,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:28,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:28,733 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2019-08-05 11:06:28,747 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:28,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-08-05 11:06:28,748 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:28,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:28,779 INFO L567 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2019-08-05 11:06:28,779 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:06:28,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2019-08-05 11:06:28,795 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2019-08-05 11:06:28,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:28,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-08-05 11:06:28,799 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:28,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:28,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-08-05 11:06:28,808 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:17 [2019-08-05 11:06:28,868 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:28,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:28,874 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 15 treesize of output 1 [2019-08-05 11:06:28,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:28,877 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 20 treesize of output 19 [2019-08-05 11:06:28,877 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:28,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:28,886 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:06:28,887 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2019-08-05 11:06:28,920 INFO L392 ElimStorePlain]: Different costs {1=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 6=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:06:28,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:28,934 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:06:28,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:28,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:29,034 INFO L341 Elim1Store]: treesize reduction 8, result has 87.3 percent of original size [2019-08-05 11:06:29,034 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 5 case distinctions, treesize of input 22 treesize of output 69 [2019-08-05 11:06:29,035 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:29,036 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:29,036 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:29,107 INFO L567 ElimStorePlain]: treesize reduction 24, result has 60.7 percent of original size [2019-08-05 11:06:29,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:29,108 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 [2019-08-05 11:06:29,138 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 0 case distinctions, treesize of input 17 treesize of output 17 [2019-08-05 11:06:29,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:29,154 INFO L567 ElimStorePlain]: treesize reduction 4, result has 82.6 percent of original size [2019-08-05 11:06:29,155 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:06:29,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:19 [2019-08-05 11:06:29,159 INFO L392 ElimStorePlain]: Different costs {1=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 3=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:06:29,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:29,164 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:06:29,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:29,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:29,195 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:29,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 16 treesize of output 34 [2019-08-05 11:06:29,196 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:29,197 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:29,197 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:29,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:29,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:29,208 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:33, output treesize:12 [2019-08-05 11:06:29,260 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:29,260 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:06:29,261 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:29,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:29,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:29,277 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:06:29,278 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:29,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:29,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:29,291 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:18 [2019-08-05 11:06:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 221 proven. 151 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-08-05 11:06:29,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:29,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:06:29,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:06:29,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:06:29,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:06:29,471 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 17 states. [2019-08-05 11:06:30,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:30,452 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2019-08-05 11:06:30,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:06:30,453 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-08-05 11:06:30,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:30,454 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:06:30,454 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:06:30,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=229, Invalid=827, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:06:30,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:06:30,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2019-08-05 11:06:30,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:06:30,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2019-08-05 11:06:30,461 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 56 [2019-08-05 11:06:30,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:30,461 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2019-08-05 11:06:30,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:06:30,462 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2019-08-05 11:06:30,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:06:30,464 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:30,464 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 6, 6, 6, 5, 1, 1, 1] [2019-08-05 11:06:30,465 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:30,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:30,465 INFO L82 PathProgramCache]: Analyzing trace with hash 958351837, now seen corresponding path program 15 times [2019-08-05 11:06:30,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:30,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:06:30,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:30,917 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 215 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2019-08-05 11:06:30,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:30,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:06:30,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:06:30,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:06:30,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:06:30,919 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 15 states. [2019-08-05 11:06:31,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:31,585 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2019-08-05 11:06:31,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:06:31,586 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-08-05 11:06:31,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:31,586 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:06:31,587 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:06:31,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=300, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:06:31,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:06:31,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2019-08-05 11:06:31,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:06:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2019-08-05 11:06:31,590 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 57 [2019-08-05 11:06:31,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:31,591 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2019-08-05 11:06:31,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:06:31,591 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2019-08-05 11:06:31,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 11:06:31,592 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:31,592 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 6, 6, 6, 5, 1, 1, 1] [2019-08-05 11:06:31,593 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:31,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:31,593 INFO L82 PathProgramCache]: Analyzing trace with hash -355810409, now seen corresponding path program 16 times [2019-08-05 11:06:31,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:31,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:06:31,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:32,126 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 304 proven. 102 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-08-05 11:06:32,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:32,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:06:32,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:06:32,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:06:32,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:06:32,127 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand 15 states. [2019-08-05 11:06:32,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:32,680 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2019-08-05 11:06:32,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:06:32,681 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2019-08-05 11:06:32,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:32,682 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:06:32,682 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:06:32,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=265, Invalid=925, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:06:32,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:06:32,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 75. [2019-08-05 11:06:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:06:32,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2019-08-05 11:06:32,686 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 58 [2019-08-05 11:06:32,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:32,687 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2019-08-05 11:06:32,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:06:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2019-08-05 11:06:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:06:32,688 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:32,688 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 7, 7, 7, 6, 1, 1, 1] [2019-08-05 11:06:32,688 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:32,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:32,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1415376086, now seen corresponding path program 17 times [2019-08-05 11:06:32,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:32,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 1541 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:06:32,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:33,290 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 518 proven. 73 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-08-05 11:06:33,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:33,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:06:33,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:06:33,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:06:33,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:06:33,291 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand 13 states. [2019-08-05 11:06:33,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:33,697 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2019-08-05 11:06:33,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:06:33,698 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2019-08-05 11:06:33,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:33,699 INFO L225 Difference]: With dead ends: 90 [2019-08-05 11:06:33,699 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 11:06:33,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:06:33,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 11:06:33,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2019-08-05 11:06:33,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 11:06:33,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2019-08-05 11:06:33,703 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 70 [2019-08-05 11:06:33,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:33,703 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2019-08-05 11:06:33,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:06:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2019-08-05 11:06:33,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 11:06:33,705 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:33,705 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 7, 7, 7, 6, 1, 1, 1] [2019-08-05 11:06:33,705 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:33,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:33,706 INFO L82 PathProgramCache]: Analyzing trace with hash 704212255, now seen corresponding path program 18 times [2019-08-05 11:06:33,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:35,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 1587 conjuncts, 169 conjunts are in the unsatisfiable core [2019-08-05 11:06:35,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:35,395 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:06:35,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:35,513 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 11:06:35,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:35,540 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:06:35,540 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:35,658 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-08-05 11:06:35,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:35,659 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:06:35,659 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2019-08-05 11:06:35,796 INFO L392 ElimStorePlain]: Different costs {1=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 3=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:06:35,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:35,806 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:06:35,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:35,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:35,839 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:35,839 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:06:35,840 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:35,840 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:35,866 INFO L567 ElimStorePlain]: treesize reduction 14, result has 66.7 percent of original size [2019-08-05 11:06:35,866 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:06:35,866 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2019-08-05 11:06:35,882 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 11:06:35,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:35,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:35,888 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:06:35,888 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-08-05 11:06:35,909 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:35,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-08-05 11:06:35,910 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:35,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:35,944 INFO L567 ElimStorePlain]: treesize reduction 10, result has 74.4 percent of original size [2019-08-05 11:06:35,945 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:35,947 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:35,947 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:26 [2019-08-05 11:06:35,948 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:35,963 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:35,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2019-08-05 11:06:35,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:35,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2019-08-05 11:06:35,980 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:36,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:36,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-08-05 11:06:36,002 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-08-05 11:06:36,032 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:36,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-08-05 11:06:36,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:36,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2019-08-05 11:06:36,048 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:36,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:36,090 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-08-05 11:06:36,090 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:70, output treesize:60 [2019-08-05 11:06:36,134 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:36,208 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:36,209 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 3 case distinctions, treesize of input 29 treesize of output 68 [2019-08-05 11:06:36,209 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:36,210 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:36,210 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:36,211 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:36,212 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:36,212 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:36,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:36,346 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2019-08-05 11:06:36,347 INFO L567 ElimStorePlain]: treesize reduction 96, result has 43.5 percent of original size [2019-08-05 11:06:36,347 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:36,348 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:36,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:36,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:67 [2019-08-05 11:06:36,350 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:36,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:36,379 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:36,380 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:51,168 WARN L188 SmtUtils]: Spent 14.69 s on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2019-08-05 11:06:51,170 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:51,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 16 [2019-08-05 11:06:51,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:51,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:51,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2019-08-05 11:06:51,209 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:51,229 INFO L567 ElimStorePlain]: treesize reduction 4, result has 81.0 percent of original size [2019-08-05 11:06:51,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-08-05 11:06:51,230 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:17 [2019-08-05 11:06:51,251 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:51,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:51,265 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 15 treesize of output 1 [2019-08-05 11:06:51,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:51,271 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 20 treesize of output 19 [2019-08-05 11:06:51,272 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:51,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:51,280 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:06:51,280 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2019-08-05 11:06:51,306 INFO L392 ElimStorePlain]: Different costs {1=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 3=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:06:51,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:51,311 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:06:51,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:51,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:51,351 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:51,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 16 treesize of output 34 [2019-08-05 11:06:51,351 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:51,352 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:51,352 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:51,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:51,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:51,366 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:33, output treesize:12 [2019-08-05 11:06:56,258 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:56,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-08-05 11:06:56,259 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:56,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:56,291 INFO L567 ElimStorePlain]: treesize reduction 10, result has 74.4 percent of original size [2019-08-05 11:06:56,292 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:56,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:56,293 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:26 [2019-08-05 11:06:56,293 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:56,294 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:56,303 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:56,355 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:56,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2019-08-05 11:06:56,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:56,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:56,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2019-08-05 11:06:56,391 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:56,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:56,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-08-05 11:06:56,410 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:34 [2019-08-05 11:06:56,442 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:56,528 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:56,597 INFO L392 ElimStorePlain]: Different costs {1=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|], 3=[|ULTIMATE.start_#Ultimate.alloc_old_#length|]} [2019-08-05 11:06:56,614 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:56,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-08-05 11:06:56,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:56,664 INFO L567 ElimStorePlain]: treesize reduction 14, result has 77.4 percent of original size [2019-08-05 11:06:56,694 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:56,695 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 3 case distinctions, treesize of input 29 treesize of output 68 [2019-08-05 11:06:56,696 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:56,696 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:56,697 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:56,697 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:56,698 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:56,698 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:56,794 INFO L567 ElimStorePlain]: treesize reduction 102, result has 37.4 percent of original size [2019-08-05 11:06:56,794 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:56,795 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:56,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:56,797 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:49, output treesize:55 [2019-08-05 11:06:56,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:56,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:56,798 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:56,842 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:06:56,843 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:07:16,348 WARN L188 SmtUtils]: Spent 11.94 s on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-08-05 11:07:16,422 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:07:16,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:07:16,456 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 20 treesize of output 1 [2019-08-05 11:07:16,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:16,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:07:16,471 INFO L341 Elim1Store]: treesize reduction 12, result has 45.5 percent of original size [2019-08-05 11:07:16,472 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 30 treesize of output 34 [2019-08-05 11:07:16,472 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:16,490 INFO L567 ElimStorePlain]: treesize reduction 4, result has 82.6 percent of original size [2019-08-05 11:07:16,490 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:07:16,491 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:19 [2019-08-05 11:07:16,494 INFO L392 ElimStorePlain]: Different costs {1=[|ULTIMATE.start_#Ultimate.alloc_old_#length|], 3=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:07:16,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:07:16,498 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:07:16,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:16,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:16,534 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:16,534 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 16 treesize of output 34 [2019-08-05 11:07:16,535 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:16,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:16,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:07:16,551 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:18 [2019-08-05 11:07:56,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-08-05 11:07:56,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:56,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:56,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:07:56,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:15 [2019-08-05 11:07:56,455 INFO L134 CoverageAnalysis]: Checked inductivity of 798 backedges. 142 proven. 558 refuted. 13 times theorem prover too weak. 85 trivial. 0 not checked. [2019-08-05 11:07:56,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:56,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:07:56,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:07:56,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:07:56,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=688, Unknown=11, NotChecked=0, Total=812 [2019-08-05 11:07:56,456 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 29 states. [2019-08-05 11:08:21,859 WARN L188 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-08-05 11:08:22,337 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2019-08-05 11:08:24,117 WARN L193 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2019-08-05 11:08:24,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:08:24,119 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.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:118) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:178) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:159) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) 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) ... 50 more [2019-08-05 11:08:24,124 INFO L168 Benchmark]: Toolchain (without parser) took 231244.64 ms. Allocated memory was 137.9 MB in the beginning and 742.9 MB in the end (delta: 605.0 MB). Free memory was 107.0 MB in the beginning and 157.8 MB in the end (delta: -50.9 MB). Peak memory consumption was 554.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:24,124 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 137.9 MB. Free memory is still 108.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:08:24,124 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.93 ms. Allocated memory is still 137.9 MB. Free memory was 106.5 MB in the beginning and 104.9 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:08:24,124 INFO L168 Benchmark]: Boogie Preprocessor took 37.15 ms. Allocated memory is still 137.9 MB. Free memory was 104.9 MB in the beginning and 103.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:24,125 INFO L168 Benchmark]: RCFGBuilder took 439.32 ms. Allocated memory is still 137.9 MB. Free memory was 103.6 MB in the beginning and 88.5 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:24,126 INFO L168 Benchmark]: TraceAbstraction took 230718.93 ms. Allocated memory was 137.9 MB in the beginning and 742.9 MB in the end (delta: 605.0 MB). Free memory was 88.5 MB in the beginning and 157.8 MB in the end (delta: -69.4 MB). Peak memory consumption was 535.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:24,128 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.25 ms. Allocated memory is still 137.9 MB. Free memory is still 108.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.93 ms. Allocated memory is still 137.9 MB. Free memory was 106.5 MB in the beginning and 104.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.15 ms. Allocated memory is still 137.9 MB. Free memory was 104.9 MB in the beginning and 103.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 439.32 ms. Allocated memory is still 137.9 MB. Free memory was 103.6 MB in the beginning and 88.5 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 230718.93 ms. Allocated memory was 137.9 MB in the beginning and 742.9 MB in the end (delta: 605.0 MB). Free memory was 88.5 MB in the beginning and 157.8 MB in the end (delta: -69.4 MB). Peak memory consumption was 535.7 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...