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/quantifier/ArrayQuantifierEliminationBug06.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:06:37,998 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:06:38,000 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:06:38,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:06:38,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:06:38,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:06:38,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:06:38,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:06:38,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:06:38,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:06:38,020 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:06:38,020 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:06:38,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:06:38,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:06:38,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:06:38,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:06:38,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:06:38,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:06:38,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:06:38,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:06:38,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:06:38,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:06:38,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:06:38,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:06:38,037 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:06:38,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:06:38,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:06:38,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:06:38,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:06:38,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:06:38,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:06:38,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:06:38,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:06:38,042 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:06:38,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:06:38,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:06:38,044 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:06:38,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:06:38,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:06:38,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:06:38,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:06:38,074 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:06:38,087 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:06:38,090 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:06:38,092 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:06:38,092 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:06:38,093 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/quantifier/ArrayQuantifierEliminationBug06.bpl [2019-08-05 11:06:38,093 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/quantifier/ArrayQuantifierEliminationBug06.bpl' [2019-08-05 11:06:38,156 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:06:38,158 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:06:38,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:06:38,159 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:06:38,159 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:06:38,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayQuantifierEliminationBug06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:38" (1/1) ... [2019-08-05 11:06:38,190 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayQuantifierEliminationBug06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:38" (1/1) ... [2019-08-05 11:06:38,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:06:38,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:06:38,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:06:38,232 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:06:38,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayQuantifierEliminationBug06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:38" (1/1) ... [2019-08-05 11:06:38,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayQuantifierEliminationBug06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:38" (1/1) ... [2019-08-05 11:06:38,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayQuantifierEliminationBug06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:38" (1/1) ... [2019-08-05 11:06:38,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayQuantifierEliminationBug06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:38" (1/1) ... [2019-08-05 11:06:38,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayQuantifierEliminationBug06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:38" (1/1) ... [2019-08-05 11:06:38,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayQuantifierEliminationBug06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:38" (1/1) ... [2019-08-05 11:06:38,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayQuantifierEliminationBug06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:38" (1/1) ... [2019-08-05 11:06:38,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:06:38,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:06:38,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:06:38,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:06:38,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayQuantifierEliminationBug06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:38" (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:06:38,353 INFO L130 BoogieDeclarations]: Found specification of procedure assert_fail [2019-08-05 11:06:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-08-05 11:06:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure ~free [2019-08-05 11:06:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:06:38,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:06:38,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-08-05 11:06:38,355 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-08-05 11:06:39,211 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:06:39,212 INFO L283 CfgBuilder]: Removed 7 assume(true) statements. [2019-08-05 11:06:39,215 INFO L202 PluginConnector]: Adding new model ArrayQuantifierEliminationBug06.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:06:39 BoogieIcfgContainer [2019-08-05 11:06:39,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:06:39,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:06:39,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:06:39,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:06:39,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayQuantifierEliminationBug06.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:38" (1/2) ... [2019-08-05 11:06:39,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ca56f5 and model type ArrayQuantifierEliminationBug06.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:06:39, skipping insertion in model container [2019-08-05 11:06:39,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayQuantifierEliminationBug06.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:06:39" (2/2) ... [2019-08-05 11:06:39,227 INFO L109 eAbstractionObserver]: Analyzing ICFG ArrayQuantifierEliminationBug06.bpl [2019-08-05 11:06:39,237 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:06:39,249 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 24 error locations. [2019-08-05 11:06:39,267 INFO L252 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2019-08-05 11:06:39,296 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:06:39,297 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:06:39,298 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:06:39,298 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:06:39,298 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:06:39,298 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:06:39,298 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:06:39,299 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:06:39,299 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:06:39,317 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2019-08-05 11:06:39,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 11:06:39,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:39,327 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 11:06:39,330 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr10REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr18REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr19REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr12REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr6REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr14REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr21REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr22REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr9REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr15REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr17REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr11REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr13REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr16REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr20REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr23REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:06:39,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:39,337 INFO L82 PathProgramCache]: Analyzing trace with hash 3879, now seen corresponding path program 1 times [2019-08-05 11:06:39,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:39,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:06:39,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:39,564 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:39,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:39,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:39,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:39,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 11:06:39,681 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:06:39,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:39,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:06:39,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:06:39,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:06:39,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:06:39,700 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2019-08-05 11:06:40,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:40,060 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-08-05 11:06:40,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:06:40,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 11:06:40,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:40,069 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:06:40,070 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:06:40,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:06:40,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:06:40,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 11:06:40,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:06:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 11:06:40,103 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 2 [2019-08-05 11:06:40,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:40,103 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 11:06:40,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:06:40,104 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 11:06:40,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:06:40,104 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:40,105 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:06:40,106 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr10REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr18REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr19REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr12REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr6REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr14REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr21REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr22REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr9REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr15REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr17REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr11REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr13REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr16REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr20REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr23REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:06:40,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:40,106 INFO L82 PathProgramCache]: Analyzing trace with hash 435924103, now seen corresponding path program 1 times [2019-08-05 11:06:40,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:40,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:06:40,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:40,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, 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:40,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:40,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:40,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:40,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 11:06:40,412 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:06:40,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:40,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:06:40,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:06:40,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:06:40,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:06:40,416 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 4 states. [2019-08-05 11:06:40,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:40,780 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 11:06:40,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:06:40,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-08-05 11:06:40,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:40,782 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:06:40,782 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:06:40,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:06:40,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:06:40,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 11:06:40,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:06:40,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 11:06:40,792 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 23 [2019-08-05 11:06:40,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:40,793 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 11:06:40,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:06:40,793 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 11:06:40,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:06:40,794 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:40,796 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:06:40,799 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr10REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr18REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr19REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr12REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr6REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr14REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr21REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr22REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr9REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr15REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr17REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr11REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr13REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr16REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr20REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr23REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:06:40,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:40,800 INFO L82 PathProgramCache]: Analyzing trace with hash 628746565, now seen corresponding path program 1 times [2019-08-05 11:06:40,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:40,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:06:40,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:40,968 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:40,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:40,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:40,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:40,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 11:06:41,162 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:06:41,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:41,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:06:41,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:06:41,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:06:41,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:06:41,164 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 4 states. [2019-08-05 11:06:41,541 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 11:06:41,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:41,620 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 11:06:41,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:06:41,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-08-05 11:06:41,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:41,623 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:06:41,624 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:06:41,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:06:41,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:06:41,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 11:06:41,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:06:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 11:06:41,629 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 24 [2019-08-05 11:06:41,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:41,629 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 11:06:41,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:06:41,630 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 11:06:41,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:06:41,630 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:41,631 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:06:41,632 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr10REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr18REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr19REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr12REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr6REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr14REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr21REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr22REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr9REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr15REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr17REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr11REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr13REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr16REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr20REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr23REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:06:41,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:41,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1983691761, now seen corresponding path program 1 times [2019-08-05 11:06:41,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:41,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:06:41,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:41,760 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:41,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:41,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:41,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:41,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 11:06:41,965 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:06:41,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:41,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:06:41,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:06:41,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:06:41,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:06:41,969 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 5 states. [2019-08-05 11:06:42,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:42,643 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 11:06:42,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:06:42,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-08-05 11:06:42,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:42,645 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:06:42,645 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:06:42,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:06:42,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:06:42,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 11:06:42,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:06:42,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 11:06:42,650 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 25 [2019-08-05 11:06:42,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:42,651 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 11:06:42,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:06:42,651 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 11:06:42,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:06:42,666 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:42,666 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:06:42,668 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr10REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr18REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr19REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr12REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr6REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr14REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr21REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr22REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr9REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr15REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr17REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr11REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr13REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr16REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr20REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr23REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:06:42,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:42,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1706195311, now seen corresponding path program 1 times [2019-08-05 11:06:42,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:42,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:06:42,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:43,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-08-05 11:06:43,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:43,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:43,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:43,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-08-05 11:06:43,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 12 [2019-08-05 11:06:43,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:43,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:43,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:43,179 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2019-08-05 11:06:43,204 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:06:43,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:43,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 11:06:43,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:06:43,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:06:43,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:06:43,205 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 7 states. [2019-08-05 11:06:43,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:43,807 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 11:06:43,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:06:43,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-08-05 11:06:43,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:43,808 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:06:43,808 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:06:43,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:06:43,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:06:43,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 11:06:43,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:06:43,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 11:06:43,814 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-08-05 11:06:43,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:43,814 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 11:06:43,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:06:43,814 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 11:06:43,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:06:43,815 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:43,816 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:06:43,816 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr10REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr18REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr19REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr12REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr6REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr14REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr21REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr22REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr9REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr15REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr17REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr11REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr13REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr16REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr20REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr23REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:06:43,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:43,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1025327000, now seen corresponding path program 1 times [2019-08-05 11:06:43,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:43,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:06:43,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:44,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-08-05 11:06:44,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:44,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:44,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:44,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-08-05 11:06:44,301 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 12 [2019-08-05 11:06:44,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:44,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:44,309 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:44,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2019-08-05 11:06:44,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:44,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:44,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:06:44,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:06:44,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:06:44,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:06:44,332 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 9 states. [2019-08-05 11:06:44,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:44,748 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 11:06:44,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:06:44,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-08-05 11:06:44,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:44,750 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:06:44,750 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:06:44,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:06:44,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:06:44,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 11:06:44,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:06:44,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 11:06:44,755 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-08-05 11:06:44,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:44,755 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 11:06:44,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:06:44,756 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 11:06:44,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:06:44,756 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:44,757 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:06:44,757 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr10REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr18REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr19REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr12REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr6REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr14REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr7REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr21REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr5REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr4REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr8REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr22REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr9REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr15REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr17REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr11REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr13REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr16REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr20REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr23REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:06:44,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:44,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1793250015, now seen corresponding path program 2 times [2019-08-05 11:06:44,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:44,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:06:44,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:44,855 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:44,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:44,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:44,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:44,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 11:06:44,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-08-05 11:06:44,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:44,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:44,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:44,967 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2019-08-05 11:06:45,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 7 [2019-08-05 11:06:45,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:45,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:45,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:45,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:12 [2019-08-05 11:06:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:06:45,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:45,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:06:45,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:06:45,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:06:45,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:06:45,118 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 8 states. [2019-08-05 11:06:45,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:45,643 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 11:06:45,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:06:45,643 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-08-05 11:06:45,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:45,644 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:06:45,644 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:06:45,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:06:45,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:06:45,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:06:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:06:45,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:06:45,645 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2019-08-05 11:06:45,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:45,646 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:06:45,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:06:45,646 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:06:45,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:06:45,651 INFO L202 PluginConnector]: Adding new model ArrayQuantifierEliminationBug06.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:06:45 BoogieIcfgContainer [2019-08-05 11:06:45,651 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:06:45,653 INFO L168 Benchmark]: Toolchain (without parser) took 7495.56 ms. Allocated memory was 132.1 MB in the beginning and 242.7 MB in the end (delta: 110.6 MB). Free memory was 106.5 MB in the beginning and 126.4 MB in the end (delta: -19.8 MB). Peak memory consumption was 90.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:45,654 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 132.1 MB. Free memory was 108.4 MB in the beginning and 108.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:06:45,655 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.27 ms. Allocated memory is still 132.1 MB. Free memory was 106.3 MB in the beginning and 103.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:45,655 INFO L168 Benchmark]: Boogie Preprocessor took 47.30 ms. Allocated memory is still 132.1 MB. Free memory was 103.8 MB in the beginning and 102.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:45,656 INFO L168 Benchmark]: RCFGBuilder took 935.48 ms. Allocated memory is still 132.1 MB. Free memory was 102.2 MB in the beginning and 72.1 MB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:45,657 INFO L168 Benchmark]: TraceAbstraction took 6434.40 ms. Allocated memory was 132.1 MB in the beginning and 242.7 MB in the end (delta: 110.6 MB). Free memory was 71.7 MB in the beginning and 126.4 MB in the end (delta: -54.7 MB). Peak memory consumption was 55.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:45,660 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.21 ms. Allocated memory is still 132.1 MB. Free memory was 108.4 MB in the beginning and 108.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.27 ms. Allocated memory is still 132.1 MB. Free memory was 106.3 MB in the beginning and 103.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.30 ms. Allocated memory is still 132.1 MB. Free memory was 103.8 MB in the beginning and 102.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 935.48 ms. Allocated memory is still 132.1 MB. Free memory was 102.2 MB in the beginning and 72.1 MB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6434.40 ms. Allocated memory was 132.1 MB in the beginning and 242.7 MB in the end (delta: 110.6 MB). Free memory was 71.7 MB in the beginning and 126.4 MB in the end (delta: -54.7 MB). Peak memory consumption was 55.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 36]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 43]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 51]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 52]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 45]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 39]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 47]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 35]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 40]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 61]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 38]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 37]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 41]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 66]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 42]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 48]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 50]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 33]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 44]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 46]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 34]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 49]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 59]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 15]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 24 error locations. SAFE Result, 6.3s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 95 SDslu, 10 SDs, 0 SdLazy, 682 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 157 ConstructedInterpolants, 10 QuantifiedInterpolants, 39896 SizeOfPredicates, 30 NumberOfNonLiveVariables, 725 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 1/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...