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-04 21:38:54,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:38:54,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:38:54,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:38:54,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:38:54,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:38:54,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:38:54,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:38:54,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:38:54,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:38:54,714 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:38:54,715 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:38:54,715 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:38:54,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:38:54,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:38:54,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:38:54,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:38:54,721 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:38:54,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:38:54,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:38:54,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:38:54,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:38:54,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:38:54,743 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:38:54,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:38:54,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:38:54,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:38:54,748 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:38:54,749 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:38:54,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:38:54,750 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:38:54,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:38:54,754 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:38:54,755 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:38:54,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:38:54,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:38:54,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:38:54,760 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:38:54,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:38:54,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:38:54,762 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:38:54,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:38:54,811 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:38:54,814 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:38:54,816 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:38:54,816 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:38:54,817 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-04 21:38:54,817 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/vogal.i_5.bpl' [2019-08-04 21:38:54,857 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:38:54,859 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:38:54,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:54,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:38:54,860 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:38:54,876 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 04.08 09:38:54" (1/1) ... [2019-08-04 21:38:54,888 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 04.08 09:38:54" (1/1) ... [2019-08-04 21:38:54,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:54,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:38:54,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:38:54,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:38:54,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:54" (1/1) ... [2019-08-04 21:38:54,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:54" (1/1) ... [2019-08-04 21:38:54,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:54" (1/1) ... [2019-08-04 21:38:54,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:54" (1/1) ... [2019-08-04 21:38:54,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:54" (1/1) ... [2019-08-04 21:38:54,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:54" (1/1) ... [2019-08-04 21:38:54,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:54" (1/1) ... [2019-08-04 21:38:54,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:38:54,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:38:54,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:38:54,921 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:38:54,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-04 21:38:54,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:38:54,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:38:55,370 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-04 21:38:55,381 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:38:55,383 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-08-04 21:38:55,385 INFO L202 PluginConnector]: Adding new model vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:55 BoogieIcfgContainer [2019-08-04 21:38:55,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:38:55,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:38:55,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:38:55,403 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:38:55,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:54" (1/2) ... [2019-08-04 21:38:55,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b7777c1 and model type vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:38:55, skipping insertion in model container [2019-08-04 21:38:55,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:55" (2/2) ... [2019-08-04 21:38:55,410 INFO L109 eAbstractionObserver]: Analyzing ICFG vogal.i_5.bpl [2019-08-04 21:38:55,425 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:38:55,449 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:38:55,479 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:38:55,504 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:38:55,505 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:38:55,505 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:38:55,505 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:38:55,505 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:38:55,505 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:38:55,506 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:38:55,506 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:38:55,506 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:38:55,521 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-04 21:38:55,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:38:55,529 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:55,530 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-04 21:38:55,532 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:55,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:55,539 INFO L82 PathProgramCache]: Analyzing trace with hash 28790250, now seen corresponding path program 1 times [2019-08-04 21:38:55,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:55,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:55,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:55,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:55,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:55,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:38:55,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:55,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:55,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:55,719 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-08-04 21:38:55,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:55,818 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-08-04 21:38:55,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:55,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-04 21:38:55,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:55,831 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:38:55,832 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:38:55,834 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-04 21:38:55,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:38:55,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-08-04 21:38:55,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:38:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-08-04 21:38:55,868 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 5 [2019-08-04 21:38:55,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:55,869 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-08-04 21:38:55,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:55,869 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2019-08-04 21:38:55,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:38:55,870 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:55,870 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-04 21:38:55,871 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:55,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:55,871 INFO L82 PathProgramCache]: Analyzing trace with hash 894129427, now seen corresponding path program 1 times [2019-08-04 21:38:55,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:55,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:38:55,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:55,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:55,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:55,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:38:55,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:38:55,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:38:55,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:55,974 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 4 states. [2019-08-04 21:38:56,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:56,089 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2019-08-04 21:38:56,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:38:56,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-04 21:38:56,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:56,090 INFO L225 Difference]: With dead ends: 17 [2019-08-04 21:38:56,090 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:38:56,091 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-04 21:38:56,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:38:56,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 9. [2019-08-04 21:38:56,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:38:56,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-08-04 21:38:56,095 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 6 [2019-08-04 21:38:56,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:56,095 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-08-04 21:38:56,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:38:56,096 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2019-08-04 21:38:56,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:38:56,096 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:56,096 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-04 21:38:56,097 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:56,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:56,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1949840138, now seen corresponding path program 2 times [2019-08-04 21:38:56,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:56,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:38:56,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:56,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:56,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:56,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:38:56,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:38:56,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:38:56,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:56,222 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 5 states. [2019-08-04 21:38:56,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:56,553 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2019-08-04 21:38:56,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:38:56,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-04 21:38:56,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:56,555 INFO L225 Difference]: With dead ends: 22 [2019-08-04 21:38:56,555 INFO L226 Difference]: Without dead ends: 22 [2019-08-04 21:38:56,555 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-04 21:38:56,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-04 21:38:56,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 10. [2019-08-04 21:38:56,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:38:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-08-04 21:38:56,559 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2019-08-04 21:38:56,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:56,559 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-08-04 21:38:56,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:38:56,559 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2019-08-04 21:38:56,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:38:56,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:56,560 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2019-08-04 21:38:56,560 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:56,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:56,561 INFO L82 PathProgramCache]: Analyzing trace with hash 317133811, now seen corresponding path program 3 times [2019-08-04 21:38:56,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:56,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:38:56,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:56,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:56,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:56,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:38:56,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:38:56,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:38:56,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:38:56,658 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 6 states. [2019-08-04 21:38:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:57,102 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2019-08-04 21:38:57,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:38:57,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-04 21:38:57,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:57,103 INFO L225 Difference]: With dead ends: 27 [2019-08-04 21:38:57,104 INFO L226 Difference]: Without dead ends: 27 [2019-08-04 21:38:57,104 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-04 21:38:57,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-04 21:38:57,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 11. [2019-08-04 21:38:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:38:57,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-08-04 21:38:57,107 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 8 [2019-08-04 21:38:57,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:57,108 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-08-04 21:38:57,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:38:57,108 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2019-08-04 21:38:57,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:38:57,109 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:57,109 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2019-08-04 21:38:57,109 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:57,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:57,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1242845226, now seen corresponding path program 4 times [2019-08-04 21:38:57,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:57,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:38:57,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:57,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:57,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:38:57,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:38:57,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:38:57,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:38:57,266 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 7 states. [2019-08-04 21:38:57,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:57,729 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-08-04 21:38:57,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:38:57,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-08-04 21:38:57,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:57,732 INFO L225 Difference]: With dead ends: 32 [2019-08-04 21:38:57,733 INFO L226 Difference]: Without dead ends: 32 [2019-08-04 21:38:57,734 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-04 21:38:57,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-04 21:38:57,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 12. [2019-08-04 21:38:57,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:38:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-08-04 21:38:57,743 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 9 [2019-08-04 21:38:57,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:57,744 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-08-04 21:38:57,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:38:57,745 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2019-08-04 21:38:57,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:38:57,745 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:57,745 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2019-08-04 21:38:57,746 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:57,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:57,746 INFO L82 PathProgramCache]: Analyzing trace with hash -124871981, now seen corresponding path program 5 times [2019-08-04 21:38:57,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:57,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-04 21:38:57,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:57,938 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:57,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:57,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:38:57,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:38:57,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:38:57,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:38:57,940 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand 8 states. [2019-08-04 21:38:58,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:58,243 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2019-08-04 21:38:58,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:38:58,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-08-04 21:38:58,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:58,245 INFO L225 Difference]: With dead ends: 37 [2019-08-04 21:38:58,245 INFO L226 Difference]: Without dead ends: 37 [2019-08-04 21:38:58,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-04 21:38:58,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-04 21:38:58,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 13. [2019-08-04 21:38:58,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:38:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-08-04 21:38:58,249 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 10 [2019-08-04 21:38:58,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:58,250 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-08-04 21:38:58,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:38:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2019-08-04 21:38:58,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:38:58,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:58,251 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2019-08-04 21:38:58,251 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:58,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:58,251 INFO L82 PathProgramCache]: Analyzing trace with hash 425567562, now seen corresponding path program 6 times [2019-08-04 21:38:58,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:58,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-04 21:38:58,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:58,416 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:58,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:58,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:38:58,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:38:58,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:38:58,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:38:58,418 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand 9 states. [2019-08-04 21:38:58,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:58,947 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2019-08-04 21:38:58,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:38:58,952 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-08-04 21:38:58,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:58,953 INFO L225 Difference]: With dead ends: 42 [2019-08-04 21:38:58,954 INFO L226 Difference]: Without dead ends: 42 [2019-08-04 21:38:58,954 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-04 21:38:58,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-04 21:38:58,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 14. [2019-08-04 21:38:58,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-04 21:38:58,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-08-04 21:38:58,959 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 11 [2019-08-04 21:38:58,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:58,960 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-08-04 21:38:58,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:38:58,961 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2019-08-04 21:38:58,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:38:58,961 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:58,961 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1] [2019-08-04 21:38:58,962 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:58,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:58,963 INFO L82 PathProgramCache]: Analyzing trace with hash 309324211, now seen corresponding path program 7 times [2019-08-04 21:38:58,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:59,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-04 21:38:59,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:59,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:59,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:38:59,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:38:59,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:38:59,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:38:59,183 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 10 states. [2019-08-04 21:38:59,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:59,517 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2019-08-04 21:38:59,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:38:59,518 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-08-04 21:38:59,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:59,519 INFO L225 Difference]: With dead ends: 47 [2019-08-04 21:38:59,519 INFO L226 Difference]: Without dead ends: 47 [2019-08-04 21:38:59,520 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-04 21:38:59,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-04 21:38:59,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 15. [2019-08-04 21:38:59,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:38:59,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-08-04 21:38:59,525 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 12 [2019-08-04 21:38:59,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:59,525 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-08-04 21:38:59,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:38:59,525 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2019-08-04 21:38:59,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:38:59,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:59,526 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1] [2019-08-04 21:38:59,526 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:59,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:59,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1000747626, now seen corresponding path program 8 times [2019-08-04 21:38:59,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:59,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-04 21:38:59,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:59,729 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:59,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:59,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:38:59,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:38:59,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:38:59,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:38:59,731 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand 11 states. [2019-08-04 21:39:00,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:00,158 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2019-08-04 21:39:00,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:39:00,158 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2019-08-04 21:39:00,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:00,160 INFO L225 Difference]: With dead ends: 52 [2019-08-04 21:39:00,160 INFO L226 Difference]: Without dead ends: 52 [2019-08-04 21:39:00,161 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-04 21:39:00,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-04 21:39:00,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 16. [2019-08-04 21:39:00,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-04 21:39:00,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-08-04 21:39:00,164 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 13 [2019-08-04 21:39:00,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:00,165 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-08-04 21:39:00,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:39:00,165 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2019-08-04 21:39:00,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:39:00,166 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:00,166 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1] [2019-08-04 21:39:00,166 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:00,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:00,167 INFO L82 PathProgramCache]: Analyzing trace with hash 960037011, now seen corresponding path program 9 times [2019-08-04 21:39:00,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:00,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-04 21:39:00,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:00,580 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-04 21:39:00,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:00,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:39:00,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:39:00,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:39:00,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:39:00,582 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 12 states. [2019-08-04 21:39:01,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:01,125 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2019-08-04 21:39:01,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:39:01,126 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2019-08-04 21:39:01,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:01,127 INFO L225 Difference]: With dead ends: 57 [2019-08-04 21:39:01,127 INFO L226 Difference]: Without dead ends: 57 [2019-08-04 21:39:01,128 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-04 21:39:01,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-04 21:39:01,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 17. [2019-08-04 21:39:01,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:39:01,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-08-04 21:39:01,132 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2019-08-04 21:39:01,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:01,132 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-08-04 21:39:01,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:39:01,132 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-08-04 21:39:01,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:39:01,133 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:01,133 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2019-08-04 21:39:01,133 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:01,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:01,134 INFO L82 PathProgramCache]: Analyzing trace with hash -301992054, now seen corresponding path program 10 times [2019-08-04 21:39:01,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:01,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:39:01,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:01,307 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-04 21:39:01,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:39:01,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:39:01,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:39:01,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:39:01,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:39:01,314 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 3 states. [2019-08-04 21:39:01,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:01,366 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-08-04 21:39:01,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:39:01,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-08-04 21:39:01,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:01,367 INFO L225 Difference]: With dead ends: 19 [2019-08-04 21:39:01,367 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:39:01,368 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-04 21:39:01,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:39:01,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-04 21:39:01,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:39:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-08-04 21:39:01,371 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 15 [2019-08-04 21:39:01,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:01,372 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-08-04 21:39:01,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:39:01,372 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-08-04 21:39:01,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:39:01,373 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:01,373 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:39:01,373 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:01,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:01,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1313318257, now seen corresponding path program 1 times [2019-08-04 21:39:01,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:01,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:39:01,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:01,439 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-04 21:39:01,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:01,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:39:01,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:39:01,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:39:01,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:39:01,440 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 4 states. [2019-08-04 21:39:01,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:01,460 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-08-04 21:39:01,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:39:01,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-08-04 21:39:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:01,465 INFO L225 Difference]: With dead ends: 21 [2019-08-04 21:39:01,465 INFO L226 Difference]: Without dead ends: 21 [2019-08-04 21:39:01,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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-04 21:39:01,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-04 21:39:01,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-08-04 21:39:01,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-04 21:39:01,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-08-04 21:39:01,469 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 18 [2019-08-04 21:39:01,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:01,469 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-08-04 21:39:01,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:39:01,470 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-08-04 21:39:01,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-04 21:39:01,470 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:01,471 INFO L399 BasicCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:39:01,471 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:01,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:01,471 INFO L82 PathProgramCache]: Analyzing trace with hash 2058229394, now seen corresponding path program 2 times [2019-08-04 21:39:01,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:01,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:39:01,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:01,580 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-04 21:39:01,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:01,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:39:01,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:39:01,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:39:01,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:39:01,582 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 5 states. [2019-08-04 21:39:01,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:01,608 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-08-04 21:39:01,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:39:01,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-08-04 21:39:01,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:01,610 INFO L225 Difference]: With dead ends: 21 [2019-08-04 21:39:01,610 INFO L226 Difference]: Without dead ends: 21 [2019-08-04 21:39:01,610 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-04 21:39:01,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-04 21:39:01,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-04 21:39:01,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:39:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-08-04 21:39:01,613 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 19 [2019-08-04 21:39:01,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:01,614 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-08-04 21:39:01,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:39:01,614 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-08-04 21:39:01,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:39:01,615 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:01,615 INFO L399 BasicCegarLoop]: trace histogram [10, 3, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:39:01,615 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:01,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:01,616 INFO L82 PathProgramCache]: Analyzing trace with hash -619329135, now seen corresponding path program 3 times [2019-08-04 21:39:01,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:01,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:39:01,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:01,961 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-04 21:39:01,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:01,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:39:01,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:39:01,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:39:01,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:39:01,963 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 6 states. [2019-08-04 21:39:01,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:01,992 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-08-04 21:39:01,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:39:01,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-08-04 21:39:01,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:01,993 INFO L225 Difference]: With dead ends: 22 [2019-08-04 21:39:01,993 INFO L226 Difference]: Without dead ends: 22 [2019-08-04 21:39:01,994 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-04 21:39:01,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-04 21:39:01,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-04 21:39:01,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-04 21:39:01,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-08-04 21:39:01,997 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 20 [2019-08-04 21:39:01,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:01,997 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-08-04 21:39:01,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:39:01,998 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-08-04 21:39:01,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:39:01,998 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:01,998 INFO L399 BasicCegarLoop]: trace histogram [10, 4, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:39:01,999 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:01,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:01,999 INFO L82 PathProgramCache]: Analyzing trace with hash -2019264910, now seen corresponding path program 4 times [2019-08-04 21:39:02,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:02,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:39:02,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:02,236 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-04 21:39:02,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:02,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:39:02,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:39:02,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:39:02,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:39:02,239 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 7 states. [2019-08-04 21:39:02,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:02,275 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-08-04 21:39:02,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:39:02,276 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-08-04 21:39:02,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:02,277 INFO L225 Difference]: With dead ends: 23 [2019-08-04 21:39:02,277 INFO L226 Difference]: Without dead ends: 23 [2019-08-04 21:39:02,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:39:02,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-04 21:39:02,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-04 21:39:02,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-04 21:39:02,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-08-04 21:39:02,279 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 21 [2019-08-04 21:39:02,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:02,280 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-08-04 21:39:02,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:39:02,280 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-08-04 21:39:02,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:39:02,281 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:02,281 INFO L399 BasicCegarLoop]: trace histogram [10, 5, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:39:02,281 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:02,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:02,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1827366321, now seen corresponding path program 5 times [2019-08-04 21:39:02,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:02,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-04 21:39:02,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:02,942 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-04 21:39:02,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:02,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:39:02,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:39:02,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:39:02,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:39:02,945 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 8 states. [2019-08-04 21:39:03,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:03,080 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-08-04 21:39:03,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:39:03,081 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-08-04 21:39:03,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:03,081 INFO L225 Difference]: With dead ends: 24 [2019-08-04 21:39:03,082 INFO L226 Difference]: Without dead ends: 24 [2019-08-04 21:39:03,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:39:03,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-04 21:39:03,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-04 21:39:03,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-04 21:39:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-08-04 21:39:03,087 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2019-08-04 21:39:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:03,088 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-08-04 21:39:03,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:39:03,088 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-08-04 21:39:03,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-04 21:39:03,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:03,089 INFO L399 BasicCegarLoop]: trace histogram [10, 6, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:39:03,089 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:03,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:03,089 INFO L82 PathProgramCache]: Analyzing trace with hash 813850194, now seen corresponding path program 6 times [2019-08-04 21:39:03,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:03,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-04 21:39:03,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:03,547 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-04 21:39:03,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:03,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:39:03,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:39:03,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:39:03,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:39:03,549 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 9 states. [2019-08-04 21:39:03,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:03,625 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-08-04 21:39:03,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:39:03,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-08-04 21:39:03,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:03,626 INFO L225 Difference]: With dead ends: 25 [2019-08-04 21:39:03,626 INFO L226 Difference]: Without dead ends: 25 [2019-08-04 21:39:03,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:39:03,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-04 21:39:03,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-04 21:39:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:39:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-08-04 21:39:03,630 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 23 [2019-08-04 21:39:03,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:03,631 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-08-04 21:39:03,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:39:03,631 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-08-04 21:39:03,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:39:03,631 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:03,631 INFO L399 BasicCegarLoop]: trace histogram [10, 7, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:39:03,632 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:03,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:03,632 INFO L82 PathProgramCache]: Analyzing trace with hash -540378671, now seen corresponding path program 7 times [2019-08-04 21:39:03,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:03,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-04 21:39:03,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:03,939 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-04 21:39:03,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:03,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:39:03,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:39:03,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:39:03,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:39:03,942 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 10 states. [2019-08-04 21:39:04,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:04,031 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2019-08-04 21:39:04,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:39:04,032 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-08-04 21:39:04,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:04,041 INFO L225 Difference]: With dead ends: 26 [2019-08-04 21:39:04,041 INFO L226 Difference]: Without dead ends: 26 [2019-08-04 21:39:04,041 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-04 21:39:04,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-04 21:39:04,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-04 21:39:04,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-04 21:39:04,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-08-04 21:39:04,044 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 24 [2019-08-04 21:39:04,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:04,045 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-08-04 21:39:04,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:39:04,046 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-08-04 21:39:04,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:39:04,046 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:04,046 INFO L399 BasicCegarLoop]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:39:04,047 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:04,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:04,047 INFO L82 PathProgramCache]: Analyzing trace with hash 428199474, now seen corresponding path program 8 times [2019-08-04 21:39:04,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:04,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-04 21:39:04,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:04,172 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-04 21:39:04,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:04,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:39:04,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:39:04,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:39:04,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:39:04,174 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 11 states. [2019-08-04 21:39:04,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:04,277 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-08-04 21:39:04,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:39:04,278 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-08-04 21:39:04,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:04,278 INFO L225 Difference]: With dead ends: 27 [2019-08-04 21:39:04,279 INFO L226 Difference]: Without dead ends: 27 [2019-08-04 21:39:04,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:39:04,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-04 21:39:04,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-04 21:39:04,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-04 21:39:04,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-08-04 21:39:04,282 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 25 [2019-08-04 21:39:04,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:04,282 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-08-04 21:39:04,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:39:04,282 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-08-04 21:39:04,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-04 21:39:04,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:04,283 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:39:04,283 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:04,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:04,284 INFO L82 PathProgramCache]: Analyzing trace with hash 389350897, now seen corresponding path program 9 times [2019-08-04 21:39:04,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:04,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-04 21:39:04,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:04,483 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-04 21:39:04,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:04,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:39:04,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:39:04,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:39:04,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:39:04,485 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 12 states. [2019-08-04 21:39:04,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:04,690 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-08-04 21:39:04,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:39:04,691 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-08-04 21:39:04,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:04,691 INFO L225 Difference]: With dead ends: 28 [2019-08-04 21:39:04,691 INFO L226 Difference]: Without dead ends: 28 [2019-08-04 21:39:04,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:39:04,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-04 21:39:04,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-04 21:39:04,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-04 21:39:04,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-08-04 21:39:04,694 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 26 [2019-08-04 21:39:04,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:04,694 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-08-04 21:39:04,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:39:04,694 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-08-04 21:39:04,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-04 21:39:04,695 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:04,695 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:39:04,695 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:04,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:04,695 INFO L82 PathProgramCache]: Analyzing trace with hash -814954990, now seen corresponding path program 10 times [2019-08-04 21:39:04,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:04,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:39:04,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:04,873 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-04 21:39:04,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:39:04,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:39:04,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:39:04,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:39:04,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:39:04,874 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 3 states. [2019-08-04 21:39:04,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:04,883 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-08-04 21:39:04,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:39:04,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-08-04 21:39:04,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:04,884 INFO L225 Difference]: With dead ends: 14 [2019-08-04 21:39:04,884 INFO L226 Difference]: Without dead ends: 0 [2019-08-04 21:39:04,885 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-04 21:39:04,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-04 21:39:04,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-04 21:39:04,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-04 21:39:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-04 21:39:04,886 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-08-04 21:39:04,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:04,886 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-04 21:39:04,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:39:04,886 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-04 21:39:04,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-04 21:39:04,891 INFO L202 PluginConnector]: Adding new model vogal.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:39:04 BoogieIcfgContainer [2019-08-04 21:39:04,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:39:04,894 INFO L168 Benchmark]: Toolchain (without parser) took 10034.19 ms. Allocated memory was 141.0 MB in the beginning and 239.6 MB in the end (delta: 98.6 MB). Free memory was 110.4 MB in the beginning and 143.3 MB in the end (delta: -32.9 MB). Peak memory consumption was 65.7 MB. Max. memory is 7.1 GB. [2019-08-04 21:39:04,895 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory was 111.9 MB in the beginning and 111.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-04 21:39:04,896 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.31 ms. Allocated memory is still 141.0 MB. Free memory was 110.2 MB in the beginning and 108.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-04 21:39:04,896 INFO L168 Benchmark]: Boogie Preprocessor took 23.60 ms. Allocated memory is still 141.0 MB. Free memory was 108.7 MB in the beginning and 107.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:39:04,897 INFO L168 Benchmark]: RCFGBuilder took 465.20 ms. Allocated memory is still 141.0 MB. Free memory was 107.3 MB in the beginning and 96.0 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:39:04,898 INFO L168 Benchmark]: TraceAbstraction took 9503.85 ms. Allocated memory was 141.0 MB in the beginning and 239.6 MB in the end (delta: 98.6 MB). Free memory was 95.8 MB in the beginning and 143.3 MB in the end (delta: -47.5 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:39:04,902 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.22 ms. Allocated memory is still 141.0 MB. Free memory was 111.9 MB in the beginning and 111.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.31 ms. Allocated memory is still 141.0 MB. Free memory was 110.2 MB in the beginning and 108.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.60 ms. Allocated memory is still 141.0 MB. Free memory was 108.7 MB in the beginning and 107.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 465.20 ms. Allocated memory is still 141.0 MB. Free memory was 107.3 MB in the beginning and 96.0 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9503.85 ms. Allocated memory was 141.0 MB in the beginning and 239.6 MB in the end (delta: 98.6 MB). Free memory was 95.8 MB in the beginning and 143.3 MB in the end (delta: -47.5 MB). Peak memory consumption was 51.1 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.3s 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.6s 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.6s 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...