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/overflow1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:36:40,115 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:36:40,117 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:36:40,133 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:36:40,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:36:40,135 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:36:40,137 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:36:40,139 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:36:40,142 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:36:40,144 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:36:40,145 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:36:40,146 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:36:40,146 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:36:40,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:36:40,150 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:36:40,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:36:40,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:36:40,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:36:40,163 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:36:40,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:36:40,170 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:36:40,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:36:40,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:36:40,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:36:40,177 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:36:40,177 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:36:40,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:36:40,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:36:40,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:36:40,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:36:40,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:36:40,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:36:40,186 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:36:40,187 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:36:40,188 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:36:40,188 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:36:40,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:36:40,189 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:36:40,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:36:40,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:36:40,191 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:36:40,232 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:36:40,248 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:36:40,252 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:36:40,253 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:36:40,254 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:36:40,256 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/overflow1.i_3.bpl [2019-08-04 21:36:40,256 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/overflow1.i_3.bpl' [2019-08-04 21:36:40,298 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:36:40,301 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:36:40,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:36:40,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:36:40,302 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:36:40,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:36:40" (1/1) ... [2019-08-04 21:36:40,329 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:36:40" (1/1) ... [2019-08-04 21:36:40,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:36:40,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:36:40,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:36:40,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:36:40,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:36:40" (1/1) ... [2019-08-04 21:36:40,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:36:40" (1/1) ... [2019-08-04 21:36:40,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:36:40" (1/1) ... [2019-08-04 21:36:40,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:36:40" (1/1) ... [2019-08-04 21:36:40,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:36:40" (1/1) ... [2019-08-04 21:36:40,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:36:40" (1/1) ... [2019-08-04 21:36:40,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:36:40" (1/1) ... [2019-08-04 21:36:40,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:36:40,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:36:40,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:36:40,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:36:40,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:36:40" (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:36:40,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:36:40,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:36:40,621 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:36:40,621 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-04 21:36:40,622 INFO L202 PluginConnector]: Adding new model overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:36:40 BoogieIcfgContainer [2019-08-04 21:36:40,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:36:40,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:36:40,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:36:40,627 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:36:40,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:36:40" (1/2) ... [2019-08-04 21:36:40,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff7cc91 and model type overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:36:40, skipping insertion in model container [2019-08-04 21:36:40,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:36:40" (2/2) ... [2019-08-04 21:36:40,630 INFO L109 eAbstractionObserver]: Analyzing ICFG overflow1.i_3.bpl [2019-08-04 21:36:40,640 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:36:40,647 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:36:40,663 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:36:40,689 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:36:40,690 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:36:40,690 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:36:40,690 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:36:40,691 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:36:40,691 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:36:40,691 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:36:40,691 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:36:40,691 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:36:40,704 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-04 21:36:40,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:36:40,712 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:40,713 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:36:40,715 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:40,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:40,720 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-04 21:36:40,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:40,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-04 21:36:40,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:40,874 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:36:40,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:36:40,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:36:40,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:36:40,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:36:40,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:36:40,899 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-04 21:36:40,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:40,927 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-04 21:36:40,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:36:40,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-04 21:36:40,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:40,940 INFO L225 Difference]: With dead ends: 5 [2019-08-04 21:36:40,940 INFO L226 Difference]: Without dead ends: 5 [2019-08-04 21:36:40,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:36:40,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-04 21:36:40,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-04 21:36:40,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-04 21:36:40,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-04 21:36:40,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-04 21:36:40,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:40,976 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-04 21:36:40,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:36:40,977 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-04 21:36:40,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:36:40,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:40,977 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:36:40,978 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:40,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:40,978 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-04 21:36:40,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:41,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:36:41,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:41,158 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:36:41,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:41,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:36:41,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:36:41,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:36:41,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:36:41,162 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-04 21:36:41,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:41,213 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:36:41,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:36:41,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-04 21:36:41,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:41,215 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:36:41,215 INFO L226 Difference]: Without dead ends: 6 [2019-08-04 21:36:41,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:36:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-04 21:36:41,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-04 21:36:41,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:36:41,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-04 21:36:41,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-04 21:36:41,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:41,219 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-04 21:36:41,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:36:41,219 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-04 21:36:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:36:41,220 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:41,220 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-04 21:36:41,220 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:41,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:41,221 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-04 21:36:41,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:41,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:36:41,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:41,320 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:36:41,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:41,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:36:41,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:36:41,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:36:41,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:36:41,323 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-04 21:36:41,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:41,381 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-04 21:36:41,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:36:41,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-04 21:36:41,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:41,383 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:36:41,383 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:36:41,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:36:41,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:36:41,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:36:41,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:36:41,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:36:41,386 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-04 21:36:41,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:41,386 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:36:41,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:36:41,387 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:36:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:36:41,387 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:41,388 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-04 21:36:41,388 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:41,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:41,388 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-04 21:36:41,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:41,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-04 21:36:41,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:41,497 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:36:41,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:41,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:36:41,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:36:41,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:36:41,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:36:41,500 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-04 21:36:41,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:41,577 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:36:41,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:36:41,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:36:41,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:41,590 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:36:41,590 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:36:41,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:36:41,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:36:41,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:36:41,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:36:41,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:36:41,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-04 21:36:41,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:41,593 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:36:41,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:36:41,594 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:36:41,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:36:41,594 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:41,594 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-04 21:36:41,595 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:41,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:41,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-04 21:36:41,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:41,625 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-04 21:36:41,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:41,772 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:36:41,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:41,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:36:41,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:36:41,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:36:41,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:36:41,774 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-04 21:36:41,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:41,958 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:36:41,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:36:41,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-04 21:36:41,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:41,960 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:36:41,960 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:36:41,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:36:41,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:36:41,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:36:41,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:36:41,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:36:41,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-04 21:36:41,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:41,964 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:36:41,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:36:41,964 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:36:41,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:36:41,964 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:41,965 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-04 21:36:41,965 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:41,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:41,965 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-04 21:36:41,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:41,985 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-04 21:36:41,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:42,157 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:36:42,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:42,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:36:42,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:36:42,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:36:42,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:36:42,159 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-04 21:36:42,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:42,342 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-04 21:36:42,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:36:42,343 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-04 21:36:42,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:42,343 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:36:42,344 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:36:42,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:36:42,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:36:42,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:36:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:36:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-04 21:36:42,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-04 21:36:42,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:42,347 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-04 21:36:42,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:36:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-04 21:36:42,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:36:42,348 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:42,348 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-04 21:36:42,349 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:42,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:42,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-04 21:36:42,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:42,372 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-04 21:36:42,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:42,486 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:36:42,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:42,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:36:42,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:36:42,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:36:42,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:36:42,488 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-04 21:36:42,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:42,577 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:36:42,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:36:42,578 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-04 21:36:42,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:42,579 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:36:42,580 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:36:42,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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:36:42,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:36:42,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:36:42,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:36:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:36:42,585 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-04 21:36:42,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:42,585 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:36:42,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:36:42,585 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:36:42,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:36:42,586 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:42,586 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-04 21:36:42,586 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:42,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:42,586 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-04 21:36:42,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:42,609 WARN L254 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-04 21:36:42,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:43,078 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:36:43,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:43,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:36:43,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:36:43,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:36:43,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:36:43,080 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-04 21:36:43,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:43,175 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:36:43,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:36:43,175 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-04 21:36:43,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:43,176 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:36:43,177 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:36:43,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:36:43,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:36:43,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-04 21:36:43,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:36:43,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-04 21:36:43,180 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-04 21:36:43,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:43,180 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-04 21:36:43,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:36:43,180 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-04 21:36:43,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:36:43,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:43,181 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-04 21:36:43,181 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:43,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:43,182 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-04 21:36:43,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:43,204 WARN L254 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-04 21:36:43,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:43,466 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:36:43,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:43,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-04 21:36:43,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:36:43,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:36:43,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:36:43,468 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-04 21:36:43,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:43,599 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-04 21:36:43,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:36:43,600 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-04 21:36:43,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:43,601 INFO L225 Difference]: With dead ends: 13 [2019-08-04 21:36:43,601 INFO L226 Difference]: Without dead ends: 13 [2019-08-04 21:36:43,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:36:43,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-04 21:36:43,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-04 21:36:43,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-04 21:36:43,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-04 21:36:43,605 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-04 21:36:43,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:43,606 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-04 21:36:43,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:36:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-04 21:36:43,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-04 21:36:43,608 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:43,608 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-04 21:36:43,610 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:43,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:43,610 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-04 21:36:43,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:43,637 WARN L254 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-04 21:36:43,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:44,099 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:36:44,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:44,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:36:44,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:36:44,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:36:44,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:36:44,101 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-04 21:36:44,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:44,283 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-04 21:36:44,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:36:44,284 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-04 21:36:44,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:44,285 INFO L225 Difference]: With dead ends: 14 [2019-08-04 21:36:44,285 INFO L226 Difference]: Without dead ends: 14 [2019-08-04 21:36:44,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:36:44,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-04 21:36:44,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-04 21:36:44,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-04 21:36:44,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-04 21:36:44,289 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-04 21:36:44,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:44,290 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-04 21:36:44,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:36:44,290 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-04 21:36:44,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-04 21:36:44,290 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:44,291 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-04 21:36:44,291 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:44,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:44,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-04 21:36:44,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:44,314 WARN L254 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-04 21:36:44,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:44,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:44,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:36:44,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:36:44,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:36:44,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:36:44,503 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-04 21:36:44,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:44,663 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-04 21:36:44,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:36:44,668 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-04 21:36:44,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:44,669 INFO L225 Difference]: With dead ends: 15 [2019-08-04 21:36:44,669 INFO L226 Difference]: Without dead ends: 15 [2019-08-04 21:36:44,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:36:44,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-04 21:36:44,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-04 21:36:44,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-04 21:36:44,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-04 21:36:44,672 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-04 21:36:44,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:44,673 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-04 21:36:44,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:36:44,673 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-04 21:36:44,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:36:44,673 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:44,673 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-04 21:36:44,674 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:44,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:44,674 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-04 21:36:44,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:44,707 WARN L254 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-04 21:36:44,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:44,878 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:44,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:44,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-04 21:36:44,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-04 21:36:44,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-04 21:36:44,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:36:44,880 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-04 21:36:45,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:45,032 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-04 21:36:45,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:36:45,038 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-04 21:36:45,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:45,038 INFO L225 Difference]: With dead ends: 16 [2019-08-04 21:36:45,038 INFO L226 Difference]: Without dead ends: 16 [2019-08-04 21:36:45,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:36:45,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-04 21:36:45,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-04 21:36:45,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-04 21:36:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-04 21:36:45,042 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-04 21:36:45,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:45,042 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-04 21:36:45,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-04 21:36:45,042 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-04 21:36:45,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-04 21:36:45,043 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:45,043 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-04 21:36:45,043 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:45,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:45,044 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-04 21:36:45,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:45,063 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-04 21:36:45,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:45,297 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:45,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:45,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-04 21:36:45,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-04 21:36:45,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-04 21:36:45,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:36:45,299 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-04 21:36:45,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:45,479 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-04 21:36:45,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:36:45,485 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-04 21:36:45,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:45,486 INFO L225 Difference]: With dead ends: 17 [2019-08-04 21:36:45,486 INFO L226 Difference]: Without dead ends: 17 [2019-08-04 21:36:45,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-04 21:36:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-04 21:36:45,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-04 21:36:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-04 21:36:45,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-04 21:36:45,492 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-04 21:36:45,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:45,492 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-04 21:36:45,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-04 21:36:45,493 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-04 21:36:45,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-04 21:36:45,493 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:45,494 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-04 21:36:45,494 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:45,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:45,494 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-04 21:36:45,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:45,536 WARN L254 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-04 21:36:45,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:45,766 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:45,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:45,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-04 21:36:45,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-04 21:36:45,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-04 21:36:45,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:36:45,768 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-04 21:36:45,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:45,953 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-04 21:36:45,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:36:45,953 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-04 21:36:45,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:45,954 INFO L225 Difference]: With dead ends: 18 [2019-08-04 21:36:45,954 INFO L226 Difference]: Without dead ends: 18 [2019-08-04 21:36:45,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:36:45,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-04 21:36:45,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-04 21:36:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-04 21:36:45,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-04 21:36:45,959 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-04 21:36:45,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:45,959 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-04 21:36:45,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-04 21:36:45,959 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-04 21:36:45,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-04 21:36:45,960 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:45,960 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-04 21:36:45,960 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:45,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:45,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-04 21:36:45,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:45,979 WARN L254 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-04 21:36:45,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:46,147 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:46,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:46,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-04 21:36:46,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-04 21:36:46,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-04 21:36:46,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:36:46,149 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-04 21:36:46,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:46,359 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-04 21:36:46,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:36:46,360 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-04 21:36:46,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:46,360 INFO L225 Difference]: With dead ends: 19 [2019-08-04 21:36:46,360 INFO L226 Difference]: Without dead ends: 19 [2019-08-04 21:36:46,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:36:46,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-04 21:36:46,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-04 21:36:46,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-04 21:36:46,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-04 21:36:46,365 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-04 21:36:46,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:46,365 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-04 21:36:46,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-04 21:36:46,365 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-04 21:36:46,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:36:46,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:46,366 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-04 21:36:46,366 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:46,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:46,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-04 21:36:46,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:46,384 WARN L254 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-04 21:36:46,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:47,196 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:47,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:47,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-04 21:36:47,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-04 21:36:47,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-04 21:36:47,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:36:47,197 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-04 21:36:47,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:47,678 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-04 21:36:47,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:36:47,679 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-04 21:36:47,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:47,680 INFO L225 Difference]: With dead ends: 20 [2019-08-04 21:36:47,680 INFO L226 Difference]: Without dead ends: 20 [2019-08-04 21:36:47,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:36:47,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-04 21:36:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-04 21:36:47,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-04 21:36:47,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-04 21:36:47,684 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-04 21:36:47,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:47,685 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-04 21:36:47,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-04 21:36:47,685 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-04 21:36:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-04 21:36:47,686 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:47,686 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-04 21:36:47,686 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:47,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:47,687 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-04 21:36:47,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:47,705 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-04 21:36:47,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:48,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:48,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-04 21:36:48,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-04 21:36:48,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-04 21:36:48,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:36:48,145 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-04 21:36:48,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:48,409 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-04 21:36:48,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:36:48,410 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-04 21:36:48,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:48,411 INFO L225 Difference]: With dead ends: 21 [2019-08-04 21:36:48,411 INFO L226 Difference]: Without dead ends: 21 [2019-08-04 21:36:48,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:36:48,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-04 21:36:48,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-04 21:36:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-04 21:36:48,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-04 21:36:48,415 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-04 21:36:48,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:48,415 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-04 21:36:48,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-04 21:36:48,415 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-04 21:36:48,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-04 21:36:48,416 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:48,416 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-04 21:36:48,416 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:48,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:48,416 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-04 21:36:48,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:48,433 WARN L254 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-04 21:36:48,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:48,636 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:48,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:48,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-04 21:36:48,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-04 21:36:48,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-04 21:36:48,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:36:48,638 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-04 21:36:49,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:49,139 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-04 21:36:49,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-04 21:36:49,140 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-04 21:36:49,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:49,141 INFO L225 Difference]: With dead ends: 22 [2019-08-04 21:36:49,141 INFO L226 Difference]: Without dead ends: 22 [2019-08-04 21:36:49,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:36:49,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-04 21:36:49,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-04 21:36:49,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-04 21:36:49,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-04 21:36:49,144 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-04 21:36:49,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:49,145 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-04 21:36:49,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-04 21:36:49,145 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-04 21:36:49,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:36:49,146 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:49,146 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-04 21:36:49,146 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:49,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:49,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-04 21:36:49,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:49,163 WARN L254 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-04 21:36:49,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:49,379 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:49,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:49,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-04 21:36:49,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-04 21:36:49,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-04 21:36:49,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:36:49,381 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-04 21:36:49,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:49,758 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-04 21:36:49,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-04 21:36:49,759 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-04 21:36:49,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:49,760 INFO L225 Difference]: With dead ends: 23 [2019-08-04 21:36:49,760 INFO L226 Difference]: Without dead ends: 23 [2019-08-04 21:36:49,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:36:49,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-04 21:36:49,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-04 21:36:49,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-04 21:36:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-04 21:36:49,764 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-04 21:36:49,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:49,765 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-04 21:36:49,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-04 21:36:49,765 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-04 21:36:49,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-04 21:36:49,765 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:49,766 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-04 21:36:49,766 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:49,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:49,766 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-04 21:36:49,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:49,784 WARN L254 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-04 21:36:49,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:50,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:50,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-04 21:36:50,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-04 21:36:50,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-04 21:36:50,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:36:50,060 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-04 21:36:50,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:50,394 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-04 21:36:50,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:36:50,394 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-04 21:36:50,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:50,395 INFO L225 Difference]: With dead ends: 24 [2019-08-04 21:36:50,395 INFO L226 Difference]: Without dead ends: 24 [2019-08-04 21:36:50,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:36:50,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-04 21:36:50,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-04 21:36:50,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-04 21:36:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-04 21:36:50,399 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-04 21:36:50,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:50,400 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-04 21:36:50,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-04 21:36:50,400 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-04 21:36:50,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-04 21:36:50,401 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:50,401 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-04 21:36:50,401 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:50,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:50,402 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-04 21:36:50,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:50,419 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-04 21:36:50,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:50,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:50,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-04 21:36:50,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-04 21:36:50,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-04 21:36:50,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:36:50,687 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-04 21:36:51,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:51,082 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-04 21:36:51,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:36:51,083 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-04 21:36:51,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:51,084 INFO L225 Difference]: With dead ends: 25 [2019-08-04 21:36:51,084 INFO L226 Difference]: Without dead ends: 25 [2019-08-04 21:36:51,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-04 21:36:51,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-04 21:36:51,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-04 21:36:51,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-04 21:36:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-04 21:36:51,088 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-04 21:36:51,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:51,088 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-04 21:36:51,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-04 21:36:51,088 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-04 21:36:51,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-04 21:36:51,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:51,089 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-04 21:36:51,089 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:51,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:51,090 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-04 21:36:51,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:51,107 WARN L254 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-04 21:36:51,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:51,606 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:51,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:51,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-04 21:36:51,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-04 21:36:51,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-04 21:36:51,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:36:51,607 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-04 21:36:52,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:52,115 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-04 21:36:52,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-04 21:36:52,118 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-04 21:36:52,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:52,118 INFO L225 Difference]: With dead ends: 26 [2019-08-04 21:36:52,118 INFO L226 Difference]: Without dead ends: 26 [2019-08-04 21:36:52,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-04 21:36:52,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-04 21:36:52,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-04 21:36:52,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-04 21:36:52,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-04 21:36:52,122 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-04 21:36:52,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:52,122 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-04 21:36:52,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-04 21:36:52,122 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-04 21:36:52,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:36:52,123 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:52,123 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-04 21:36:52,123 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:52,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:52,124 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-04 21:36:52,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:52,141 WARN L254 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-04 21:36:52,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:52,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:52,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-04 21:36:52,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-04 21:36:52,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-04 21:36:52,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:36:52,504 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-04 21:36:53,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:53,298 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-04 21:36:53,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-04 21:36:53,300 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-04 21:36:53,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:53,301 INFO L225 Difference]: With dead ends: 27 [2019-08-04 21:36:53,301 INFO L226 Difference]: Without dead ends: 27 [2019-08-04 21:36:53,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:36:53,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-04 21:36:53,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-04 21:36:53,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-04 21:36:53,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-04 21:36:53,304 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-04 21:36:53,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:53,304 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-04 21:36:53,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-04 21:36:53,304 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-04 21:36:53,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-04 21:36:53,305 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:53,305 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-04 21:36:53,305 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:53,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:53,306 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-04 21:36:53,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:53,332 WARN L254 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-04 21:36:53,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:53,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:53,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-04 21:36:53,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-04 21:36:53,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-04 21:36:53,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:36:53,678 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-04 21:36:54,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:54,493 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-04 21:36:54,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-04 21:36:54,493 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-04 21:36:54,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:54,494 INFO L225 Difference]: With dead ends: 28 [2019-08-04 21:36:54,494 INFO L226 Difference]: Without dead ends: 28 [2019-08-04 21:36:54,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:36:54,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-04 21:36:54,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-04 21:36:54,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-04 21:36:54,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-04 21:36:54,499 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-04 21:36:54,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:54,499 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-04 21:36:54,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-04 21:36:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-04 21:36:54,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-04 21:36:54,500 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:54,500 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-04 21:36:54,501 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:54,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:54,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-04 21:36:54,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:54,520 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-04 21:36:54,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:54,858 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:54,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:54,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-04 21:36:54,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-04 21:36:54,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-04 21:36:54,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:36:54,861 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-04 21:36:55,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:55,390 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-04 21:36:55,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-04 21:36:55,391 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-04 21:36:55,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:55,392 INFO L225 Difference]: With dead ends: 29 [2019-08-04 21:36:55,392 INFO L226 Difference]: Without dead ends: 29 [2019-08-04 21:36:55,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:36:55,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-04 21:36:55,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-04 21:36:55,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-04 21:36:55,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-04 21:36:55,395 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-04 21:36:55,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:55,396 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-04 21:36:55,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-04 21:36:55,396 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-04 21:36:55,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-04 21:36:55,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:55,397 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-04 21:36:55,397 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:55,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:55,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-04 21:36:55,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:55,430 WARN L254 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-04 21:36:55,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:55,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:55,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-04 21:36:55,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-04 21:36:55,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-04 21:36:55,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:36:55,774 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-04 21:36:56,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:56,297 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-04 21:36:56,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-04 21:36:56,298 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-04 21:36:56,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:56,298 INFO L225 Difference]: With dead ends: 30 [2019-08-04 21:36:56,298 INFO L226 Difference]: Without dead ends: 30 [2019-08-04 21:36:56,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:36:56,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-04 21:36:56,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-04 21:36:56,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-04 21:36:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-04 21:36:56,302 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-04 21:36:56,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:56,302 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-04 21:36:56,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-04 21:36:56,302 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-04 21:36:56,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:36:56,303 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:56,303 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-04 21:36:56,303 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:56,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:56,304 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-04 21:36:56,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:56,325 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-04 21:36:56,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:57,068 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:57,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:57,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-04 21:36:57,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-04 21:36:57,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-04 21:36:57,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:36:57,069 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-04 21:36:57,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:57,634 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-04 21:36:57,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-04 21:36:57,635 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-04 21:36:57,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:57,635 INFO L225 Difference]: With dead ends: 31 [2019-08-04 21:36:57,636 INFO L226 Difference]: Without dead ends: 31 [2019-08-04 21:36:57,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:36:57,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-04 21:36:57,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-04 21:36:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-04 21:36:57,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-04 21:36:57,640 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-04 21:36:57,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:57,640 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-04 21:36:57,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-04 21:36:57,640 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-04 21:36:57,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-04 21:36:57,640 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:57,641 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-04 21:36:57,641 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:57,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:57,642 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-04 21:36:57,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:57,663 WARN L254 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-04 21:36:57,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:58,712 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:36:58,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:58,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-04 21:36:58,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-04 21:36:58,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-04 21:36:58,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:36:58,714 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-04 21:36:59,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:59,464 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-04 21:36:59,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-04 21:36:59,465 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-04 21:36:59,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:59,465 INFO L225 Difference]: With dead ends: 32 [2019-08-04 21:36:59,465 INFO L226 Difference]: Without dead ends: 32 [2019-08-04 21:36:59,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-04 21:36:59,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-04 21:36:59,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-04 21:36:59,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-04 21:36:59,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-04 21:36:59,470 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-04 21:36:59,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:59,470 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-04 21:36:59,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-04 21:36:59,471 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-04 21:36:59,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-04 21:36:59,471 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:59,471 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-04 21:36:59,472 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:59,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:59,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-04 21:36:59,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:59,494 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-04 21:36:59,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:00,165 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:00,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:00,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-04 21:37:00,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-04 21:37:00,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-04 21:37:00,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:37:00,167 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-04 21:37:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:00,833 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-04 21:37:00,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-04 21:37:00,833 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-04 21:37:00,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:00,834 INFO L225 Difference]: With dead ends: 33 [2019-08-04 21:37:00,834 INFO L226 Difference]: Without dead ends: 33 [2019-08-04 21:37:00,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-04 21:37:00,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-04 21:37:00,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-04 21:37:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-04 21:37:00,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-04 21:37:00,838 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-04 21:37:00,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:00,838 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-04 21:37:00,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-04 21:37:00,839 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-04 21:37:00,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-04 21:37:00,839 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:00,839 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-04 21:37:00,840 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:00,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:00,840 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-04 21:37:00,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:00,861 WARN L254 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-04 21:37:00,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:01,246 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:01,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:01,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-04 21:37:01,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-04 21:37:01,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-04 21:37:01,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:37:01,247 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-04 21:37:02,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:02,012 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-04 21:37:02,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-04 21:37:02,013 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-04 21:37:02,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:02,013 INFO L225 Difference]: With dead ends: 34 [2019-08-04 21:37:02,014 INFO L226 Difference]: Without dead ends: 34 [2019-08-04 21:37:02,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-04 21:37:02,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-04 21:37:02,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-04 21:37:02,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-04 21:37:02,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-04 21:37:02,017 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-04 21:37:02,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:02,017 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-04 21:37:02,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-04 21:37:02,017 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-04 21:37:02,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-04 21:37:02,018 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:02,018 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-04 21:37:02,018 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:02,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:02,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-04 21:37:02,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:02,043 WARN L254 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-04 21:37:02,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:03,303 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:03,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:03,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-04 21:37:03,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-04 21:37:03,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-04 21:37:03,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:37:03,304 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-04 21:37:04,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:04,052 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-04 21:37:04,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-04 21:37:04,052 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-04 21:37:04,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:04,053 INFO L225 Difference]: With dead ends: 35 [2019-08-04 21:37:04,053 INFO L226 Difference]: Without dead ends: 35 [2019-08-04 21:37:04,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-04 21:37:04,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-04 21:37:04,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-04 21:37:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-04 21:37:04,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-04 21:37:04,057 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-04 21:37:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:04,057 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-04 21:37:04,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-04 21:37:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-04 21:37:04,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-04 21:37:04,058 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:04,058 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-04 21:37:04,058 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:04,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:04,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-04 21:37:04,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:04,081 WARN L254 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-04 21:37:04,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:04,990 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:04,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:04,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-04 21:37:04,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-04 21:37:04,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-04 21:37:04,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:37:04,992 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-04 21:37:05,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:05,783 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-04 21:37:05,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-04 21:37:05,785 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-04 21:37:05,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:05,786 INFO L225 Difference]: With dead ends: 36 [2019-08-04 21:37:05,786 INFO L226 Difference]: Without dead ends: 36 [2019-08-04 21:37:05,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-04 21:37:05,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-04 21:37:05,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-04 21:37:05,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-04 21:37:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-04 21:37:05,790 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-04 21:37:05,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:05,790 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-04 21:37:05,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-04 21:37:05,790 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-04 21:37:05,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-04 21:37:05,791 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:05,791 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-04 21:37:05,791 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:05,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:05,791 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-04 21:37:05,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:05,815 WARN L254 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-04 21:37:05,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:06,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:06,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-04 21:37:06,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-04 21:37:06,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-04 21:37:06,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:37:06,368 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-04 21:37:07,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:07,183 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-04 21:37:07,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-04 21:37:07,183 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-04 21:37:07,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:07,184 INFO L225 Difference]: With dead ends: 37 [2019-08-04 21:37:07,184 INFO L226 Difference]: Without dead ends: 37 [2019-08-04 21:37:07,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-04 21:37:07,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-04 21:37:07,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-04 21:37:07,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-04 21:37:07,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-04 21:37:07,187 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-04 21:37:07,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:07,188 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-04 21:37:07,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-04 21:37:07,188 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-04 21:37:07,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-04 21:37:07,188 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:07,189 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-04 21:37:07,189 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:07,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:07,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-04 21:37:07,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:07,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:07,212 WARN L254 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-04 21:37:07,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:07,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:07,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-04 21:37:07,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-04 21:37:07,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-04 21:37:07,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:37:07,962 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-04 21:37:08,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:08,865 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-04 21:37:08,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-04 21:37:08,866 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-04 21:37:08,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:08,866 INFO L225 Difference]: With dead ends: 38 [2019-08-04 21:37:08,867 INFO L226 Difference]: Without dead ends: 38 [2019-08-04 21:37:08,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-04 21:37:08,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-04 21:37:08,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-04 21:37:08,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-04 21:37:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-04 21:37:08,870 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-04 21:37:08,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:08,870 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-04 21:37:08,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-04 21:37:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-04 21:37:08,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-04 21:37:08,871 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:08,871 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-04 21:37:08,871 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:08,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:08,872 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-04 21:37:08,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:08,896 WARN L254 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-04 21:37:08,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:09,647 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:09,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:09,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-04 21:37:09,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-04 21:37:09,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-04 21:37:09,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:37:09,649 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-04 21:37:10,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:10,587 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-04 21:37:10,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-04 21:37:10,588 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-04 21:37:10,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:10,589 INFO L225 Difference]: With dead ends: 39 [2019-08-04 21:37:10,589 INFO L226 Difference]: Without dead ends: 39 [2019-08-04 21:37:10,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-04 21:37:10,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-04 21:37:10,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-04 21:37:10,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-04 21:37:10,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-04 21:37:10,593 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-04 21:37:10,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:10,593 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-04 21:37:10,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-04 21:37:10,593 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-04 21:37:10,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-04 21:37:10,594 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:10,594 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-04 21:37:10,594 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:10,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:10,594 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-04 21:37:10,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:10,616 WARN L254 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-04 21:37:10,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:11,260 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:11,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:11,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-04 21:37:11,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-04 21:37:11,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-04 21:37:11,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:37:11,261 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-04 21:37:12,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:12,211 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-04 21:37:12,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-04 21:37:12,211 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-04 21:37:12,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:12,212 INFO L225 Difference]: With dead ends: 40 [2019-08-04 21:37:12,212 INFO L226 Difference]: Without dead ends: 40 [2019-08-04 21:37:12,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-04 21:37:12,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-04 21:37:12,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-04 21:37:12,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-04 21:37:12,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-04 21:37:12,215 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-04 21:37:12,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:12,215 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-04 21:37:12,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-04 21:37:12,215 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-04 21:37:12,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-04 21:37:12,216 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:12,216 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-04 21:37:12,216 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:12,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:12,217 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-04 21:37:12,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:12,251 WARN L254 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-04 21:37:12,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:12,844 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:12,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:12,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-04 21:37:12,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-04 21:37:12,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-04 21:37:12,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:37:12,846 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-04 21:37:13,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:13,924 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-04 21:37:13,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-04 21:37:13,924 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-04 21:37:13,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:13,925 INFO L225 Difference]: With dead ends: 41 [2019-08-04 21:37:13,925 INFO L226 Difference]: Without dead ends: 41 [2019-08-04 21:37:13,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-04 21:37:13,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-04 21:37:13,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-04 21:37:13,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-04 21:37:13,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-04 21:37:13,928 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-04 21:37:13,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:13,929 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-04 21:37:13,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-04 21:37:13,929 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-04 21:37:13,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-04 21:37:13,929 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:13,929 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-04 21:37:13,930 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:13,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:13,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-04 21:37:13,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:13,956 WARN L254 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-04 21:37:13,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:14,895 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:14,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:14,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-04 21:37:14,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-04 21:37:14,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-04 21:37:14,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:37:14,897 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-04 21:37:15,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:15,964 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-04 21:37:15,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-04 21:37:15,965 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-04 21:37:15,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:15,966 INFO L225 Difference]: With dead ends: 42 [2019-08-04 21:37:15,966 INFO L226 Difference]: Without dead ends: 42 [2019-08-04 21:37:15,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-04 21:37:15,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-04 21:37:15,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-04 21:37:15,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-04 21:37:15,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-04 21:37:15,968 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-04 21:37:15,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:15,968 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-04 21:37:15,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-04 21:37:15,968 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-04 21:37:15,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-04 21:37:15,969 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:15,969 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-04 21:37:15,969 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:15,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:15,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-04 21:37:15,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:15,995 WARN L254 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-04 21:37:15,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:16,663 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:16,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:16,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-04 21:37:16,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-04 21:37:16,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-04 21:37:16,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:37:16,665 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-04 21:37:17,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:17,808 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-04 21:37:17,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-04 21:37:17,809 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-04 21:37:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:17,809 INFO L225 Difference]: With dead ends: 43 [2019-08-04 21:37:17,810 INFO L226 Difference]: Without dead ends: 43 [2019-08-04 21:37:17,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-04 21:37:17,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-04 21:37:17,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-04 21:37:17,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-04 21:37:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-04 21:37:17,813 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-04 21:37:17,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:17,813 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-04 21:37:17,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-04 21:37:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-04 21:37:17,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-04 21:37:17,814 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:17,814 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-04 21:37:17,814 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:17,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:17,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-04 21:37:17,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:17,839 WARN L254 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-04 21:37:17,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:18,522 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:18,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:18,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-04 21:37:18,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-04 21:37:18,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-04 21:37:18,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:37:18,524 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-04 21:37:19,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:19,920 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-04 21:37:19,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-04 21:37:19,921 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-04 21:37:19,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:19,922 INFO L225 Difference]: With dead ends: 44 [2019-08-04 21:37:19,922 INFO L226 Difference]: Without dead ends: 44 [2019-08-04 21:37:19,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-04 21:37:19,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-04 21:37:19,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-04 21:37:19,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-04 21:37:19,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-04 21:37:19,924 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-04 21:37:19,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:19,925 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-04 21:37:19,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-04 21:37:19,925 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-04 21:37:19,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-04 21:37:19,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:19,925 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-04 21:37:19,925 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:19,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:19,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-04 21:37:19,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:19,954 WARN L254 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-04 21:37:19,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:20,900 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:20,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:20,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-04 21:37:20,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-04 21:37:20,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-04 21:37:20,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:37:20,902 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-04 21:37:22,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:22,178 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-04 21:37:22,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-04 21:37:22,178 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-04 21:37:22,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:22,179 INFO L225 Difference]: With dead ends: 45 [2019-08-04 21:37:22,179 INFO L226 Difference]: Without dead ends: 45 [2019-08-04 21:37:22,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-04 21:37:22,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-04 21:37:22,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-04 21:37:22,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-04 21:37:22,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-04 21:37:22,182 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-04 21:37:22,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:22,183 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-04 21:37:22,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-04 21:37:22,183 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-04 21:37:22,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-04 21:37:22,183 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:22,184 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-04 21:37:22,184 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:22,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:22,184 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-04 21:37:22,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:22,223 WARN L254 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-04 21:37:22,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:23,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:23,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-04 21:37:23,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-04 21:37:23,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-04 21:37:23,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:37:23,022 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-04 21:37:24,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:24,345 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-04 21:37:24,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-04 21:37:24,346 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-04 21:37:24,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:24,346 INFO L225 Difference]: With dead ends: 46 [2019-08-04 21:37:24,346 INFO L226 Difference]: Without dead ends: 46 [2019-08-04 21:37:24,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-04 21:37:24,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-04 21:37:24,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-04 21:37:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-04 21:37:24,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-04 21:37:24,349 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-04 21:37:24,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:24,350 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-04 21:37:24,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-04 21:37:24,350 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-04 21:37:24,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-04 21:37:24,350 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:24,350 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-04 21:37:24,351 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:24,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:24,351 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-04 21:37:24,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:24,383 WARN L254 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-04 21:37:24,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:25,464 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:25,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:25,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-04 21:37:25,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-04 21:37:25,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-04 21:37:25,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:37:25,466 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-04 21:37:26,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:26,899 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-04 21:37:26,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-04 21:37:26,899 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-04 21:37:26,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:26,900 INFO L225 Difference]: With dead ends: 47 [2019-08-04 21:37:26,900 INFO L226 Difference]: Without dead ends: 47 [2019-08-04 21:37:26,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-04 21:37:26,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-04 21:37:26,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-04 21:37:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-04 21:37:26,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-04 21:37:26,904 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-04 21:37:26,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:26,904 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-04 21:37:26,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-04 21:37:26,904 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-04 21:37:26,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-04 21:37:26,904 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:26,905 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-04 21:37:26,905 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:26,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:26,905 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-04 21:37:26,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:26,935 WARN L254 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-04 21:37:26,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:27,725 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:27,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:27,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-04 21:37:27,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-04 21:37:27,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-04 21:37:27,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:37:27,726 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-04 21:37:29,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:29,178 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-04 21:37:29,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-04 21:37:29,179 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-04 21:37:29,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:29,179 INFO L225 Difference]: With dead ends: 48 [2019-08-04 21:37:29,180 INFO L226 Difference]: Without dead ends: 48 [2019-08-04 21:37:29,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-04 21:37:29,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-04 21:37:29,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-04 21:37:29,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-04 21:37:29,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-04 21:37:29,183 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-04 21:37:29,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:29,183 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-04 21:37:29,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-04 21:37:29,183 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-04 21:37:29,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-04 21:37:29,184 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:29,184 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-04 21:37:29,184 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:29,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:29,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-04 21:37:29,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:29,218 WARN L254 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-04 21:37:29,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:30,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:30,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-04 21:37:30,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-04 21:37:30,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-04 21:37:30,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:37:30,396 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-04 21:37:31,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:31,869 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-04 21:37:31,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-04 21:37:31,869 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-04 21:37:31,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:31,870 INFO L225 Difference]: With dead ends: 49 [2019-08-04 21:37:31,870 INFO L226 Difference]: Without dead ends: 49 [2019-08-04 21:37:31,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-04 21:37:31,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-04 21:37:31,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-04 21:37:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-04 21:37:31,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-04 21:37:31,873 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-04 21:37:31,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:31,873 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-04 21:37:31,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-04 21:37:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-04 21:37:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-04 21:37:31,874 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:31,874 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-04 21:37:31,874 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:31,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:31,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-04 21:37:31,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:31,901 WARN L254 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-04 21:37:31,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:32,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:32,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-04 21:37:32,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-04 21:37:32,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-04 21:37:32,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:37:32,776 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-04 21:37:34,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:34,348 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-04 21:37:34,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-04 21:37:34,348 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-04 21:37:34,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:34,349 INFO L225 Difference]: With dead ends: 50 [2019-08-04 21:37:34,349 INFO L226 Difference]: Without dead ends: 50 [2019-08-04 21:37:34,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-04 21:37:34,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-04 21:37:34,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-04 21:37:34,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-04 21:37:34,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-04 21:37:34,352 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-04 21:37:34,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:34,352 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-04 21:37:34,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-04 21:37:34,352 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-04 21:37:34,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-04 21:37:34,353 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:34,353 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-04 21:37:34,353 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:34,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:34,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-04 21:37:34,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:34,388 WARN L254 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-04 21:37:34,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:35,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:35,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:35,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-04 21:37:35,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-04 21:37:35,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-04 21:37:35,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:37:35,539 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-04 21:37:37,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:37,238 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-04 21:37:37,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-04 21:37:37,244 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-04 21:37:37,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:37,245 INFO L225 Difference]: With dead ends: 51 [2019-08-04 21:37:37,245 INFO L226 Difference]: Without dead ends: 51 [2019-08-04 21:37:37,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-04 21:37:37,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-04 21:37:37,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-04 21:37:37,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-04 21:37:37,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-04 21:37:37,247 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-04 21:37:37,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:37,248 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-04 21:37:37,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-04 21:37:37,248 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-04 21:37:37,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-04 21:37:37,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:37,248 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-04 21:37:37,249 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:37,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:37,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-04 21:37:37,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:37,287 WARN L254 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-04 21:37:37,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:38,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:38,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:38,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-04 21:37:38,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-04 21:37:38,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-04 21:37:38,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:37:38,416 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-04 21:37:40,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:40,220 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-04 21:37:40,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-04 21:37:40,220 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-04 21:37:40,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:40,221 INFO L225 Difference]: With dead ends: 52 [2019-08-04 21:37:40,221 INFO L226 Difference]: Without dead ends: 52 [2019-08-04 21:37:40,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-04 21:37:40,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-04 21:37:40,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-04 21:37:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-04 21:37:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-04 21:37:40,225 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-04 21:37:40,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:40,225 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-04 21:37:40,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-04 21:37:40,226 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-04 21:37:40,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-04 21:37:40,226 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:40,226 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-04 21:37:40,227 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:40,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:40,227 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-04 21:37:40,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:40,263 WARN L254 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-04 21:37:40,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:41,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:41,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-04 21:37:41,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-04 21:37:41,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-04 21:37:41,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:37:41,367 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-04 21:37:43,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:43,109 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-04 21:37:43,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-04 21:37:43,110 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-04 21:37:43,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:43,111 INFO L225 Difference]: With dead ends: 53 [2019-08-04 21:37:43,111 INFO L226 Difference]: Without dead ends: 53 [2019-08-04 21:37:43,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-04 21:37:43,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-04 21:37:43,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-04 21:37:43,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-04 21:37:43,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-04 21:37:43,114 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-04 21:37:43,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:43,114 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-04 21:37:43,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-04 21:37:43,114 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-04 21:37:43,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-04 21:37:43,115 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:43,115 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-04 21:37:43,115 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:43,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:43,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-04 21:37:43,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:43,156 WARN L254 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-04 21:37:43,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:44,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:44,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:44,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-04 21:37:44,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-04 21:37:44,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-04 21:37:44,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:37:44,740 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-04 21:37:46,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:46,639 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-04 21:37:46,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-04 21:37:46,640 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-04 21:37:46,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:46,640 INFO L225 Difference]: With dead ends: 54 [2019-08-04 21:37:46,640 INFO L226 Difference]: Without dead ends: 54 [2019-08-04 21:37:46,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-04 21:37:46,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-04 21:37:46,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-04 21:37:46,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-04 21:37:46,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-04 21:37:46,643 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-04 21:37:46,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:46,644 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-04 21:37:46,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-04 21:37:46,644 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-04 21:37:46,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-04 21:37:46,644 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:46,644 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-04 21:37:46,645 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:46,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:46,645 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-04 21:37:46,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:46,685 WARN L254 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-04 21:37:46,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:47,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:47,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:47,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-04 21:37:47,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-04 21:37:47,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-04 21:37:47,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:37:47,733 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-04 21:37:49,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:49,667 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-04 21:37:49,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-04 21:37:49,668 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-04 21:37:49,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:49,669 INFO L225 Difference]: With dead ends: 55 [2019-08-04 21:37:49,669 INFO L226 Difference]: Without dead ends: 55 [2019-08-04 21:37:49,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-04 21:37:49,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-04 21:37:49,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-04 21:37:49,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-04 21:37:49,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-04 21:37:49,672 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-04 21:37:49,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:49,672 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-04 21:37:49,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-04 21:37:49,672 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-04 21:37:49,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-04 21:37:49,673 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:49,673 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-04 21:37:49,674 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:49,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:49,674 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-04 21:37:49,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:49,714 WARN L254 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-04 21:37:49,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:51,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:51,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:51,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-04 21:37:51,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-04 21:37:51,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-04 21:37:51,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:37:51,058 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-04 21:37:53,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:53,134 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-04 21:37:53,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-04 21:37:53,135 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-04 21:37:53,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:53,136 INFO L225 Difference]: With dead ends: 56 [2019-08-04 21:37:53,136 INFO L226 Difference]: Without dead ends: 56 [2019-08-04 21:37:53,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-04 21:37:53,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-04 21:37:53,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-04 21:37:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-04 21:37:53,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-04 21:37:53,139 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-04 21:37:53,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:53,139 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-04 21:37:53,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-04 21:37:53,139 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-04 21:37:53,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-04 21:37:53,139 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:53,140 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-04 21:37:53,140 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:53,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:53,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-04 21:37:53,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:53,169 WARN L254 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-04 21:37:53,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:54,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:54,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-04 21:37:54,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-04 21:37:54,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-04 21:37:54,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:37:54,224 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-04 21:37:56,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:56,431 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-04 21:37:56,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-04 21:37:56,431 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-04 21:37:56,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:56,432 INFO L225 Difference]: With dead ends: 57 [2019-08-04 21:37:56,432 INFO L226 Difference]: Without dead ends: 57 [2019-08-04 21:37:56,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-04 21:37:56,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-04 21:37:56,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-04 21:37:56,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-04 21:37:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-04 21:37:56,436 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-04 21:37:56,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:56,436 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-04 21:37:56,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-04 21:37:56,436 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-04 21:37:56,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-04 21:37:56,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:56,437 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-04 21:37:56,437 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:56,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:56,438 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-04 21:37:56,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:56,481 WARN L254 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-04 21:37:56,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:37:57,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:37:57,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:37:57,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-04 21:37:57,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-04 21:37:57,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-04 21:37:57,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:37:57,718 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-04 21:37:59,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:37:59,833 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-04 21:37:59,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-04 21:37:59,834 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-04 21:37:59,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:37:59,835 INFO L225 Difference]: With dead ends: 58 [2019-08-04 21:37:59,835 INFO L226 Difference]: Without dead ends: 58 [2019-08-04 21:37:59,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-04 21:37:59,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-04 21:37:59,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-04 21:37:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-04 21:37:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-04 21:37:59,838 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-04 21:37:59,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:37:59,838 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-04 21:37:59,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-04 21:37:59,838 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-04 21:37:59,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-04 21:37:59,839 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:37:59,839 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-04 21:37:59,839 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:37:59,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:37:59,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-04 21:37:59,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:37:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:37:59,876 WARN L254 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-04 21:37:59,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:01,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:01,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:01,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-04 21:38:01,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-04 21:38:01,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-04 21:38:01,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:38:01,273 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-04 21:38:03,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:03,458 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-04 21:38:03,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-04 21:38:03,458 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-04 21:38:03,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:03,459 INFO L225 Difference]: With dead ends: 59 [2019-08-04 21:38:03,459 INFO L226 Difference]: Without dead ends: 59 [2019-08-04 21:38:03,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-04 21:38:03,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-04 21:38:03,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-04 21:38:03,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-04 21:38:03,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-04 21:38:03,462 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-04 21:38:03,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:03,462 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-04 21:38:03,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-04 21:38:03,463 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-04 21:38:03,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-04 21:38:03,463 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:03,463 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-04 21:38:03,464 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:03,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:03,464 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-04 21:38:03,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:03,510 WARN L254 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-04 21:38:03,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:04,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:04,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:04,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-04 21:38:04,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-04 21:38:04,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-04 21:38:04,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:38:04,710 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-04 21:38:07,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:07,183 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-04 21:38:07,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-04 21:38:07,184 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-04 21:38:07,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:07,184 INFO L225 Difference]: With dead ends: 60 [2019-08-04 21:38:07,185 INFO L226 Difference]: Without dead ends: 60 [2019-08-04 21:38:07,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-04 21:38:07,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-04 21:38:07,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-04 21:38:07,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-04 21:38:07,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-04 21:38:07,188 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-04 21:38:07,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:07,188 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-04 21:38:07,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-04 21:38:07,188 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-04 21:38:07,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-04 21:38:07,189 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:07,189 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-04 21:38:07,189 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:07,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:07,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-04 21:38:07,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:07,232 WARN L254 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-04 21:38:07,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:08,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:08,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-04 21:38:08,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-04 21:38:08,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-04 21:38:08,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:38:08,524 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-04 21:38:11,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:11,118 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-04 21:38:11,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-04 21:38:11,119 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-04 21:38:11,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:11,120 INFO L225 Difference]: With dead ends: 61 [2019-08-04 21:38:11,120 INFO L226 Difference]: Without dead ends: 61 [2019-08-04 21:38:11,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-04 21:38:11,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-04 21:38:11,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-04 21:38:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-04 21:38:11,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-04 21:38:11,123 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-04 21:38:11,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:11,123 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-04 21:38:11,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-04 21:38:11,124 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-04 21:38:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-04 21:38:11,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:11,124 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-04 21:38:11,124 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:11,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:11,125 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-04 21:38:11,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:11,162 WARN L254 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-04 21:38:11,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:12,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:12,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-04 21:38:12,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-04 21:38:12,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-04 21:38:12,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:38:12,417 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-04 21:38:14,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:14,913 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-04 21:38:14,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-04 21:38:14,913 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-04 21:38:14,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:14,914 INFO L225 Difference]: With dead ends: 62 [2019-08-04 21:38:14,915 INFO L226 Difference]: Without dead ends: 62 [2019-08-04 21:38:14,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-04 21:38:14,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-04 21:38:14,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-04 21:38:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-04 21:38:14,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-04 21:38:14,918 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-04 21:38:14,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:14,918 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-04 21:38:14,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-04 21:38:14,918 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-04 21:38:14,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-04 21:38:14,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:14,919 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-04 21:38:14,919 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:14,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:14,919 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-04 21:38:14,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:14,972 WARN L254 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-04 21:38:14,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:16,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:16,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:16,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-04 21:38:16,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-04 21:38:16,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-04 21:38:16,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:38:16,758 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-04 21:38:19,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:19,294 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-04 21:38:19,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-04 21:38:19,295 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-04 21:38:19,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:19,295 INFO L225 Difference]: With dead ends: 63 [2019-08-04 21:38:19,296 INFO L226 Difference]: Without dead ends: 63 [2019-08-04 21:38:19,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-04 21:38:19,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-04 21:38:19,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-04 21:38:19,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-04 21:38:19,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-04 21:38:19,299 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-04 21:38:19,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:19,299 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-04 21:38:19,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-04 21:38:19,299 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-04 21:38:19,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-04 21:38:19,300 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:19,300 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-04 21:38:19,300 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:19,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:19,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-04 21:38:19,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:19,337 WARN L254 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-04 21:38:19,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:20,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:20,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-04 21:38:20,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-04 21:38:20,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-04 21:38:20,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:38:20,710 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-04 21:38:23,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:23,495 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-04 21:38:23,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-04 21:38:23,496 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-04 21:38:23,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:23,497 INFO L225 Difference]: With dead ends: 64 [2019-08-04 21:38:23,497 INFO L226 Difference]: Without dead ends: 64 [2019-08-04 21:38:23,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-04 21:38:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-04 21:38:23,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-04 21:38:23,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-04 21:38:23,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-04 21:38:23,500 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-04 21:38:23,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:23,500 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-04 21:38:23,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-04 21:38:23,500 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-04 21:38:23,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-04 21:38:23,501 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:23,501 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-04 21:38:23,501 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:23,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:23,502 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-04 21:38:23,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:23,549 WARN L254 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 124 conjunts are in the unsatisfiable core [2019-08-04 21:38:23,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:24,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:24,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-04 21:38:24,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-04 21:38:24,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-04 21:38:24,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:38:24,982 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-04 21:38:27,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:27,899 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-04 21:38:27,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-04 21:38:27,899 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-04 21:38:27,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:27,900 INFO L225 Difference]: With dead ends: 65 [2019-08-04 21:38:27,900 INFO L226 Difference]: Without dead ends: 65 [2019-08-04 21:38:27,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-04 21:38:27,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-04 21:38:27,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-04 21:38:27,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-04 21:38:27,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-04 21:38:27,903 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-04 21:38:27,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:27,904 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-04 21:38:27,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-04 21:38:27,904 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-04 21:38:27,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-04 21:38:27,904 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:27,904 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-04 21:38:27,905 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:27,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:27,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-04 21:38:27,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:27,946 WARN L254 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-04 21:38:27,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:29,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:29,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-04 21:38:29,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-04 21:38:29,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-04 21:38:29,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:38:29,420 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-04 21:38:33,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:33,544 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-04 21:38:33,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-04 21:38:33,544 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-04 21:38:33,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:33,545 INFO L225 Difference]: With dead ends: 66 [2019-08-04 21:38:33,545 INFO L226 Difference]: Without dead ends: 66 [2019-08-04 21:38:33,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-04 21:38:33,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-04 21:38:33,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-04 21:38:33,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-04 21:38:33,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-04 21:38:33,548 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-04 21:38:33,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:33,548 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-04 21:38:33,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-04 21:38:33,548 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-04 21:38:33,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-04 21:38:33,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:33,549 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-04 21:38:33,549 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:33,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:33,549 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-04 21:38:33,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:33,608 WARN L254 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 128 conjunts are in the unsatisfiable core [2019-08-04 21:38:33,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:35,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:35,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:35,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-04 21:38:35,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-04 21:38:35,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-04 21:38:35,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:38:35,114 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-04 21:38:38,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:38,272 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-04 21:38:38,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-04 21:38:38,273 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-04 21:38:38,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:38,274 INFO L225 Difference]: With dead ends: 67 [2019-08-04 21:38:38,274 INFO L226 Difference]: Without dead ends: 67 [2019-08-04 21:38:38,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-04 21:38:38,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-04 21:38:38,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-04 21:38:38,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-04 21:38:38,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-04 21:38:38,277 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-04 21:38:38,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:38,277 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-04 21:38:38,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-04 21:38:38,277 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-04 21:38:38,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-04 21:38:38,278 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:38,278 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-04 21:38:38,278 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:38,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:38,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-04 21:38:38,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:38,327 WARN L254 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 130 conjunts are in the unsatisfiable core [2019-08-04 21:38:38,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:39,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:39,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-04 21:38:39,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-04 21:38:39,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-04 21:38:39,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:38:39,898 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-04 21:38:43,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:43,026 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-04 21:38:43,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-04 21:38:43,027 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-04 21:38:43,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:43,028 INFO L225 Difference]: With dead ends: 68 [2019-08-04 21:38:43,028 INFO L226 Difference]: Without dead ends: 68 [2019-08-04 21:38:43,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-04 21:38:43,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-04 21:38:43,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-04 21:38:43,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-04 21:38:43,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-04 21:38:43,032 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-04 21:38:43,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:43,032 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-04 21:38:43,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-04 21:38:43,032 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-04 21:38:43,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-04 21:38:43,033 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:43,033 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-04 21:38:43,033 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:43,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:43,033 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-04 21:38:43,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:43,082 WARN L254 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 132 conjunts are in the unsatisfiable core [2019-08-04 21:38:43,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:44,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:44,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-04 21:38:44,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-04 21:38:44,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-04 21:38:44,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:38:44,649 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-04 21:38:47,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:47,877 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-04 21:38:47,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-04 21:38:47,877 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-04 21:38:47,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:47,878 INFO L225 Difference]: With dead ends: 69 [2019-08-04 21:38:47,878 INFO L226 Difference]: Without dead ends: 69 [2019-08-04 21:38:47,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-04 21:38:47,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-04 21:38:47,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-04 21:38:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-04 21:38:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-04 21:38:47,881 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-04 21:38:47,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:47,881 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-04 21:38:47,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-04 21:38:47,881 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-04 21:38:47,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-04 21:38:47,882 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:47,882 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-04 21:38:47,882 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:47,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:47,882 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-04 21:38:47,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:47,929 WARN L254 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-04 21:38:47,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:49,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:49,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:49,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-04 21:38:49,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-04 21:38:49,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-04 21:38:49,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:38:49,602 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-04 21:38:52,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:52,915 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-04 21:38:52,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-04 21:38:52,916 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-04 21:38:52,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:52,916 INFO L225 Difference]: With dead ends: 70 [2019-08-04 21:38:52,916 INFO L226 Difference]: Without dead ends: 70 [2019-08-04 21:38:52,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-04 21:38:52,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-04 21:38:52,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-04 21:38:52,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-04 21:38:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-04 21:38:52,919 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-04 21:38:52,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:52,919 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-04 21:38:52,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-04 21:38:52,920 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-04 21:38:52,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-04 21:38:52,920 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:52,920 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-04 21:38:52,920 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:52,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:52,921 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-04 21:38:52,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:52,973 WARN L254 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 136 conjunts are in the unsatisfiable core [2019-08-04 21:38:52,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:54,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:54,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:54,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-04 21:38:54,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-04 21:38:54,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-04 21:38:54,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:38:54,660 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-04 21:38:58,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:58,119 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-04 21:38:58,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-04 21:38:58,120 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-04 21:38:58,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:58,127 INFO L225 Difference]: With dead ends: 71 [2019-08-04 21:38:58,127 INFO L226 Difference]: Without dead ends: 71 [2019-08-04 21:38:58,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-04 21:38:58,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-04 21:38:58,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-04 21:38:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-04 21:38:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-04 21:38:58,129 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-04 21:38:58,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:58,129 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-04 21:38:58,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-04 21:38:58,130 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-04 21:38:58,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-04 21:38:58,130 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:58,130 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-04 21:38:58,130 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:58,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:58,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-04 21:38:58,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:58,196 WARN L254 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-04 21:38:58,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:59,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:59,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:59,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-04 21:38:59,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-04 21:38:59,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-04 21:38:59,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:38:59,989 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-04 21:39:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:03,446 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-04 21:39:03,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-04 21:39:03,447 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-04 21:39:03,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:03,447 INFO L225 Difference]: With dead ends: 72 [2019-08-04 21:39:03,448 INFO L226 Difference]: Without dead ends: 72 [2019-08-04 21:39:03,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-04 21:39:03,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-04 21:39:03,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-04 21:39:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-04 21:39:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-04 21:39:03,451 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-04 21:39:03,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:03,451 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-04 21:39:03,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-04 21:39:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-04 21:39:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-04 21:39:03,452 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:03,452 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-04 21:39:03,452 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:03,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:03,452 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-04 21:39:03,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:03,508 WARN L254 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 140 conjunts are in the unsatisfiable core [2019-08-04 21:39:03,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:05,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:05,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:05,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-04 21:39:05,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-04 21:39:05,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-04 21:39:05,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:39:05,299 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-04 21:39:08,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:08,804 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-04 21:39:08,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-04 21:39:08,805 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-04 21:39:08,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:08,806 INFO L225 Difference]: With dead ends: 73 [2019-08-04 21:39:08,806 INFO L226 Difference]: Without dead ends: 73 [2019-08-04 21:39:08,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-04 21:39:08,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-04 21:39:08,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-04 21:39:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-04 21:39:08,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-04 21:39:08,809 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-04 21:39:08,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:08,809 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-04 21:39:08,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-04 21:39:08,809 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-04 21:39:08,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-04 21:39:08,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:08,810 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-04 21:39:08,811 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:08,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:08,811 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-04 21:39:08,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:08,869 WARN L254 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 142 conjunts are in the unsatisfiable core [2019-08-04 21:39:08,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:10,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:10,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:10,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-04 21:39:10,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-04 21:39:10,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-04 21:39:10,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:39:10,705 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-04 21:39:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:14,397 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-04 21:39:14,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-04 21:39:14,397 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-04 21:39:14,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:14,398 INFO L225 Difference]: With dead ends: 74 [2019-08-04 21:39:14,398 INFO L226 Difference]: Without dead ends: 74 [2019-08-04 21:39:14,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-04 21:39:14,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-04 21:39:14,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-04 21:39:14,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-04 21:39:14,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-04 21:39:14,401 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-04 21:39:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:14,402 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-04 21:39:14,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-04 21:39:14,402 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-04 21:39:14,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-04 21:39:14,402 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:14,402 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-04 21:39:14,403 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:14,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:14,403 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-04 21:39:14,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:14,491 WARN L254 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 144 conjunts are in the unsatisfiable core [2019-08-04 21:39:14,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:16,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:16,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-04 21:39:16,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-04 21:39:16,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-04 21:39:16,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:39:16,530 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-04 21:39:20,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:20,536 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-04 21:39:20,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-04 21:39:20,537 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-04 21:39:20,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:20,538 INFO L225 Difference]: With dead ends: 75 [2019-08-04 21:39:20,538 INFO L226 Difference]: Without dead ends: 75 [2019-08-04 21:39:20,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-04 21:39:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-04 21:39:20,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-04 21:39:20,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-04 21:39:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-04 21:39:20,540 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-04 21:39:20,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:20,541 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-04 21:39:20,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-04 21:39:20,541 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-04 21:39:20,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-04 21:39:20,541 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:20,541 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-04 21:39:20,542 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:20,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:20,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-04 21:39:20,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:20,625 WARN L254 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 146 conjunts are in the unsatisfiable core [2019-08-04 21:39:20,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:23,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:23,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:23,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-04 21:39:23,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-04 21:39:23,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-04 21:39:23,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:39:23,135 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-04 21:39:26,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:26,919 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-04 21:39:26,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-04 21:39:26,919 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-04 21:39:26,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:26,920 INFO L225 Difference]: With dead ends: 76 [2019-08-04 21:39:26,921 INFO L226 Difference]: Without dead ends: 76 [2019-08-04 21:39:26,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-04 21:39:26,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-04 21:39:26,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-04 21:39:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-04 21:39:26,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-04 21:39:26,924 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-04 21:39:26,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:26,924 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-04 21:39:26,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-04 21:39:26,924 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-04 21:39:26,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-04 21:39:26,925 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:26,925 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-04 21:39:26,925 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:26,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:26,926 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-04 21:39:26,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:27,006 WARN L254 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 148 conjunts are in the unsatisfiable core [2019-08-04 21:39:27,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:29,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:29,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-04 21:39:29,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-04 21:39:29,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-04 21:39:29,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:39:29,349 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-04 21:39:33,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:33,454 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-04 21:39:33,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-04 21:39:33,455 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-04 21:39:33,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:33,456 INFO L225 Difference]: With dead ends: 77 [2019-08-04 21:39:33,456 INFO L226 Difference]: Without dead ends: 77 [2019-08-04 21:39:33,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-04 21:39:33,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-04 21:39:33,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-04 21:39:33,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-04 21:39:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-04 21:39:33,459 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-04 21:39:33,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:33,459 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-04 21:39:33,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-04 21:39:33,459 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-04 21:39:33,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-04 21:39:33,460 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:33,460 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-04 21:39:33,460 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:33,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:33,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-04 21:39:33,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:33,522 WARN L254 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-04 21:39:33,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:35,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:35,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:35,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-04 21:39:35,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-04 21:39:35,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-04 21:39:35,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:39:35,601 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-04 21:39:39,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:39,838 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-04 21:39:39,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-04 21:39:39,839 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-04 21:39:39,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:39,840 INFO L225 Difference]: With dead ends: 78 [2019-08-04 21:39:39,840 INFO L226 Difference]: Without dead ends: 78 [2019-08-04 21:39:39,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-04 21:39:39,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-04 21:39:39,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-04 21:39:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-04 21:39:39,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-04 21:39:39,842 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-04 21:39:39,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:39,842 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-04 21:39:39,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-04 21:39:39,842 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-04 21:39:39,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-04 21:39:39,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:39,843 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-04 21:39:39,843 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:39,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:39,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-04 21:39:39,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:39,903 WARN L254 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 152 conjunts are in the unsatisfiable core [2019-08-04 21:39:39,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:42,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:42,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-04 21:39:42,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-04 21:39:42,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-04 21:39:42,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:39:42,010 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-04 21:39:46,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:46,263 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-04 21:39:46,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-04 21:39:46,264 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-04 21:39:46,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:46,264 INFO L225 Difference]: With dead ends: 79 [2019-08-04 21:39:46,265 INFO L226 Difference]: Without dead ends: 79 [2019-08-04 21:39:46,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-04 21:39:46,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-04 21:39:46,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-04 21:39:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-04 21:39:46,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-04 21:39:46,268 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-04 21:39:46,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:46,268 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-04 21:39:46,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-04 21:39:46,268 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-04 21:39:46,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-04 21:39:46,269 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:46,269 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-04 21:39:46,269 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:46,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:46,269 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-04 21:39:46,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:46,332 WARN L254 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 154 conjunts are in the unsatisfiable core [2019-08-04 21:39:46,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:48,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:48,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:48,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-04 21:39:48,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-04 21:39:48,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-04 21:39:48,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:39:48,794 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-04 21:39:52,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:39:52,931 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-04 21:39:52,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-04 21:39:52,931 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-04 21:39:52,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:39:52,932 INFO L225 Difference]: With dead ends: 80 [2019-08-04 21:39:52,932 INFO L226 Difference]: Without dead ends: 80 [2019-08-04 21:39:52,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-04 21:39:52,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-04 21:39:52,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-04 21:39:52,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-04 21:39:52,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-04 21:39:52,935 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-04 21:39:52,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:39:52,935 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-04 21:39:52,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-04 21:39:52,935 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-04 21:39:52,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-04 21:39:52,936 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:39:52,936 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-04 21:39:52,936 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:39:52,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:39:52,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-04 21:39:52,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:39:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:39:53,006 WARN L254 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 156 conjunts are in the unsatisfiable core [2019-08-04 21:39:53,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:39:55,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:39:55,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:39:55,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-04 21:39:55,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-04 21:39:55,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-04 21:39:55,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:39:55,589 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-04 21:40:00,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:00,037 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-04 21:40:00,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-04 21:40:00,038 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-04 21:40:00,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:00,038 INFO L225 Difference]: With dead ends: 81 [2019-08-04 21:40:00,039 INFO L226 Difference]: Without dead ends: 81 [2019-08-04 21:40:00,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-04 21:40:00,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-04 21:40:00,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-04 21:40:00,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-04 21:40:00,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-04 21:40:00,042 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-04 21:40:00,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:00,042 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-04 21:40:00,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-04 21:40:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-04 21:40:00,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-04 21:40:00,043 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:00,043 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-04 21:40:00,043 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:00,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:00,043 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-04 21:40:00,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:00,141 WARN L254 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 158 conjunts are in the unsatisfiable core [2019-08-04 21:40:00,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:02,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:02,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:02,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-04 21:40:02,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-04 21:40:02,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-04 21:40:02,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:40:02,508 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-04 21:40:07,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:07,237 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-04 21:40:07,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-04 21:40:07,238 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-04 21:40:07,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:07,238 INFO L225 Difference]: With dead ends: 82 [2019-08-04 21:40:07,238 INFO L226 Difference]: Without dead ends: 82 [2019-08-04 21:40:07,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-04 21:40:07,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-04 21:40:07,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-04 21:40:07,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-04 21:40:07,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-04 21:40:07,242 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-04 21:40:07,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:07,242 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-04 21:40:07,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-04 21:40:07,242 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-04 21:40:07,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-04 21:40:07,243 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:07,243 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-04 21:40:07,243 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:07,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:07,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-08-04 21:40:07,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:07,315 WARN L254 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 160 conjunts are in the unsatisfiable core [2019-08-04 21:40:07,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:09,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:09,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:09,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-04 21:40:09,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-04 21:40:09,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-04 21:40:09,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:40:09,910 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-04 21:40:14,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:14,728 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-04 21:40:14,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-04 21:40:14,728 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-04 21:40:14,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:14,729 INFO L225 Difference]: With dead ends: 83 [2019-08-04 21:40:14,729 INFO L226 Difference]: Without dead ends: 83 [2019-08-04 21:40:14,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2019-08-04 21:40:14,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-04 21:40:14,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-04 21:40:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-04 21:40:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-04 21:40:14,732 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-04 21:40:14,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:14,732 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-04 21:40:14,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-04 21:40:14,733 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-04 21:40:14,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-04 21:40:14,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:14,733 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-04 21:40:14,733 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:14,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:14,734 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-08-04 21:40:14,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:14,803 WARN L254 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-04 21:40:14,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:17,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:17,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-04 21:40:17,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-04 21:40:17,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-04 21:40:17,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:40:17,207 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-04 21:40:22,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:22,031 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-04 21:40:22,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-04 21:40:22,031 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-04 21:40:22,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:22,032 INFO L225 Difference]: With dead ends: 84 [2019-08-04 21:40:22,032 INFO L226 Difference]: Without dead ends: 84 [2019-08-04 21:40:22,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2019-08-04 21:40:22,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-04 21:40:22,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-04 21:40:22,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-04 21:40:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-04 21:40:22,035 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-04 21:40:22,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:22,036 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-04 21:40:22,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-04 21:40:22,036 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-04 21:40:22,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-04 21:40:22,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:22,037 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-04 21:40:22,037 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:22,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:22,037 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-08-04 21:40:22,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:22,107 WARN L254 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 164 conjunts are in the unsatisfiable core [2019-08-04 21:40:22,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:26,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:26,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:26,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-04 21:40:26,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-04 21:40:26,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-04 21:40:26,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:40:26,629 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-04 21:40:31,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:31,578 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-04 21:40:31,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-04 21:40:31,578 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-04 21:40:31,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:31,579 INFO L225 Difference]: With dead ends: 85 [2019-08-04 21:40:31,579 INFO L226 Difference]: Without dead ends: 85 [2019-08-04 21:40:31,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2019-08-04 21:40:31,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-04 21:40:31,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-04 21:40:31,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-04 21:40:31,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-04 21:40:31,581 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-04 21:40:31,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:31,581 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-04 21:40:31,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-04 21:40:31,581 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-04 21:40:31,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-04 21:40:31,582 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:31,582 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-04 21:40:31,582 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:31,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:31,582 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-08-04 21:40:31,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:31,654 WARN L254 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 166 conjunts are in the unsatisfiable core [2019-08-04 21:40:31,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:35,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:35,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:35,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-04 21:40:35,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-04 21:40:35,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-04 21:40:35,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:40:35,058 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-04 21:40:40,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:40:40,357 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-04 21:40:40,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-04 21:40:40,358 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-04 21:40:40,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:40:40,359 INFO L225 Difference]: With dead ends: 86 [2019-08-04 21:40:40,359 INFO L226 Difference]: Without dead ends: 86 [2019-08-04 21:40:40,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2019-08-04 21:40:40,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-04 21:40:40,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-04 21:40:40,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-04 21:40:40,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-04 21:40:40,362 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-04 21:40:40,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:40:40,362 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-04 21:40:40,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-04 21:40:40,362 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-04 21:40:40,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-04 21:40:40,363 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:40:40,363 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-04 21:40:40,363 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:40:40,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:40:40,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-08-04 21:40:40,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:40:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:40:40,431 WARN L254 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 168 conjunts are in the unsatisfiable core [2019-08-04 21:40:40,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:40:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:40:44,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:40:44,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-04 21:40:44,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-04 21:40:44,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-04 21:40:44,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2019-08-04 21:40:44,497 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. Received shutdown request... [2019-08-04 21:40:48,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-04 21:40:48,988 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-04 21:40:48,994 WARN L223 ceAbstractionStarter]: Timeout [2019-08-04 21:40:48,994 INFO L202 PluginConnector]: Adding new model overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:40:48 BoogieIcfgContainer [2019-08-04 21:40:48,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:40:48,996 INFO L168 Benchmark]: Toolchain (without parser) took 248696.29 ms. Allocated memory was 133.7 MB in the beginning and 192.9 MB in the end (delta: 59.2 MB). Free memory was 110.2 MB in the beginning and 137.6 MB in the end (delta: -27.4 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. [2019-08-04 21:40:48,997 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 133.7 MB. Free memory was 111.5 MB in the beginning and 111.3 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:40:48,998 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.47 ms. Allocated memory is still 133.7 MB. Free memory was 110.0 MB in the beginning and 108.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-04 21:40:48,998 INFO L168 Benchmark]: Boogie Preprocessor took 24.00 ms. Allocated memory is still 133.7 MB. Free memory was 108.5 MB in the beginning and 107.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:40:48,999 INFO L168 Benchmark]: RCFGBuilder took 255.37 ms. Allocated memory is still 133.7 MB. Free memory was 107.2 MB in the beginning and 98.4 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. [2019-08-04 21:40:49,000 INFO L168 Benchmark]: TraceAbstraction took 248370.64 ms. Allocated memory was 133.7 MB in the beginning and 192.9 MB in the end (delta: 59.2 MB). Free memory was 98.2 MB in the beginning and 137.6 MB in the end (delta: -39.4 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2019-08-04 21:40:49,002 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.25 ms. Allocated memory is still 133.7 MB. Free memory was 111.5 MB in the beginning and 111.3 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 37.47 ms. Allocated memory is still 133.7 MB. Free memory was 110.0 MB in the beginning and 108.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.00 ms. Allocated memory is still 133.7 MB. Free memory was 108.5 MB in the beginning and 107.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 255.37 ms. Allocated memory is still 133.7 MB. Free memory was 107.2 MB in the beginning and 98.4 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248370.64 ms. Allocated memory was 133.7 MB in the beginning and 192.9 MB in the end (delta: 59.2 MB). Free memory was 98.2 MB in the beginning and 137.6 MB in the end (delta: -39.4 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (86states) and FLOYD_HOARE automaton (currently 75 states, 85 states before enhancement),while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 248.3s OverallTime, 83 OverallIterations, 82 TraceHistogramMax, 151.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 247 SDtfs, 0 SDslu, 3403 SDs, 0 SdLazy, 200029 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 124.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3569 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3486 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 92.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=82, 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.2s AutomataMinimizationTime, 82 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 93.6s InterpolantComputationTime, 3652 NumberOfCodeBlocks, 3652 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 3569 ConstructedInterpolants, 0 QuantifiedInterpolants, 596189 SizeOfPredicates, 166 NumberOfNonLiveVariables, 11205 ConjunctsInSsa, 7138 ConjunctsInUnsatCore, 83 InterpolantComputations, 1 PerfectInterpolantSequences, 0/95284 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown