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/Arrays14.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:06:24,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:06:24,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:06:24,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:06:24,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:06:24,932 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:06:24,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:06:24,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:06:24,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:06:24,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:06:24,942 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:06:24,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:06:24,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:06:24,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:06:24,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:06:24,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:06:24,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:06:24,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:06:24,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:06:24,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:06:24,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:06:24,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:06:24,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:06:24,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:06:24,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:06:24,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:06:24,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:06:24,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:06:24,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:06:24,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:06:24,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:06:24,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:06:24,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:06:24,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:06:24,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:06:24,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:06:24,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:06:24,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:06:24,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:06:24,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:06:24,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:06:24,997 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:06:25,010 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:06:25,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:06:25,015 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:06:25,016 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:06:25,017 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/quantifier/Arrays/Arrays14.bpl [2019-08-05 11:06:25,018 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/quantifier/Arrays/Arrays14.bpl' [2019-08-05 11:06:25,060 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:06:25,062 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:06:25,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:06:25,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:06:25,063 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:06:25,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Arrays14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:25" (1/1) ... [2019-08-05 11:06:25,092 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Arrays14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:25" (1/1) ... [2019-08-05 11:06:25,100 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:06:25,100 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:06:25,100 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:06:25,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:06:25,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:06:25,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:06:25,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:06:25,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Arrays14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:25" (1/1) ... [2019-08-05 11:06:25,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Arrays14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:25" (1/1) ... [2019-08-05 11:06:25,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Arrays14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:25" (1/1) ... [2019-08-05 11:06:25,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Arrays14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:25" (1/1) ... [2019-08-05 11:06:25,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Arrays14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:25" (1/1) ... [2019-08-05 11:06:25,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Arrays14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:25" (1/1) ... [2019-08-05 11:06:25,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Arrays14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:25" (1/1) ... [2019-08-05 11:06:25,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:06:25,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:06:25,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:06:25,150 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:06:25,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Arrays14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:25" (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:25,225 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:06:25,225 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:06:25,866 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:06:25,867 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:06:25,868 INFO L202 PluginConnector]: Adding new model Arrays14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:06:25 BoogieIcfgContainer [2019-08-05 11:06:25,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:06:25,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:06:25,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:06:25,874 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:06:25,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Arrays14.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:25" (1/2) ... [2019-08-05 11:06:25,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60afbd8a and model type Arrays14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:06:25, skipping insertion in model container [2019-08-05 11:06:25,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Arrays14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:06:25" (2/2) ... [2019-08-05 11:06:25,882 INFO L109 eAbstractionObserver]: Analyzing ICFG Arrays14.bpl [2019-08-05 11:06:25,889 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:06:25,896 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-08-05 11:06:25,910 INFO L252 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-08-05 11:06:25,937 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:06:25,937 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:06:25,938 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:06:25,938 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:06:25,938 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:06:25,938 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:06:25,938 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:06:25,939 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:06:25,939 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:06:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-08-05 11:06:25,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:06:25,962 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:25,963 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:06:25,967 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:25,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:25,973 INFO L82 PathProgramCache]: Analyzing trace with hash 29888, now seen corresponding path program 1 times [2019-08-05 11:06:26,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:26,118 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:06:26,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:26,253 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:26,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:26,521 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-08-05 11:06:26,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:26,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:26,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:101 [2019-08-05 11:06:26,858 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-08-05 11:06:27,205 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-08-05 11:06:27,208 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:27,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:27,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:06:27,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:06:27,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:06:27,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:06:27,230 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2019-08-05 11:06:27,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:27,598 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 11:06:27,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:06:27,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 11:06:27,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:27,612 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:06:27,612 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:06:27,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:06:27,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:06:27,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:06:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:06:27,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:06:27,656 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 3 [2019-08-05 11:06:27,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:27,657 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:06:27,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:06:27,657 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:06:27,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:06:27,658 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:27,658 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:06:27,659 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:27,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:27,660 INFO L82 PathProgramCache]: Analyzing trace with hash 30016, now seen corresponding path program 1 times [2019-08-05 11:06:27,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:27,684 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:06:27,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:27,771 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:27,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:28,051 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-08-05 11:06:28,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:28,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:28,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:101 [2019-08-05 11:06:28,299 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-08-05 11:06:28,397 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:28,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:28,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:06:28,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:06:28,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:06:28,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:06:28,401 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 4 states. [2019-08-05 11:06:28,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:28,447 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:06:28,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:06:28,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 11:06:28,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:28,449 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:06:28,450 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:06:28,451 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:28,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:06:28,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:06:28,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:06:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:06:28,454 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 3 [2019-08-05 11:06:28,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:28,454 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:06:28,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:06:28,455 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:06:28,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:06:28,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:28,456 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:06:28,456 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:28,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:28,457 INFO L82 PathProgramCache]: Analyzing trace with hash 930537, now seen corresponding path program 1 times [2019-08-05 11:06:28,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:28,473 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:06:28,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:28,541 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:28,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:28,710 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-08-05 11:06:28,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:28,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:28,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:101 [2019-08-05 11:06:29,050 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-08-05 11:06:29,052 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:29,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:29,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:06:29,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:06:29,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:06:29,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:06:29,055 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 5 states. [2019-08-05 11:06:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:29,123 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:06:29,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:06:29,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 11:06:29,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:29,125 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:06:29,125 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:06:29,126 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:29,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:06:29,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2019-08-05 11:06:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:06:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:06:29,129 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 4 [2019-08-05 11:06:29,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:29,130 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:06:29,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:06:29,130 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:06:29,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:06:29,130 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:29,130 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:06:29,131 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:29,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:29,131 INFO L82 PathProgramCache]: Analyzing trace with hash 28723938, now seen corresponding path program 1 times [2019-08-05 11:06:29,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:29,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:06:29,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:29,185 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:29,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:29,429 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-08-05 11:06:29,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:29,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:29,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:101 [2019-08-05 11:06:29,559 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:29,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:29,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:06:29,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:06:29,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:06:29,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:06:29,561 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 4 states. [2019-08-05 11:06:29,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:29,635 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:06:29,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:06:29,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:06:29,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:29,636 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:06:29,636 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:06:29,637 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:29,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:06:29,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:06:29,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:06:29,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 11:06:29,641 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 5 [2019-08-05 11:06:29,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:29,641 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 11:06:29,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:06:29,641 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 11:06:29,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:06:29,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:29,642 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:06:29,643 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:29,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:29,643 INFO L82 PathProgramCache]: Analyzing trace with hash 28723810, now seen corresponding path program 1 times [2019-08-05 11:06:29,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:29,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:06:29,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:29,740 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:29,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:29,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:29,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:29,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:101 [2019-08-05 11:06:29,982 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:29,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:29,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:06:29,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:06:29,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:06:29,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:06:29,984 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 4 states. [2019-08-05 11:06:30,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:30,006 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:06:30,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:06:30,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:06:30,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:30,007 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:06:30,008 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:06:30,008 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:30,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:06:30,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:06:30,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:06:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:06:30,012 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2019-08-05 11:06:30,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:30,012 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:06:30,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:06:30,013 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:06:30,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:06:30,013 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:30,013 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:06:30,014 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr13ASSERT_VIOLATIONASSERT, mainErr16ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr17ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:30,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:30,014 INFO L82 PathProgramCache]: Analyzing trace with hash 890442131, now seen corresponding path program 1 times [2019-08-05 11:06:30,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:30,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:06:30,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:30,077 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:30,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:30,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:30,161 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:30,162 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:101 [2019-08-05 11:06:30,457 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-08-05 11:06:30,544 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:30,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:30,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:06:30,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:06:30,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:06:30,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:06:30,546 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2019-08-05 11:06:30,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:30,642 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:06:30,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:06:30,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:06:30,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:30,643 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:06:30,643 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:06:30,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:06:30,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:06:30,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:06:30,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:06:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:06:30,644 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-08-05 11:06:30,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:30,645 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:06:30,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:06:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:06:30,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:06:30,649 INFO L202 PluginConnector]: Adding new model Arrays14.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:06:30 BoogieIcfgContainer [2019-08-05 11:06:30,649 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:06:30,651 INFO L168 Benchmark]: Toolchain (without parser) took 5589.66 ms. Allocated memory was 135.8 MB in the beginning and 222.3 MB in the end (delta: 86.5 MB). Free memory was 112.1 MB in the beginning and 164.4 MB in the end (delta: -52.3 MB). Peak memory consumption was 34.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:30,652 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 135.8 MB. Free memory is still 113.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:06:30,653 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.31 ms. Allocated memory is still 135.8 MB. Free memory was 111.7 MB in the beginning and 110.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:30,654 INFO L168 Benchmark]: Boogie Preprocessor took 46.10 ms. Allocated memory is still 135.8 MB. Free memory was 110.0 MB in the beginning and 108.7 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:30,655 INFO L168 Benchmark]: RCFGBuilder took 718.56 ms. Allocated memory is still 135.8 MB. Free memory was 108.7 MB in the beginning and 95.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:30,656 INFO L168 Benchmark]: TraceAbstraction took 4778.69 ms. Allocated memory was 135.8 MB in the beginning and 222.3 MB in the end (delta: 86.5 MB). Free memory was 94.9 MB in the beginning and 164.4 MB in the end (delta: -69.6 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:30,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.24 ms. Allocated memory is still 135.8 MB. Free memory is still 113.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.31 ms. Allocated memory is still 135.8 MB. Free memory was 111.7 MB in the beginning and 110.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.10 ms. Allocated memory is still 135.8 MB. Free memory was 110.0 MB in the beginning and 108.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 718.56 ms. Allocated memory is still 135.8 MB. Free memory was 108.7 MB in the beginning and 95.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4778.69 ms. Allocated memory was 135.8 MB in the beginning and 222.3 MB in the end (delta: 86.5 MB). Free memory was 94.9 MB in the beginning and 164.4 MB in the end (delta: -69.6 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 55]: 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: 52]: 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: 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: 49]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 44]: 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: 41]: 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: 38]: 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: 48]: 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: 54]: 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 - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 40 locations, 18 error locations. SAFE Result, 4.7s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 31 SDtfs, 106 SDslu, 15 SDs, 0 SdLazy, 123 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred 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, 6 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 7576 SizeOfPredicates, 1 NumberOfNonLiveVariables, 57 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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...