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/20170304-DifficultPathPrograms/sum04.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:38:39,634 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:38:39,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:38:39,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:38:39,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:38:39,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:38:39,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:38:39,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:38:39,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:38:39,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:38:39,655 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:38:39,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:38:39,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:38:39,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:38:39,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:38:39,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:38:39,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:38:39,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:38:39,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:38:39,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:38:39,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:38:39,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:38:39,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:38:39,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:38:39,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:38:39,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:38:39,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:38:39,672 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:38:39,673 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:38:39,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:38:39,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:38:39,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:38:39,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:38:39,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:38:39,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:38:39,678 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:38:39,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:38:39,679 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:38:39,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:38:39,680 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:38:39,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:38:39,707 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:38:39,720 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:38:39,723 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:38:39,724 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:38:39,725 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:38:39,726 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum04.i_3.bpl [2019-08-04 21:38:39,726 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum04.i_3.bpl' [2019-08-04 21:38:39,760 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:38:39,762 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:38:39,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:39,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:38:39,763 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:38:39,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:39" (1/1) ... [2019-08-04 21:38:39,788 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:39" (1/1) ... [2019-08-04 21:38:39,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:39,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:38:39,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:38:39,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:38:39,807 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:39" (1/1) ... [2019-08-04 21:38:39,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:39" (1/1) ... [2019-08-04 21:38:39,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:39" (1/1) ... [2019-08-04 21:38:39,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:39" (1/1) ... [2019-08-04 21:38:39,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:39" (1/1) ... [2019-08-04 21:38:39,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:39" (1/1) ... [2019-08-04 21:38:39,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:39" (1/1) ... [2019-08-04 21:38:39,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:38:39,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:38:39,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:38:39,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:38:39,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:39" (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-04 21:38:39,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:38:39,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:38:40,114 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:38:40,114 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-04 21:38:40,115 INFO L202 PluginConnector]: Adding new model sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:40 BoogieIcfgContainer [2019-08-04 21:38:40,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:38:40,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:38:40,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:38:40,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:38:40,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:39" (1/2) ... [2019-08-04 21:38:40,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a3f7058 and model type sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:38:40, skipping insertion in model container [2019-08-04 21:38:40,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:40" (2/2) ... [2019-08-04 21:38:40,125 INFO L109 eAbstractionObserver]: Analyzing ICFG sum04.i_3.bpl [2019-08-04 21:38:40,135 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:38:40,144 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:38:40,160 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:38:40,185 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:38:40,186 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:38:40,186 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:38:40,186 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:38:40,187 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:38:40,187 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:38:40,187 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:38:40,187 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:38:40,187 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:38:40,203 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-04 21:38:40,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:38:40,212 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:40,213 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:38:40,215 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:40,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:40,221 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-04 21:38:40,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:40,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:38:40,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:40,362 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-04 21:38:40,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:40,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:38:40,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:40,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:40,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:40,385 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-04 21:38:40,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:40,410 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-04 21:38:40,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:40,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-04 21:38:40,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:40,423 INFO L225 Difference]: With dead ends: 5 [2019-08-04 21:38:40,423 INFO L226 Difference]: Without dead ends: 5 [2019-08-04 21:38:40,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-04 21:38:40,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-04 21:38:40,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-04 21:38:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-04 21:38:40,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-04 21:38:40,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-04 21:38:40,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:40,460 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-04 21:38:40,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:40,460 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-04 21:38:40,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:38:40,461 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:40,461 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:38:40,461 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:40,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:40,462 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-04 21:38:40,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:40,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:40,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:40,644 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-04 21:38:40,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:40,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:38:40,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:38:40,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:38:40,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:40,649 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-04 21:38:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:40,746 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:38:40,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:38:40,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-04 21:38:40,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:40,748 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:38:40,748 INFO L226 Difference]: Without dead ends: 6 [2019-08-04 21:38:40,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-04 21:38:40,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-04 21:38:40,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-04 21:38:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:38:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-04 21:38:40,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-04 21:38:40,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:40,753 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-04 21:38:40,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:38:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-04 21:38:40,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:38:40,756 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:40,759 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-04 21:38:40,760 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:40,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:40,760 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-04 21:38:40,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:40,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-04 21:38:40,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:41,010 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-04 21:38:41,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:41,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:38:41,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:38:41,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:38:41,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:41,013 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-04 21:38:41,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:41,074 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-04 21:38:41,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:38:41,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-04 21:38:41,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:41,075 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:38:41,075 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:38:41,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:38:41,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:38:41,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:38:41,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:38:41,078 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-04 21:38:41,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:41,079 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:38:41,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:38:41,079 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:38:41,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:38:41,079 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:41,080 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-04 21:38:41,080 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:41,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:41,081 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-04 21:38:41,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:41,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:38:41,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:41,193 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-04 21:38:41,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:41,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:38:41,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:38:41,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:38:41,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:38:41,195 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-04 21:38:41,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:41,227 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:38:41,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:38:41,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:38:41,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:41,229 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:38:41,229 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:38:41,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:38:41,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:38:41,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:38:41,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:38:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:38:41,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-04 21:38:41,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:41,241 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:38:41,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:38:41,242 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:38:41,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:38:41,242 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:41,242 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-04 21:38:41,243 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:41,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:41,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-04 21:38:41,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:41,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:38:41,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:41,453 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-04 21:38:41,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:41,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:38:41,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:38:41,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:38:41,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:38:41,455 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-04 21:38:41,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:41,602 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:38:41,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:38:41,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-04 21:38:41,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:41,603 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:38:41,603 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:38:41,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-04 21:38:41,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:38:41,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:38:41,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:38:41,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:38:41,606 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-04 21:38:41,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:41,607 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:38:41,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:38:41,607 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:38:41,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:38:41,607 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:41,608 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-04 21:38:41,608 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:41,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:41,608 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-04 21:38:41,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:41,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:38:41,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:41,797 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-04 21:38:41,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:41,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:38:41,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:38:41,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:38:41,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:38:41,798 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-04 21:38:41,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:41,834 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-04 21:38:41,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:38:41,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-04 21:38:41,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:41,835 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:38:41,835 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:38:41,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-04 21:38:41,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:38:41,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:38:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:38:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-04 21:38:41,838 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-04 21:38:41,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:41,839 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-04 21:38:41,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:38:41,839 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-04 21:38:41,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:38:41,840 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:41,840 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-04 21:38:41,840 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:41,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:41,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-04 21:38:41,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:41,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:38:41,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:42,073 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-04 21:38:42,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:42,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:38:42,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:38:42,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:38:42,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:38:42,077 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-04 21:38:42,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:42,114 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:38:42,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:38:42,115 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-04 21:38:42,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:42,116 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:38:42,116 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:38:42,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-04 21:38:42,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:38:42,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:38:42,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:38:42,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:38:42,120 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-04 21:38:42,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:42,120 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:38:42,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:38:42,120 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:38:42,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:38:42,121 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:42,121 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-04 21:38:42,121 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:42,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:42,121 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-04 21:38:42,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:42,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:38:42,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:42,287 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-04 21:38:42,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:42,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:38:42,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:38:42,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:38:42,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:38:42,289 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-04 21:38:42,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:42,336 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:38:42,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:38:42,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-04 21:38:42,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:42,338 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:38:42,338 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:38:42,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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-04 21:38:42,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:38:42,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-04 21:38:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:38:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-04 21:38:42,341 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-04 21:38:42,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:42,342 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-04 21:38:42,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:38:42,342 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-04 21:38:42,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:38:42,342 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:42,343 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-04 21:38:42,343 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:42,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:42,343 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-04 21:38:42,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:42,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-04 21:38:42,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:42,744 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-04 21:38:42,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:42,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:38:42,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:38:42,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:38:42,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:38:42,746 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-04 21:38:42,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:42,855 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-04 21:38:42,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:38:42,856 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-04 21:38:42,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:42,857 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:38:42,857 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:38:42,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:38:42,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:38:42,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:38:42,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:38:42,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-04 21:38:42,861 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-04 21:38:42,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:42,861 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-04 21:38:42,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:38:42,861 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-04 21:38:42,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:38:42,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:42,862 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-04 21:38:42,862 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:42,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:42,863 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-04 21:38:42,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:42,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-04 21:38:42,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:43,082 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:43,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:43,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-08-04 21:38:43,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:38:43,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:38:43,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:38:43,085 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 11 states. [2019-08-04 21:38:43,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:43,116 INFO L93 Difference]: Finished difference Result 10 states and 9 transitions. [2019-08-04 21:38:43,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:38:43,117 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2019-08-04 21:38:43,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:43,118 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:38:43,118 INFO L226 Difference]: Without dead ends: 0 [2019-08-04 21:38:43,119 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-04 21:38:43,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-04 21:38:43,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-04 21:38:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-04 21:38:43,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-04 21:38:43,120 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2019-08-04 21:38:43,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:43,120 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-04 21:38:43,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:38:43,120 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-04 21:38:43,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-04 21:38:43,126 INFO L202 PluginConnector]: Adding new model sum04.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:38:43 BoogieIcfgContainer [2019-08-04 21:38:43,126 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:38:43,129 INFO L168 Benchmark]: Toolchain (without parser) took 3365.92 ms. Allocated memory was 134.7 MB in the beginning and 169.3 MB in the end (delta: 34.6 MB). Free memory was 110.0 MB in the beginning and 63.7 MB in the end (delta: 46.3 MB). Peak memory consumption was 80.9 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:43,130 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 134.7 MB. Free memory was 111.2 MB in the beginning and 111.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-08-04 21:38:43,131 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.12 ms. Allocated memory is still 134.7 MB. Free memory was 109.8 MB in the beginning and 108.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:43,132 INFO L168 Benchmark]: Boogie Preprocessor took 18.98 ms. Allocated memory is still 134.7 MB. Free memory was 108.2 MB in the beginning and 107.2 MB in the end (delta: 970.9 kB). Peak memory consumption was 970.9 kB. Max. memory is 7.1 GB. [2019-08-04 21:38:43,133 INFO L168 Benchmark]: RCFGBuilder took 300.44 ms. Allocated memory is still 134.7 MB. Free memory was 107.0 MB in the beginning and 97.7 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:43,134 INFO L168 Benchmark]: TraceAbstraction took 3008.69 ms. Allocated memory was 134.7 MB in the beginning and 169.3 MB in the end (delta: 34.6 MB). Free memory was 97.5 MB in the beginning and 63.7 MB in the end (delta: 33.8 MB). Peak memory consumption was 68.4 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:43,138 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 134.7 MB. Free memory was 111.2 MB in the beginning and 111.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.12 ms. Allocated memory is still 134.7 MB. Free memory was 109.8 MB in the beginning and 108.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 18.98 ms. Allocated memory is still 134.7 MB. Free memory was 108.2 MB in the beginning and 107.2 MB in the end (delta: 970.9 kB). Peak memory consumption was 970.9 kB. Max. memory is 7.1 GB. * RCFGBuilder took 300.44 ms. Allocated memory is still 134.7 MB. Free memory was 107.0 MB in the beginning and 97.7 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3008.69 ms. Allocated memory was 134.7 MB in the beginning and 169.3 MB in the end (delta: 34.6 MB). Free memory was 97.5 MB in the beginning and 63.7 MB in the end (delta: 33.8 MB). Peak memory consumption was 68.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. SAFE Result, 2.9s OverallTime, 10 OverallIterations, 9 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 28 SDtfs, 0 SDslu, 30 SDs, 0 SdLazy, 186 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=9, 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, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 1363 SizeOfPredicates, 10 NumberOfNonLiveVariables, 365 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 45/165 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...