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/vogal.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:25:49,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:25:49,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:25:49,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:25:49,268 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:25:49,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:25:49,271 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:25:49,272 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:25:49,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:25:49,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:25:49,276 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:25:49,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:25:49,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:25:49,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:25:49,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:25:49,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:25:49,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:25:49,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:25:49,283 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:25:49,285 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:25:49,287 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:25:49,288 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:25:49,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:25:49,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:25:49,293 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:25:49,293 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:25:49,293 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:25:49,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:25:49,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:25:49,296 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:25:49,296 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:25:49,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:25:49,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:25:49,298 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:25:49,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:25:49,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:25:49,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:25:49,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:25:49,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:25:49,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:25:49,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:25:49,329 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:25:49,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:25:49,345 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:25:49,347 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:25:49,347 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:25:49,348 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl [2019-08-05 10:25:49,348 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl' [2019-08-05 10:25:49,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:25:49,404 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:25:49,405 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:25:49,405 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:25:49,405 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:25:49,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:49" (1/1) ... [2019-08-05 10:25:49,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:49" (1/1) ... [2019-08-05 10:25:49,446 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:25:49,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:25:49,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:25:49,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:25:49,458 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:49" (1/1) ... [2019-08-05 10:25:49,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:49" (1/1) ... [2019-08-05 10:25:49,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:49" (1/1) ... [2019-08-05 10:25:49,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:49" (1/1) ... [2019-08-05 10:25:49,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:49" (1/1) ... [2019-08-05 10:25:49,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:49" (1/1) ... [2019-08-05 10:25:49,472 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:49" (1/1) ... [2019-08-05 10:25:49,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:25:49,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:25:49,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:25:49,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:25:49,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:49" (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:25:49,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:25:49,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:25:49,790 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-05 10:25:49,793 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:25:49,793 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-08-05 10:25:49,794 INFO L202 PluginConnector]: Adding new model vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:25:49 BoogieIcfgContainer [2019-08-05 10:25:49,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:25:49,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:25:49,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:25:49,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:25:49,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:25:49" (1/2) ... [2019-08-05 10:25:49,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b92195f and model type vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:25:49, skipping insertion in model container [2019-08-05 10:25:49,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:25:49" (2/2) ... [2019-08-05 10:25:49,803 INFO L109 eAbstractionObserver]: Analyzing ICFG vogal.i_5.bpl [2019-08-05 10:25:49,815 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:25:49,824 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:25:49,839 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:25:49,863 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:25:49,864 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:25:49,864 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:25:49,865 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:25:49,865 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:25:49,865 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:25:49,865 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:25:49,865 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:25:49,866 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:25:49,877 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 10:25:49,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:25:49,885 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:49,886 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:25:49,888 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:49,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:49,894 INFO L82 PathProgramCache]: Analyzing trace with hash 28790250, now seen corresponding path program 1 times [2019-08-05 10:25:49,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:49,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:25:50,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:50,039 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:25:50,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:25:50,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:25:50,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:25:50,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:25:50,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:25:50,063 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-08-05 10:25:50,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:50,209 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-08-05 10:25:50,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:25:50,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 10:25:50,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:50,223 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:25:50,223 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:25:50,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:25:50,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:25:50,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-08-05 10:25:50,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:25:50,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-08-05 10:25:50,251 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 5 [2019-08-05 10:25:50,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:50,251 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-08-05 10:25:50,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:25:50,252 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2019-08-05 10:25:50,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:25:50,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:50,253 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:25:50,253 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:50,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:50,253 INFO L82 PathProgramCache]: Analyzing trace with hash 894129427, now seen corresponding path program 1 times [2019-08-05 10:25:50,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:50,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:25:50,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:50,329 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:25:50,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:50,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:25:50,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:25:50,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:25:50,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:25:50,332 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 4 states. [2019-08-05 10:25:50,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:50,453 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2019-08-05 10:25:50,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:25:50,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 10:25:50,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:50,455 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:25:50,455 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:25:50,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:25:50,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:25:50,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 9. [2019-08-05 10:25:50,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:25:50,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-08-05 10:25:50,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 6 [2019-08-05 10:25:50,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:50,459 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-08-05 10:25:50,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:25:50,459 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2019-08-05 10:25:50,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:25:50,460 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:50,460 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 10:25:50,460 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:50,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:50,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1949840138, now seen corresponding path program 2 times [2019-08-05 10:25:50,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:50,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:25:50,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:50,548 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:25:50,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:50,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:25:50,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:25:50,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:25:50,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:25:50,550 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 5 states. [2019-08-05 10:25:50,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:50,900 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2019-08-05 10:25:50,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:25:50,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 10:25:50,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:50,902 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:25:50,902 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:25:50,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:25:50,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:25:50,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 10. [2019-08-05 10:25:50,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:25:50,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-08-05 10:25:50,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2019-08-05 10:25:50,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:50,907 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-08-05 10:25:50,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:25:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2019-08-05 10:25:50,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:25:50,908 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:50,908 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2019-08-05 10:25:50,908 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:50,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:50,909 INFO L82 PathProgramCache]: Analyzing trace with hash 317133811, now seen corresponding path program 3 times [2019-08-05 10:25:50,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:50,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:25:50,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:51,037 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:25:51,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:51,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:25:51,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:25:51,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:25:51,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:25:51,040 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 6 states. [2019-08-05 10:25:51,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:51,273 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2019-08-05 10:25:51,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:25:51,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 10:25:51,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:51,277 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:25:51,277 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:25:51,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:25:51,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:25:51,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 11. [2019-08-05 10:25:51,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:25:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-08-05 10:25:51,281 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 8 [2019-08-05 10:25:51,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:51,281 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-08-05 10:25:51,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:25:51,282 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2019-08-05 10:25:51,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:25:51,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:51,282 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2019-08-05 10:25:51,283 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:51,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:51,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1242845226, now seen corresponding path program 4 times [2019-08-05 10:25:51,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:51,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:25:51,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:51,410 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:25:51,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:51,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:25:51,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:25:51,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:25:51,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:25:51,411 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 7 states. [2019-08-05 10:25:51,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:51,658 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-08-05 10:25:51,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:25:51,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-08-05 10:25:51,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:51,660 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:25:51,660 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:25:51,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:25:51,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:25:51,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 12. [2019-08-05 10:25:51,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:25:51,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-08-05 10:25:51,664 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 9 [2019-08-05 10:25:51,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:51,665 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-08-05 10:25:51,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:25:51,666 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2019-08-05 10:25:51,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:25:51,666 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:51,666 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2019-08-05 10:25:51,667 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:51,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:51,667 INFO L82 PathProgramCache]: Analyzing trace with hash -124871981, now seen corresponding path program 5 times [2019-08-05 10:25:51,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:51,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:25:51,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:51,986 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:25:51,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:51,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:25:51,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:25:51,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:25:51,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:25:51,990 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand 8 states. [2019-08-05 10:25:52,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:52,294 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2019-08-05 10:25:52,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:25:52,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-08-05 10:25:52,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:52,300 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:25:52,300 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:25:52,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:25:52,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:25:52,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 13. [2019-08-05 10:25:52,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:25:52,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-08-05 10:25:52,304 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 10 [2019-08-05 10:25:52,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:52,304 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-08-05 10:25:52,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:25:52,305 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2019-08-05 10:25:52,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:25:52,305 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:52,305 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2019-08-05 10:25:52,306 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:52,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:52,306 INFO L82 PathProgramCache]: Analyzing trace with hash 425567562, now seen corresponding path program 6 times [2019-08-05 10:25:52,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:52,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:25:52,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:52,478 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:25:52,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:52,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:25:52,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:25:52,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:25:52,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:25:52,480 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand 9 states. [2019-08-05 10:25:53,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:53,013 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2019-08-05 10:25:53,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:25:53,014 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-08-05 10:25:53,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:53,015 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:25:53,016 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:25:53,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:25:53,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:25:53,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 14. [2019-08-05 10:25:53,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:25:53,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-08-05 10:25:53,022 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 11 [2019-08-05 10:25:53,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:53,023 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-08-05 10:25:53,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:25:53,024 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2019-08-05 10:25:53,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:25:53,025 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:53,025 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1] [2019-08-05 10:25:53,027 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:53,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:53,027 INFO L82 PathProgramCache]: Analyzing trace with hash 309324211, now seen corresponding path program 7 times [2019-08-05 10:25:53,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:53,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:25:53,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:53,219 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:25:53,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:53,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:25:53,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:25:53,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:25:53,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:25:53,220 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 10 states. [2019-08-05 10:25:53,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:53,733 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2019-08-05 10:25:53,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:25:53,734 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-08-05 10:25:53,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:53,735 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:25:53,735 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:25:53,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:25:53,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:25:53,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 15. [2019-08-05 10:25:53,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:25:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-08-05 10:25:53,740 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 12 [2019-08-05 10:25:53,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:53,740 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-08-05 10:25:53,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:25:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2019-08-05 10:25:53,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:25:53,741 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:53,741 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1] [2019-08-05 10:25:53,741 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:53,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:53,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1000747626, now seen corresponding path program 8 times [2019-08-05 10:25:53,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:53,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:25:53,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:53,912 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:25:53,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:53,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:25:53,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:25:53,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:25:53,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:25:53,914 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand 11 states. [2019-08-05 10:25:54,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:54,345 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2019-08-05 10:25:54,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:25:54,347 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2019-08-05 10:25:54,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:54,348 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:25:54,348 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:25:54,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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:25:54,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:25:54,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 16. [2019-08-05 10:25:54,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:25:54,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-08-05 10:25:54,354 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 13 [2019-08-05 10:25:54,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:54,354 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-08-05 10:25:54,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:25:54,355 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2019-08-05 10:25:54,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:25:54,355 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:54,355 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1] [2019-08-05 10:25:54,356 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:54,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:54,356 INFO L82 PathProgramCache]: Analyzing trace with hash 960037011, now seen corresponding path program 9 times [2019-08-05 10:25:54,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:54,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:25:54,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:54,781 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:25:54,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:54,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:25:54,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:25:54,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:25:54,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:25:54,783 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 12 states. [2019-08-05 10:25:55,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:55,333 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2019-08-05 10:25:55,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:25:55,333 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2019-08-05 10:25:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:55,334 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:25:55,335 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:25:55,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 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:25:55,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:25:55,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 17. [2019-08-05 10:25:55,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:25:55,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-08-05 10:25:55,339 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2019-08-05 10:25:55,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:55,339 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-08-05 10:25:55,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:25:55,340 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-08-05 10:25:55,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:25:55,340 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:55,340 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2019-08-05 10:25:55,340 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:55,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:55,341 INFO L82 PathProgramCache]: Analyzing trace with hash -301992054, now seen corresponding path program 10 times [2019-08-05 10:25:55,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:55,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:25:55,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:25:55,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:25:55,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:25:55,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:25:55,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:25:55,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:25:55,461 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 3 states. [2019-08-05 10:25:55,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:55,479 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-08-05 10:25:55,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:25:55,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-08-05 10:25:55,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:55,480 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:25:55,480 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:25:55,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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:25:55,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:25:55,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:25:55,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:25:55,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-08-05 10:25:55,484 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 15 [2019-08-05 10:25:55,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:55,484 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-08-05 10:25:55,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:25:55,484 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-08-05 10:25:55,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:25:55,485 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:55,485 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:25:55,485 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:55,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:55,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1313318257, now seen corresponding path program 1 times [2019-08-05 10:25:55,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:55,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:25:55,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:25:55,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:55,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:25:55,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:25:55,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:25:55,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:25:55,627 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 4 states. [2019-08-05 10:25:55,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:55,705 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-08-05 10:25:55,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:25:55,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-08-05 10:25:55,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:55,709 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:25:55,709 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:25:55,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:25:55,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:25:55,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-08-05 10:25:55,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:25:55,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-08-05 10:25:55,712 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 18 [2019-08-05 10:25:55,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:55,713 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-08-05 10:25:55,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:25:55,713 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-08-05 10:25:55,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:25:55,713 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:55,714 INFO L399 BasicCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:25:55,714 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:55,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:55,714 INFO L82 PathProgramCache]: Analyzing trace with hash 2058229394, now seen corresponding path program 2 times [2019-08-05 10:25:55,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:55,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:25:55,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:55,805 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:25:55,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:55,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:25:55,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:25:55,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:25:55,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:25:55,807 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 5 states. [2019-08-05 10:25:55,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:55,863 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-08-05 10:25:55,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:25:55,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-08-05 10:25:55,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:55,864 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:25:55,864 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:25:55,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:25:55,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:25:55,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:25:55,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:25:55,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-08-05 10:25:55,868 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 19 [2019-08-05 10:25:55,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:55,868 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-08-05 10:25:55,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:25:55,868 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-08-05 10:25:55,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:25:55,869 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:55,869 INFO L399 BasicCegarLoop]: trace histogram [10, 3, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:25:55,869 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:55,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:55,870 INFO L82 PathProgramCache]: Analyzing trace with hash -619329135, now seen corresponding path program 3 times [2019-08-05 10:25:55,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:55,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:25:55,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:25:56,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:56,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:25:56,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:25:56,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:25:56,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:25:56,227 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 6 states. [2019-08-05 10:25:56,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:56,315 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-08-05 10:25:56,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:25:56,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-08-05 10:25:56,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:56,316 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:25:56,316 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:25:56,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:25:56,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:25:56,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:25:56,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:25:56,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-08-05 10:25:56,319 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 20 [2019-08-05 10:25:56,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:56,319 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-08-05 10:25:56,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:25:56,319 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-08-05 10:25:56,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:25:56,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:56,320 INFO L399 BasicCegarLoop]: trace histogram [10, 4, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:25:56,320 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:56,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:56,321 INFO L82 PathProgramCache]: Analyzing trace with hash -2019264910, now seen corresponding path program 4 times [2019-08-05 10:25:56,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:56,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:25:56,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:25:56,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:56,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:25:56,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:25:56,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:25:56,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:25:56,839 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 7 states. [2019-08-05 10:25:56,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:56,891 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-08-05 10:25:56,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:25:56,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-08-05 10:25:56,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:56,893 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:25:56,893 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:25:56,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:25:56,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:25:56,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:25:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:25:56,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-08-05 10:25:56,896 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 21 [2019-08-05 10:25:56,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:56,897 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-08-05 10:25:56,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:25:56,897 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-08-05 10:25:56,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:25:56,897 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:56,898 INFO L399 BasicCegarLoop]: trace histogram [10, 5, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:25:56,898 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:56,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:56,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1827366321, now seen corresponding path program 5 times [2019-08-05 10:25:56,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:56,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:25:56,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:57,093 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:25:57,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:57,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:25:57,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:25:57,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:25:57,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:25:57,094 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 8 states. [2019-08-05 10:25:57,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:57,141 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-08-05 10:25:57,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:25:57,142 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-08-05 10:25:57,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:57,142 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:25:57,143 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:25:57,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:25:57,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:25:57,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:25:57,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:25:57,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-08-05 10:25:57,145 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2019-08-05 10:25:57,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:57,146 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-08-05 10:25:57,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:25:57,146 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-08-05 10:25:57,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:25:57,147 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:57,147 INFO L399 BasicCegarLoop]: trace histogram [10, 6, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:25:57,147 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:57,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:57,147 INFO L82 PathProgramCache]: Analyzing trace with hash 813850194, now seen corresponding path program 6 times [2019-08-05 10:25:57,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:57,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:25:57,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:25:57,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:57,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:25:57,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:25:57,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:25:57,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:25:57,438 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 9 states. [2019-08-05 10:25:57,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:57,531 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-08-05 10:25:57,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:25:57,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-08-05 10:25:57,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:57,532 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:25:57,532 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:25:57,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:25:57,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:25:57,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:25:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:25:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-08-05 10:25:57,536 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 23 [2019-08-05 10:25:57,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:57,536 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-08-05 10:25:57,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:25:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-08-05 10:25:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:25:57,537 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:57,537 INFO L399 BasicCegarLoop]: trace histogram [10, 7, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:25:57,537 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:57,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:57,538 INFO L82 PathProgramCache]: Analyzing trace with hash -540378671, now seen corresponding path program 7 times [2019-08-05 10:25:57,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:57,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:25:57,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:57,830 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:25:57,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:57,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:25:57,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:25:57,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:25:57,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:25:57,833 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 10 states. [2019-08-05 10:25:57,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:57,917 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2019-08-05 10:25:57,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:25:57,917 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-08-05 10:25:57,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:57,918 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:25:57,918 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:25:57,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 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:25:57,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:25:57,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:25:57,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:25:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-08-05 10:25:57,922 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 24 [2019-08-05 10:25:57,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:57,922 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-08-05 10:25:57,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:25:57,922 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-08-05 10:25:57,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:25:57,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:57,923 INFO L399 BasicCegarLoop]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:25:57,924 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:57,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:57,924 INFO L82 PathProgramCache]: Analyzing trace with hash 428199474, now seen corresponding path program 8 times [2019-08-05 10:25:57,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:57,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:25:57,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:25:58,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:58,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:25:58,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:25:58,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:25:58,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:25:58,078 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 11 states. [2019-08-05 10:25:58,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:58,298 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-08-05 10:25:58,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:25:58,299 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-08-05 10:25:58,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:58,300 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:25:58,300 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:25:58,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 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:25:58,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:25:58,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:25:58,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:25:58,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-08-05 10:25:58,304 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 25 [2019-08-05 10:25:58,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:58,304 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-08-05 10:25:58,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:25:58,305 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-08-05 10:25:58,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:25:58,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:58,306 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:25:58,306 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:58,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:58,307 INFO L82 PathProgramCache]: Analyzing trace with hash 389350897, now seen corresponding path program 9 times [2019-08-05 10:25:58,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:58,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:25:58,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:58,744 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:25:58,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:25:58,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:25:58,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:25:58,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:25:58,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:25:58,746 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 12 states. [2019-08-05 10:25:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:58,917 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-08-05 10:25:58,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:25:58,918 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-08-05 10:25:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:58,918 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:25:58,918 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:25:58,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:25:58,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:25:58,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:25:58,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:25:58,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-08-05 10:25:58,921 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 26 [2019-08-05 10:25:58,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:58,922 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-08-05 10:25:58,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:25:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-08-05 10:25:58,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:25:58,923 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:25:58,924 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:25:58,924 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:25:58,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:25:58,924 INFO L82 PathProgramCache]: Analyzing trace with hash -814954990, now seen corresponding path program 10 times [2019-08-05 10:25:58,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:25:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:25:58,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:25:58,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:25:59,090 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-08-05 10:25:59,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:25:59,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:25:59,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:25:59,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:25:59,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:25:59,091 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 3 states. [2019-08-05 10:25:59,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:25:59,147 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-08-05 10:25:59,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:25:59,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-08-05 10:25:59,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:25:59,148 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:25:59,148 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:25:59,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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:25:59,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:25:59,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:25:59,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:25:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:25:59,149 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-08-05 10:25:59,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:25:59,149 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:25:59,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:25:59,150 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:25:59,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:25:59,154 INFO L202 PluginConnector]: Adding new model vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:25:59 BoogieIcfgContainer [2019-08-05 10:25:59,155 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:25:59,157 INFO L168 Benchmark]: Toolchain (without parser) took 9752.62 ms. Allocated memory was 134.7 MB in the beginning and 229.6 MB in the end (delta: 94.9 MB). Free memory was 112.0 MB in the beginning and 133.4 MB in the end (delta: -21.4 MB). Peak memory consumption was 73.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:59,158 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 134.7 MB. Free memory was 113.5 MB in the beginning and 113.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:25:59,159 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.14 ms. Allocated memory is still 134.7 MB. Free memory was 111.8 MB in the beginning and 110.2 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:25:59,159 INFO L168 Benchmark]: Boogie Preprocessor took 27.87 ms. Allocated memory is still 134.7 MB. Free memory was 110.2 MB in the beginning and 108.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:59,160 INFO L168 Benchmark]: RCFGBuilder took 312.40 ms. Allocated memory is still 134.7 MB. Free memory was 108.9 MB in the beginning and 97.6 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:59,161 INFO L168 Benchmark]: TraceAbstraction took 9358.41 ms. Allocated memory was 134.7 MB in the beginning and 229.6 MB in the end (delta: 94.9 MB). Free memory was 97.4 MB in the beginning and 133.4 MB in the end (delta: -36.0 MB). Peak memory consumption was 58.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:25:59,165 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 134.7 MB. Free memory was 113.5 MB in the beginning and 113.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.14 ms. Allocated memory is still 134.7 MB. Free memory was 111.8 MB in the beginning and 110.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 27.87 ms. Allocated memory is still 134.7 MB. Free memory was 110.2 MB in the beginning and 108.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 312.40 ms. Allocated memory is still 134.7 MB. Free memory was 108.9 MB in the beginning and 97.6 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9358.41 ms. Allocated memory was 134.7 MB in the beginning and 229.6 MB in the end (delta: 94.9 MB). Free memory was 97.4 MB in the beginning and 133.4 MB in the end (delta: -36.0 MB). Peak memory consumption was 58.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 102]: 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, 8 locations, 1 error locations. SAFE Result, 9.2s OverallTime, 21 OverallIterations, 10 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 190 SDtfs, 222 SDslu, 716 SDs, 0 SdLazy, 2647 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=20, 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, 21 MinimizatonAttempts, 221 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 335 NumberOfCodeBlocks, 335 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 314 ConstructedInterpolants, 1 QuantifiedInterpolants, 9720 SizeOfPredicates, 26 NumberOfNonLiveVariables, 1942 ConjunctsInSsa, 251 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 670/1000 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...