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/abstractInterpretation/unclassified/EasyArrayStore_incorrect.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:14:00,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:14:00,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:14:00,071 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:14:00,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:14:00,072 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:14:00,074 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:14:00,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:14:00,077 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:14:00,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:14:00,079 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:14:00,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:14:00,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:14:00,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:14:00,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:14:00,083 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:14:00,084 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:14:00,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:14:00,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:14:00,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:14:00,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:14:00,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:14:00,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:14:00,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:14:00,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:14:00,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:14:00,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:14:00,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:14:00,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:14:00,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:14:00,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:14:00,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:14:00,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:14:00,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:14:00,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:14:00,103 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:14:00,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:14:00,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:14:00,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:14:00,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:14:00,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:14:00,147 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:14:00,171 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:14:00,175 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:14:00,177 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:14:00,178 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:14:00,179 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/EasyArrayStore_incorrect.bpl [2019-08-05 11:14:00,179 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/EasyArrayStore_incorrect.bpl' [2019-08-05 11:14:00,219 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:14:00,221 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:14:00,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:14:00,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:14:00,222 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:14:00,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "EasyArrayStore_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:00" (1/1) ... [2019-08-05 11:14:00,254 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "EasyArrayStore_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:00" (1/1) ... [2019-08-05 11:14:00,261 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:14:00,261 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:14:00,261 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:14:00,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:14:00,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:14:00,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:14:00,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:14:00,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "EasyArrayStore_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:00" (1/1) ... [2019-08-05 11:14:00,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "EasyArrayStore_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:00" (1/1) ... [2019-08-05 11:14:00,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "EasyArrayStore_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:00" (1/1) ... [2019-08-05 11:14:00,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "EasyArrayStore_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:00" (1/1) ... [2019-08-05 11:14:00,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "EasyArrayStore_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:00" (1/1) ... [2019-08-05 11:14:00,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "EasyArrayStore_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:00" (1/1) ... [2019-08-05 11:14:00,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "EasyArrayStore_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:00" (1/1) ... [2019-08-05 11:14:00,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:14:00,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:14:00,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:14:00,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:14:00,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "EasyArrayStore_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:00" (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:14:00,360 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:14:00,361 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:14:00,361 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:14:00,646 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:14:00,646 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:14:00,647 INFO L202 PluginConnector]: Adding new model EasyArrayStore_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:14:00 BoogieIcfgContainer [2019-08-05 11:14:00,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:14:00,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:14:00,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:14:00,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:14:00,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "EasyArrayStore_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:14:00" (1/2) ... [2019-08-05 11:14:00,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ab1731 and model type EasyArrayStore_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:14:00, skipping insertion in model container [2019-08-05 11:14:00,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "EasyArrayStore_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:14:00" (2/2) ... [2019-08-05 11:14:00,656 INFO L109 eAbstractionObserver]: Analyzing ICFG EasyArrayStore_incorrect.bpl [2019-08-05 11:14:00,665 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:14:00,672 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 11:14:00,686 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 11:14:00,710 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:14:00,711 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:14:00,711 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:14:00,712 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:14:00,712 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:14:00,712 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:14:00,712 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:14:00,712 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:14:00,713 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:14:00,727 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 11:14:00,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:14:00,735 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:00,736 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:14:00,739 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:00,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:00,745 INFO L82 PathProgramCache]: Analyzing trace with hash 929608, now seen corresponding path program 1 times [2019-08-05 11:14:00,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:00,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:14:00,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:00,865 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:14:00,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:00,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:14:00,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:14:00,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:14:00,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:14:00,886 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-08-05 11:14:01,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:01,059 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-08-05 11:14:01,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:14:01,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 11:14:01,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:01,073 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:14:01,073 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:14:01,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:14:01,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:14:01,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-08-05 11:14:01,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:14:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 11:14:01,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 4 [2019-08-05 11:14:01,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:01,111 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 11:14:01,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:14:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 11:14:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:14:01,112 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:01,112 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:14:01,112 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:01,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:01,113 INFO L82 PathProgramCache]: Analyzing trace with hash 28754402, now seen corresponding path program 1 times [2019-08-05 11:14:01,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:01,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:14:01,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:01,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:01,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:01,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:14:01,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:14:01,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:14:01,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:14:01,240 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2019-08-05 11:14:01,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:01,325 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-08-05 11:14:01,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:14:01,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:14:01,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:01,326 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:14:01,326 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:14:01,327 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:14:01,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:14:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2019-08-05 11:14:01,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:14:01,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-08-05 11:14:01,331 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 5 [2019-08-05 11:14:01,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:01,332 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-08-05 11:14:01,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:14:01,332 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-08-05 11:14:01,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:14:01,333 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:01,333 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 11:14:01,333 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:01,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:01,334 INFO L82 PathProgramCache]: Analyzing trace with hash 891323016, now seen corresponding path program 2 times [2019-08-05 11:14:01,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:01,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:14:01,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:01,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:01,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:01,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:14:01,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:14:01,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:14:01,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:14:01,416 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 5 states. [2019-08-05 11:14:01,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:01,502 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-08-05 11:14:01,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:14:01,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:14:01,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:01,503 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:14:01,504 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:14:01,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:14:01,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:14:01,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2019-08-05 11:14:01,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:14:01,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-08-05 11:14:01,508 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 6 [2019-08-05 11:14:01,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:01,508 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-08-05 11:14:01,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:14:01,508 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2019-08-05 11:14:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:14:01,509 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:01,509 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2019-08-05 11:14:01,510 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:01,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:01,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146274, now seen corresponding path program 3 times [2019-08-05 11:14:01,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:01,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:14:01,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:01,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:01,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:14:01,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:14:01,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:14:01,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:01,639 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand 6 states. [2019-08-05 11:14:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:01,904 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-08-05 11:14:01,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:14:01,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-05 11:14:01,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:01,906 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:14:01,906 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:14:01,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:01,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:14:01,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2019-08-05 11:14:01,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:14:01,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2019-08-05 11:14:01,911 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 7 [2019-08-05 11:14:01,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:01,912 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-08-05 11:14:01,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:14:01,912 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-08-05 11:14:01,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:14:01,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:01,913 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2019-08-05 11:14:01,913 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:01,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:01,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1860896200, now seen corresponding path program 4 times [2019-08-05 11:14:01,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:01,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:14:01,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:02,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:02,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:14:02,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:14:02,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:14:02,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:02,048 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 7 states. [2019-08-05 11:14:02,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:02,185 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-08-05 11:14:02,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:14:02,185 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 11:14:02,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:02,186 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:14:02,187 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:14:02,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:02,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:14:02,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2019-08-05 11:14:02,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:14:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-08-05 11:14:02,191 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 8 [2019-08-05 11:14:02,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:02,191 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-08-05 11:14:02,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:14:02,192 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2019-08-05 11:14:02,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:14:02,192 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:02,192 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2019-08-05 11:14:02,196 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:02,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:02,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1853143906, now seen corresponding path program 5 times [2019-08-05 11:14:02,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:02,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:14:02,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:02,380 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:02,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:02,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:14:02,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:14:02,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:14:02,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:02,382 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand 8 states. [2019-08-05 11:14:02,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:02,483 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-08-05 11:14:02,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:14:02,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-08-05 11:14:02,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:02,485 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:14:02,486 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:14:02,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:02,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:14:02,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2019-08-05 11:14:02,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:14:02,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-08-05 11:14:02,490 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 9 [2019-08-05 11:14:02,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:02,491 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-08-05 11:14:02,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:14:02,491 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-08-05 11:14:02,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:14:02,492 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:02,492 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2019-08-05 11:14:02,492 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:02,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:02,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1612822792, now seen corresponding path program 6 times [2019-08-05 11:14:02,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:02,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:14:02,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:02,776 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:02,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:02,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:14:02,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:14:02,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:14:02,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:02,778 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 9 states. [2019-08-05 11:14:02,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:02,952 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-08-05 11:14:02,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:14:02,952 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-08-05 11:14:02,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:02,953 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:14:02,953 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:14:02,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:02,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:14:02,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2019-08-05 11:14:02,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:14:02,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-08-05 11:14:02,957 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2019-08-05 11:14:02,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:02,958 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-08-05 11:14:02,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:14:02,958 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2019-08-05 11:14:02,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:14:02,958 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:02,959 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2019-08-05 11:14:02,959 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:02,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:02,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1542164446, now seen corresponding path program 7 times [2019-08-05 11:14:02,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:02,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:14:02,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:03,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:03,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:14:03,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:14:03,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:14:03,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:03,150 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 10 states. [2019-08-05 11:14:03,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:03,470 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-08-05 11:14:03,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:14:03,471 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-08-05 11:14:03,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:03,472 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:14:03,472 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:14:03,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:03,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:14:03,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2019-08-05 11:14:03,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:14:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-08-05 11:14:03,477 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 11 [2019-08-05 11:14:03,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:03,477 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-08-05 11:14:03,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:14:03,478 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2019-08-05 11:14:03,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:14:03,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:03,479 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2019-08-05 11:14:03,479 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:03,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:03,480 INFO L82 PathProgramCache]: Analyzing trace with hash -562521016, now seen corresponding path program 8 times [2019-08-05 11:14:03,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:03,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:14:03,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:03,708 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:03,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:03,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:14:03,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:14:03,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:14:03,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:14:03,710 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 11 states. [2019-08-05 11:14:04,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:04,130 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-08-05 11:14:04,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:14:04,130 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2019-08-05 11:14:04,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:04,131 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:14:04,132 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:14:04,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:14:04,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:14:04,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2019-08-05 11:14:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:14:04,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-08-05 11:14:04,138 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 12 [2019-08-05 11:14:04,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:04,138 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-08-05 11:14:04,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:14:04,138 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-08-05 11:14:04,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:14:04,139 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:04,139 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1] [2019-08-05 11:14:04,139 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:04,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:04,140 INFO L82 PathProgramCache]: Analyzing trace with hash -258345758, now seen corresponding path program 9 times [2019-08-05 11:14:04,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:04,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:14:04,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:04,356 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:04,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:04,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:14:04,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:14:04,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:14:04,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:14:04,358 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 12 states. [2019-08-05 11:14:04,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:04,494 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-08-05 11:14:04,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:14:04,495 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-08-05 11:14:04,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:04,496 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:14:04,496 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:14:04,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:14:04,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:14:04,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2019-08-05 11:14:04,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:14:04,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2019-08-05 11:14:04,500 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 13 [2019-08-05 11:14:04,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:04,500 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-08-05 11:14:04,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:14:04,501 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2019-08-05 11:14:04,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:14:04,501 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:04,501 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1] [2019-08-05 11:14:04,502 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:04,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:04,502 INFO L82 PathProgramCache]: Analyzing trace with hash 581152648, now seen corresponding path program 10 times [2019-08-05 11:14:04,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:04,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:14:04,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:04,647 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:04,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:04,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:14:04,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:14:04,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:14:04,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:14:04,649 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand 13 states. [2019-08-05 11:14:04,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:04,754 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-08-05 11:14:04,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:14:04,755 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2019-08-05 11:14:04,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:04,756 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:14:04,756 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:14:04,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:14:04,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:14:04,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2019-08-05 11:14:04,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:14:04,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2019-08-05 11:14:04,762 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 14 [2019-08-05 11:14:04,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:04,762 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2019-08-05 11:14:04,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:14:04,762 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2019-08-05 11:14:04,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:14:04,763 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:04,763 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1] [2019-08-05 11:14:04,763 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:04,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:04,764 INFO L82 PathProgramCache]: Analyzing trace with hash 835799458, now seen corresponding path program 11 times [2019-08-05 11:14:04,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:04,812 WARN L254 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:14:04,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:04,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:14:04,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:04,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:04,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:14:04,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 11:14:04,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:14:04,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:04,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:04,947 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:14:04,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 11:14:05,001 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:05,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 50 [2019-08-05 11:14:05,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:05,063 INFO L567 ElimStorePlain]: treesize reduction 28, result has 46.2 percent of original size [2019-08-05 11:14:05,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:14:05,064 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2019-08-05 11:14:05,191 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:05,192 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 88 [2019-08-05 11:14:05,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:05,425 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 21 [2019-08-05 11:14:05,426 INFO L567 ElimStorePlain]: treesize reduction 42, result has 44.7 percent of original size [2019-08-05 11:14:05,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 11:14:05,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:34 [2019-08-05 11:14:05,624 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-08-05 11:14:05,625 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:05,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 134 [2019-08-05 11:14:05,628 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:05,720 INFO L567 ElimStorePlain]: treesize reduction 56, result has 44.0 percent of original size [2019-08-05 11:14:05,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:14:05,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:44 [2019-08-05 11:14:05,973 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-08-05 11:14:05,974 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:05,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 32 treesize of output 188 [2019-08-05 11:14:05,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:06,065 INFO L567 ElimStorePlain]: treesize reduction 70, result has 43.5 percent of original size [2019-08-05 11:14:06,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-08-05 11:14:06,068 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:55, output treesize:54 [2019-08-05 11:14:06,412 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-08-05 11:14:06,413 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:06,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 37 treesize of output 250 [2019-08-05 11:14:06,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:06,524 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2019-08-05 11:14:06,524 INFO L567 ElimStorePlain]: treesize reduction 84, result has 43.2 percent of original size [2019-08-05 11:14:06,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-08-05 11:14:06,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:65, output treesize:64 [2019-08-05 11:14:07,323 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 146 [2019-08-05 11:14:07,324 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:07,325 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 42 treesize of output 320 [2019-08-05 11:14:07,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:07,507 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 41 [2019-08-05 11:14:07,508 INFO L567 ElimStorePlain]: treesize reduction 98, result has 43.0 percent of original size [2019-08-05 11:14:07,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-08-05 11:14:07,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:75, output treesize:74 [2019-08-05 11:14:11,172 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-08-05 11:14:11,173 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:11,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 35 case distinctions, treesize of input 47 treesize of output 398 [2019-08-05 11:14:11,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:11,338 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 46 [2019-08-05 11:14:11,338 INFO L567 ElimStorePlain]: treesize reduction 112, result has 42.9 percent of original size [2019-08-05 11:14:11,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-08-05 11:14:11,341 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:85, output treesize:84 [2019-08-05 11:14:50,255 WARN L193 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2019-08-05 11:14:50,256 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:207) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:220) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:934) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:581) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedRefinementStrategy.getTraceCheck(FixedRefinementStrategy.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:204) ... 39 more [2019-08-05 11:14:50,261 INFO L168 Benchmark]: Toolchain (without parser) took 50040.27 ms. Allocated memory was 133.2 MB in the beginning and 239.1 MB in the end (delta: 105.9 MB). Free memory was 110.6 MB in the beginning and 141.2 MB in the end (delta: -30.6 MB). Peak memory consumption was 75.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:50,262 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.29 ms. Allocated memory is still 133.2 MB. Free memory was 111.9 MB in the beginning and 111.7 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:14:50,263 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.80 ms. Allocated memory is still 133.2 MB. Free memory was 110.6 MB in the beginning and 108.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:50,263 INFO L168 Benchmark]: Boogie Preprocessor took 27.68 ms. Allocated memory is still 133.2 MB. Free memory was 108.7 MB in the beginning and 107.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:50,264 INFO L168 Benchmark]: RCFGBuilder took 355.50 ms. Allocated memory is still 133.2 MB. Free memory was 107.4 MB in the beginning and 97.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:50,265 INFO L168 Benchmark]: TraceAbstraction took 49610.76 ms. Allocated memory was 133.2 MB in the beginning and 239.1 MB in the end (delta: 105.9 MB). Free memory was 97.6 MB in the beginning and 141.2 MB in the end (delta: -43.6 MB). Peak memory consumption was 62.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:50,269 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.29 ms. Allocated memory is still 133.2 MB. Free memory was 111.9 MB in the beginning and 111.7 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.80 ms. Allocated memory is still 133.2 MB. Free memory was 110.6 MB in the beginning and 108.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.68 ms. Allocated memory is still 133.2 MB. Free memory was 108.7 MB in the beginning and 107.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 355.50 ms. Allocated memory is still 133.2 MB. Free memory was 107.4 MB in the beginning and 97.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 49610.76 ms. Allocated memory was 133.2 MB in the beginning and 239.1 MB in the end (delta: 105.9 MB). Free memory was 97.6 MB in the beginning and 141.2 MB in the end (delta: -43.6 MB). Peak memory consumption was 62.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:207) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...