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/Arrays/Arrays15.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:06:31,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:06:31,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:06:31,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:06:31,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:06:31,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:06:31,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:06:31,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:06:31,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:06:31,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:06:31,617 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:06:31,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:06:31,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:06:31,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:06:31,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:06:31,630 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:06:31,631 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:06:31,632 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:06:31,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:06:31,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:06:31,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:06:31,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:06:31,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:06:31,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:06:31,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:06:31,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:06:31,654 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:06:31,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:06:31,656 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:06:31,659 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:06:31,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:06:31,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:06:31,662 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:06:31,663 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:06:31,665 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:06:31,665 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:06:31,666 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:06:31,666 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:06:31,666 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:06:31,668 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:06:31,670 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:06:31,719 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:06:31,735 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:06:31,740 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:06:31,742 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:06:31,742 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:06:31,744 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/quantifier/Arrays/Arrays15.bpl [2019-08-05 11:06:31,745 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/quantifier/Arrays/Arrays15.bpl' [2019-08-05 11:06:31,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:06:31,799 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:06:31,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:06:31,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:06:31,800 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:06:31,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Arrays15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:31" (1/1) ... [2019-08-05 11:06:31,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Arrays15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:31" (1/1) ... [2019-08-05 11:06:31,838 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:06:31,838 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:06:31,838 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:06:31,840 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:06:31,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:06:31,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:06:31,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:06:31,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Arrays15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:31" (1/1) ... [2019-08-05 11:06:31,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Arrays15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:31" (1/1) ... [2019-08-05 11:06:31,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Arrays15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:31" (1/1) ... [2019-08-05 11:06:31,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Arrays15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:31" (1/1) ... [2019-08-05 11:06:31,862 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Arrays15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:31" (1/1) ... [2019-08-05 11:06:31,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Arrays15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:31" (1/1) ... [2019-08-05 11:06:31,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Arrays15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:31" (1/1) ... [2019-08-05 11:06:31,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:06:31,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:06:31,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:06:31,869 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:06:31,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Arrays15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:31" (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:31,932 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:06:31,933 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:06:32,346 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:06:32,347 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:06:32,348 INFO L202 PluginConnector]: Adding new model Arrays15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:06:32 BoogieIcfgContainer [2019-08-05 11:06:32,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:06:32,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:06:32,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:06:32,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:06:32,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Arrays15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:31" (1/2) ... [2019-08-05 11:06:32,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ddd6dac and model type Arrays15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:06:32, skipping insertion in model container [2019-08-05 11:06:32,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Arrays15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:06:32" (2/2) ... [2019-08-05 11:06:32,356 INFO L109 eAbstractionObserver]: Analyzing ICFG Arrays15.bpl [2019-08-05 11:06:32,366 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:06:32,374 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-08-05 11:06:32,390 INFO L252 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-08-05 11:06:32,416 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:06:32,417 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:06:32,417 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:06:32,417 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:06:32,418 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:06:32,418 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:06:32,418 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:06:32,418 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:06:32,418 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:06:32,435 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-08-05 11:06:32,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:06:32,443 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:32,444 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:06:32,448 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr18ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:32,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:32,455 INFO L82 PathProgramCache]: Analyzing trace with hash 29888, now seen corresponding path program 1 times [2019-08-05 11:06:32,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:32,594 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:06:32,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:32,710 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 208 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 101 [2019-08-05 11:06:32,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:32,975 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-08-05 11:06:32,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:32,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:32,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:101 [2019-08-05 11:06:33,267 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-08-05 11:06:33,487 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-08-05 11:06:33,491 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:33,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:33,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:06:33,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:06:33,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:06:33,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:06:33,510 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 4 states. [2019-08-05 11:06:34,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:34,030 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 11:06:34,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:06:34,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 11:06:34,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:34,042 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:06:34,042 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:06:34,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:06:34,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:06:34,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:06:34,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:06:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:06:34,077 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 3 [2019-08-05 11:06:34,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:34,077 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:06:34,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:06:34,078 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:06:34,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:06:34,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:34,078 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:06:34,079 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr18ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:34,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:34,080 INFO L82 PathProgramCache]: Analyzing trace with hash 30016, now seen corresponding path program 1 times [2019-08-05 11:06:34,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:34,091 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:06:34,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:34,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 208 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 101 [2019-08-05 11:06:34,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:34,526 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-08-05 11:06:34,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:34,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:34,528 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:101 [2019-08-05 11:06:34,746 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-08-05 11:06:34,876 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:34,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:34,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:06:34,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:06:34,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:06:34,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:06:34,880 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 4 states. [2019-08-05 11:06:34,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:34,966 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:06:34,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:06:34,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 11:06:34,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:34,968 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:06:34,968 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:06:34,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:06:34,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:06:34,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:06:34,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:06:34,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 11:06:34,973 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 3 [2019-08-05 11:06:34,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:34,973 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 11:06:34,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:06:34,973 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 11:06:34,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:06:34,974 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:34,974 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:06:34,975 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr18ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:34,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:34,976 INFO L82 PathProgramCache]: Analyzing trace with hash 930537, now seen corresponding path program 1 times [2019-08-05 11:06:34,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:34,991 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:06:34,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:35,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, 208 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 101 [2019-08-05 11:06:35,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:35,297 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-08-05 11:06:35,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:35,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:35,300 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:101 [2019-08-05 11:06:35,658 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-08-05 11:06:35,660 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:35,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:35,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:06:35,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:06:35,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:06:35,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:06:35,662 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2019-08-05 11:06:35,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:35,756 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:06:35,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:06:35,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 11:06:35,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:35,759 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:06:35,759 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:06:35,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:35,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:06:35,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2019-08-05 11:06:35,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:06:35,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:06:35,764 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 4 [2019-08-05 11:06:35,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:35,764 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:06:35,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:06:35,764 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:06:35,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:06:35,765 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:35,765 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:06:35,766 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr18ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:35,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:35,766 INFO L82 PathProgramCache]: Analyzing trace with hash 28724002, now seen corresponding path program 1 times [2019-08-05 11:06:35,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:35,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:06:35,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:35,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 208 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 101 [2019-08-05 11:06:35,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:36,115 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-08-05 11:06:36,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:36,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:36,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:101 [2019-08-05 11:06:36,238 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:36,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:36,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:06:36,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:06:36,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:06:36,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:06:36,240 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 4 states. [2019-08-05 11:06:36,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:36,311 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:06:36,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:06:36,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:06:36,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:36,312 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:06:36,313 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:06:36,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:06:36,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:06:36,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:06:36,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:06:36,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:06:36,317 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 5 [2019-08-05 11:06:36,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:36,317 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:06:36,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:06:36,318 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:06:36,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:06:36,318 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:36,318 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:06:36,319 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr18ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:36,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:36,319 INFO L82 PathProgramCache]: Analyzing trace with hash 28723810, now seen corresponding path program 1 times [2019-08-05 11:06:36,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:36,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:06:36,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:36,399 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 208 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 101 [2019-08-05 11:06:36,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:36,518 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-08-05 11:06:36,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:36,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:36,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:101 [2019-08-05 11:06:36,688 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:36,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:36,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:06:36,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:06:36,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:06:36,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:06:36,690 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2019-08-05 11:06:36,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:36,724 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:06:36,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:06:36,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:06:36,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:36,726 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:06:36,726 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:06:36,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:06:36,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:06:36,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:06:36,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:06:36,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:06:36,730 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 5 [2019-08-05 11:06:36,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:36,730 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:06:36,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:06:36,731 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:06:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:06:36,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:36,731 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:06:36,732 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr18ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:36,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:36,732 INFO L82 PathProgramCache]: Analyzing trace with hash 890444117, now seen corresponding path program 1 times [2019-08-05 11:06:36,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:36,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:06:36,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:36,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 208 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 101 [2019-08-05 11:06:36,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:37,013 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-08-05 11:06:37,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:37,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:37,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:101 [2019-08-05 11:06:37,267 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-08-05 11:06:37,358 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:37,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:37,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:06:37,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:06:37,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:06:37,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:06:37,360 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2019-08-05 11:06:37,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:37,461 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:06:37,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:06:37,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:06:37,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:37,463 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:06:37,463 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:06:37,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:06:37,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:06:37,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:06:37,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:06:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:06:37,466 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-08-05 11:06:37,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:37,467 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:06:37,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:06:37,467 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:06:37,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:06:37,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:37,468 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:06:37,468 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr18ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:37,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:37,469 INFO L82 PathProgramCache]: Analyzing trace with hash 890438159, now seen corresponding path program 1 times [2019-08-05 11:06:37,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:37,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:06:37,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:37,503 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 11 treesize of output 7 [2019-08-05 11:06:37,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:37,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:37,513 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:37,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:11, output treesize:3 [2019-08-05 11:06:37,515 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:37,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:37,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:06:37,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:06:37,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:06:37,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:06:37,516 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 3 states. [2019-08-05 11:06:37,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:37,534 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:06:37,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:06:37,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-08-05 11:06:37,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:37,534 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:06:37,535 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:06:37,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:37,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:06:37,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:06:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:06:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:06:37,536 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-08-05 11:06:37,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:37,536 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:06:37,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:06:37,536 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:06:37,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:06:37,541 INFO L202 PluginConnector]: Adding new model Arrays15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:06:37 BoogieIcfgContainer [2019-08-05 11:06:37,542 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:06:37,544 INFO L168 Benchmark]: Toolchain (without parser) took 5744.46 ms. Allocated memory was 142.1 MB in the beginning and 231.7 MB in the end (delta: 89.7 MB). Free memory was 111.7 MB in the beginning and 161.8 MB in the end (delta: -50.1 MB). Peak memory consumption was 39.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:37,544 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.32 ms. Allocated memory is still 142.1 MB. Free memory was 113.0 MB in the beginning and 112.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 11:06:37,545 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.07 ms. Allocated memory is still 142.1 MB. Free memory was 111.5 MB in the beginning and 109.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:37,546 INFO L168 Benchmark]: Boogie Preprocessor took 27.05 ms. Allocated memory is still 142.1 MB. Free memory was 109.7 MB in the beginning and 108.5 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:06:37,547 INFO L168 Benchmark]: RCFGBuilder took 479.58 ms. Allocated memory is still 142.1 MB. Free memory was 108.5 MB in the beginning and 94.9 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:37,548 INFO L168 Benchmark]: TraceAbstraction took 5192.41 ms. Allocated memory was 142.1 MB in the beginning and 231.7 MB in the end (delta: 89.7 MB). Free memory was 94.5 MB in the beginning and 161.8 MB in the end (delta: -67.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:37,552 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.32 ms. Allocated memory is still 142.1 MB. Free memory was 113.0 MB in the beginning and 112.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.07 ms. Allocated memory is still 142.1 MB. Free memory was 111.5 MB in the beginning and 109.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.05 ms. Allocated memory is still 142.1 MB. Free memory was 109.7 MB in the beginning and 108.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 479.58 ms. Allocated memory is still 142.1 MB. Free memory was 108.5 MB in the beginning and 94.9 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5192.41 ms. Allocated memory was 142.1 MB in the beginning and 231.7 MB in the end (delta: 89.7 MB). Free memory was 94.5 MB in the beginning and 161.8 MB in the end (delta: -67.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 38]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 57]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 58]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 61]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 43]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 53]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 33]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 46]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 60]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 55]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 50]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 59]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 36]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 51]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 54]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 56]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 52]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 48]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 19 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 19 error locations. SAFE Result, 5.1s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 47 SDtfs, 107 SDslu, 27 SDs, 0 SdLazy, 154 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred 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, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 7611 SizeOfPredicates, 2 NumberOfNonLiveVariables, 69 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...