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/sum01.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:26:06,273 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:26:06,275 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:26:06,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:26:06,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:26:06,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:26:06,289 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:26:06,291 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:26:06,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:26:06,293 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:26:06,294 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:26:06,295 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:26:06,295 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:26:06,296 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:26:06,297 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:26:06,298 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:26:06,299 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:26:06,300 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:26:06,302 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:26:06,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:26:06,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:26:06,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:26:06,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:26:06,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:26:06,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:26:06,311 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:26:06,311 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:26:06,312 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:26:06,312 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:26:06,313 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:26:06,313 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:26:06,314 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:26:06,315 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:26:06,316 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:26:06,317 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:26:06,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:26:06,317 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:26:06,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:26:06,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:26:06,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:26:06,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:26:06,346 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:26:06,358 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:26:06,361 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:26:06,363 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:26:06,363 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:26:06,364 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum01.i_3.bpl [2019-08-05 10:26:06,364 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum01.i_3.bpl' [2019-08-05 10:26:06,399 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:26:06,401 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:26:06,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:26:06,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:26:06,403 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:26:06,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:06" (1/1) ... [2019-08-05 10:26:06,428 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:06" (1/1) ... [2019-08-05 10:26:06,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:26:06,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:26:06,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:26:06,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:26:06,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:06" (1/1) ... [2019-08-05 10:26:06,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:06" (1/1) ... [2019-08-05 10:26:06,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:06" (1/1) ... [2019-08-05 10:26:06,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:06" (1/1) ... [2019-08-05 10:26:06,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:06" (1/1) ... [2019-08-05 10:26:06,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:06" (1/1) ... [2019-08-05 10:26:06,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:06" (1/1) ... [2019-08-05 10:26:06,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:26:06,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:26:06,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:26:06,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:26:06,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:06" (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 10:26:06,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:26:06,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:26:06,769 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:26:06,770 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:26:06,771 INFO L202 PluginConnector]: Adding new model sum01.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:26:06 BoogieIcfgContainer [2019-08-05 10:26:06,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:26:06,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:26:06,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:26:06,776 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:26:06,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum01.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:26:06" (1/2) ... [2019-08-05 10:26:06,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4960a218 and model type sum01.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:26:06, skipping insertion in model container [2019-08-05 10:26:06,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum01.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:26:06" (2/2) ... [2019-08-05 10:26:06,779 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01.i_3.bpl [2019-08-05 10:26:06,789 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:26:06,797 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:26:06,814 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:26:06,844 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:26:06,845 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:26:06,845 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:26:06,845 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:26:06,846 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:26:06,846 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:26:06,846 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:26:06,846 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:26:06,846 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:26:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:26:06,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:26:06,879 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:06,881 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:26:06,883 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:06,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:06,893 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:26:06,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:07,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:26:07,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:07,043 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 10:26:07,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:26:07,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:26:07,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:26:07,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:26:07,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:26:07,063 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:26:07,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:07,103 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:26:07,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:26:07,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:26:07,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:07,116 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:26:07,116 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:26:07,118 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-05 10:26:07,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:26:07,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:26:07,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:26:07,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:26:07,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:26:07,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:07,151 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:26:07,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:26:07,151 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:26:07,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:26:07,152 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:07,152 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:26:07,152 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:07,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:07,153 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:26:07,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:07,187 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:26:07,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:07,369 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-08-05 10:26:07,501 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 10:26:07,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:07,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:26:07,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:26:07,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:26:07,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:26:07,504 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:26:07,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:07,537 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:26:07,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:26:07,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:26:07,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:07,538 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:26:07,538 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:26:07,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:26:07,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:26:07,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:26:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:26:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:26:07,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:26:07,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:07,542 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:26:07,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:26:07,542 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:26:07,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:26:07,543 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:07,543 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:26:07,543 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:07,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:07,544 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:26:07,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:07,568 WARN L254 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:26:07,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:07,691 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 10:26:07,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:07,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:26:07,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:26:07,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:26:07,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:26:07,693 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:26:07,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:07,755 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:26:07,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:26:07,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:26:07,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:07,756 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:26:07,757 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:26:07,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:26:07,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:26:07,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:26:07,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:26:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:26:07,759 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:26:07,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:07,760 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:26:07,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:26:07,760 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:26:07,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:26:07,761 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:07,761 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:26:07,762 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:07,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:07,762 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:26:07,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:07,785 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:26:07,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:08,054 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 10:26:08,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:08,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:26:08,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:26:08,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:26:08,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:26:08,056 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:26:08,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:08,232 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:26:08,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:26:08,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:26:08,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:08,233 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:26:08,233 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:26:08,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:26:08,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:26:08,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:26:08,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:26:08,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:26:08,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:26:08,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:08,236 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:26:08,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:26:08,236 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:26:08,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:26:08,237 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:08,237 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:26:08,237 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:08,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:08,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:26:08,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:08,278 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:26:08,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:08,424 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 10:26:08,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:08,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:26:08,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:26:08,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:26:08,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:26:08,426 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:26:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:08,497 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:26:08,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:26:08,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:26:08,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:08,499 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:26:08,499 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:26:08,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:26:08,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:26:08,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:26:08,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:26:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:26:08,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:26:08,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:08,504 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:26:08,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:26:08,505 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:26:08,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:26:08,505 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:08,506 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:26:08,506 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:08,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:08,506 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:26:08,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:08,533 WARN L254 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:26:08,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:08,817 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 10:26:08,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:08,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:26:08,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:26:08,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:26:08,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:26:08,820 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:26:08,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:08,941 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:26:08,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:26:08,941 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:26:08,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:08,942 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:26:08,942 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:26:08,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:26:08,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:26:08,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:26:08,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:26:08,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:26:08,945 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:26:08,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:08,946 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:26:08,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:26:08,946 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:26:08,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:26:08,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:08,947 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:26:08,947 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:08,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:08,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:26:08,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:08,970 WARN L254 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:26:08,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:09,459 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 10:26:09,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:09,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:26:09,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:26:09,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:26:09,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:26:09,461 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:26:09,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:09,566 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:26:09,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:26:09,567 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:26:09,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:09,567 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:26:09,568 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:26:09,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:26:09,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:26:09,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:26:09,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:26:09,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:26:09,571 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:26:09,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:09,572 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:26:09,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:26:09,572 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:26:09,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:26:09,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:09,573 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:26:09,573 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:09,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:09,573 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:26:09,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:09,611 WARN L254 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:26:09,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:09,893 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 10:26:09,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:09,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:26:09,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:26:09,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:26:09,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:26:09,895 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:26:10,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:10,041 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:26:10,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:26:10,042 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:26:10,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:10,043 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:26:10,043 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:26:10,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:26:10,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:26:10,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:26:10,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:26:10,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:26:10,047 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:26:10,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:10,047 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:26:10,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:26:10,048 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:26:10,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:26:10,048 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:10,049 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:26:10,049 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:10,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:10,049 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:26:10,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:10,098 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:26:10,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:10,302 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 10:26:10,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:10,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:26:10,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:26:10,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:26:10,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:26:10,304 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:26:10,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:10,472 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:26:10,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:26:10,473 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:26:10,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:10,473 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:26:10,473 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:26:10,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:26:10,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:26:10,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:26:10,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:26:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:26:10,477 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:26:10,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:10,478 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:26:10,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:26:10,478 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:26:10,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:26:10,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:10,478 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:26:10,479 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:10,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:10,479 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:26:10,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:10,502 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:26:10,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:10,875 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 10:26:10,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:26:10,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:26:10,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:26:10,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:26:10,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:26:10,876 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:26:10,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:10,982 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:26:10,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:26:10,983 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:26:10,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:10,984 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:26:10,984 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:26:10,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:26:10,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:26:10,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:26:10,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:26:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:26:10,987 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:26:10,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:10,988 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:26:10,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:26:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:26:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:26:10,988 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:26:10,988 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:26:10,989 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:26:10,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:26:10,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:26:10,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:26:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:26:11,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:26:11,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:26:11,203 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:26:11,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:26:11,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-08-05 10:26:11,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:26:11,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:26:11,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:26:11,206 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2019-08-05 10:26:11,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:26:11,245 INFO L93 Difference]: Finished difference Result 11 states and 10 transitions. [2019-08-05 10:26:11,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:26:11,246 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-08-05 10:26:11,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:26:11,246 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:26:11,247 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:26:11,247 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 10:26:11,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:26:11,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:26:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:26:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:26:11,249 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2019-08-05 10:26:11,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:26:11,249 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:26:11,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:26:11,249 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:26:11,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:26:11,254 INFO L202 PluginConnector]: Adding new model sum01.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:26:11 BoogieIcfgContainer [2019-08-05 10:26:11,254 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:26:11,256 INFO L168 Benchmark]: Toolchain (without parser) took 4855.11 ms. Allocated memory was 132.6 MB in the beginning and 195.6 MB in the end (delta: 62.9 MB). Free memory was 109.1 MB in the beginning and 110.1 MB in the end (delta: -1.1 MB). Peak memory consumption was 61.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:26:11,257 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 132.6 MB. Free memory was 110.3 MB in the beginning and 110.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:26:11,258 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.48 ms. Allocated memory is still 132.6 MB. Free memory was 108.9 MB in the beginning and 107.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:26:11,259 INFO L168 Benchmark]: Boogie Preprocessor took 23.51 ms. Allocated memory is still 132.6 MB. Free memory was 107.3 MB in the beginning and 106.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:26:11,260 INFO L168 Benchmark]: RCFGBuilder took 309.83 ms. Allocated memory is still 132.6 MB. Free memory was 106.1 MB in the beginning and 96.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:26:11,261 INFO L168 Benchmark]: TraceAbstraction took 4481.60 ms. Allocated memory was 132.6 MB in the beginning and 195.6 MB in the end (delta: 62.9 MB). Free memory was 96.2 MB in the beginning and 110.1 MB in the end (delta: -13.9 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:26:11,264 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 132.6 MB. Free memory was 110.3 MB in the beginning and 110.1 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 35.48 ms. Allocated memory is still 132.6 MB. Free memory was 108.9 MB in the beginning and 107.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.51 ms. Allocated memory is still 132.6 MB. Free memory was 107.3 MB in the beginning and 106.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 309.83 ms. Allocated memory is still 132.6 MB. Free memory was 106.1 MB in the beginning and 96.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4481.60 ms. Allocated memory was 132.6 MB in the beginning and 195.6 MB in the end (delta: 62.9 MB). Free memory was 96.2 MB in the beginning and 110.1 MB in the end (delta: -13.9 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: 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, 4.4s OverallTime, 11 OverallIterations, 10 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 31 SDtfs, 0 SDslu, 55 SDs, 0 SdLazy, 517 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=10, 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, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 3710 SizeOfPredicates, 49 NumberOfNonLiveVariables, 506 ConjunctsInSsa, 270 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 55/220 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...