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/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:57:13,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:57:13,129 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:57:13,141 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:57:13,141 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:57:13,142 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:57:13,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:57:13,146 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:57:13,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:57:13,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:57:13,149 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:57:13,150 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:57:13,150 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:57:13,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:57:13,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:57:13,154 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:57:13,155 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:57:13,156 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:57:13,157 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:57:13,160 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:57:13,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:57:13,162 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:57:13,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:57:13,164 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:57:13,167 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:57:13,167 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:57:13,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:57:13,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:57:13,169 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:57:13,170 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:57:13,170 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:57:13,171 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:57:13,172 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:57:13,173 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:57:13,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:57:13,174 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:57:13,175 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:57:13,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:57:13,175 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:57:13,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:57:13,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:57:13,205 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:57:13,217 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:57:13,221 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:57:13,223 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:57:13,223 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:57:13,224 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_11.bpl [2019-08-05 10:57:13,224 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_11.bpl' [2019-08-05 10:57:13,300 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:57:13,302 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:57:13,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:57:13,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:57:13,303 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:57:13,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:13" (1/1) ... [2019-08-05 10:57:13,334 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:13" (1/1) ... [2019-08-05 10:57:13,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:57:13,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:57:13,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:57:13,344 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:57:13,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:13" (1/1) ... [2019-08-05 10:57:13,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:13" (1/1) ... [2019-08-05 10:57:13,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:13" (1/1) ... [2019-08-05 10:57:13,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:13" (1/1) ... [2019-08-05 10:57:13,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:13" (1/1) ... [2019-08-05 10:57:13,367 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:13" (1/1) ... [2019-08-05 10:57:13,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:13" (1/1) ... [2019-08-05 10:57:13,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:57:13,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:57:13,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:57:13,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:57:13,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:57:13,461 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:57:13,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:57:13,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:57:13,732 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:57:13,732 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:57:13,733 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:57:13 BoogieIcfgContainer [2019-08-05 10:57:13,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:57:13,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:57:13,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:57:13,738 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:57:13,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:13" (1/2) ... [2019-08-05 10:57:13,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7584f2f0 and model type 20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:57:13, skipping insertion in model container [2019-08-05 10:57:13,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:57:13" (2/2) ... [2019-08-05 10:57:13,742 INFO L109 eAbstractionObserver]: Analyzing ICFG 20051113-1.c_false-valid-memtrack.i_11.bpl [2019-08-05 10:57:13,752 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:57:13,761 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:57:13,778 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:57:13,806 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:57:13,807 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:57:13,807 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:57:13,808 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:57:13,808 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:57:13,808 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:57:13,808 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:57:13,808 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:57:13,808 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:57:13,822 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:57:13,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:57:13,831 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:13,832 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:57:13,834 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:13,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:13,841 INFO L82 PathProgramCache]: Analyzing trace with hash 29985, now seen corresponding path program 1 times [2019-08-05 10:57:13,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:13,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:57:13,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:14,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:57:14,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:57:14,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:57:14,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:57:14,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:57:14,114 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:57:14,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:14,177 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:57:14,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:57:14,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:57:14,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:14,191 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:57:14,191 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:57:14,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:57:14,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:57:14,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:57:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:57:14,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:57:14,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:57:14,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:14,229 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:57:14,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:57:14,229 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:57:14,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:57:14,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:14,230 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:57:14,231 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:14,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:14,231 INFO L82 PathProgramCache]: Analyzing trace with hash 927559, now seen corresponding path program 1 times [2019-08-05 10:57:14,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:14,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:57:14,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:14,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:14,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:14,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:57:14,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:57:14,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:57:14,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:57:14,405 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:57:14,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:14,455 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:57:14,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:57:14,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:57:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:14,456 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:57:14,456 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:57:14,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:57:14,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:57:14,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:57:14,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:57:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:57:14,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:57:14,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:14,460 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:57:14,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:57:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:57:14,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:57:14,463 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:14,463 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:57:14,464 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:14,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:14,464 INFO L82 PathProgramCache]: Analyzing trace with hash 28752353, now seen corresponding path program 2 times [2019-08-05 10:57:14,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:14,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:57:14,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:14,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:14,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:14,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:57:14,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:57:14,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:57:14,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:57:14,603 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:57:14,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:14,662 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:57:14,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:57:14,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:57:14,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:14,664 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:57:14,664 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:57:14,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:57:14,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:57:14,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:57:14,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:57:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:57:14,667 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:57:14,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:14,667 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:57:14,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:57:14,667 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:57:14,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:57:14,668 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:14,668 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:57:14,668 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:14,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:14,669 INFO L82 PathProgramCache]: Analyzing trace with hash 891320967, now seen corresponding path program 3 times [2019-08-05 10:57:14,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:14,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:57:14,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:14,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:14,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:57:14,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:57:14,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:57:14,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:57:14,906 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:57:14,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:14,961 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:57:14,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:57:14,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:57:14,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:14,963 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:57:14,963 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:57:14,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:57:14,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:57:14,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:57:14,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:57:14,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:57:14,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:57:14,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:14,966 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:57:14,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:57:14,967 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:57:14,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:57:14,967 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:14,968 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:57:14,968 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:14,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:14,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144225, now seen corresponding path program 4 times [2019-08-05 10:57:14,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:15,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:57:15,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:15,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:15,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:57:15,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:57:15,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:57:15,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:57:15,199 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:57:15,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:15,233 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:57:15,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:57:15,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:57:15,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:15,235 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:57:15,235 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:57:15,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:57:15,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:57:15,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:57:15,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:57:15,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:57:15,238 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:57:15,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:15,240 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:57:15,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:57:15,241 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:57:15,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:57:15,241 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:15,241 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:57:15,242 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:15,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:15,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894151, now seen corresponding path program 5 times [2019-08-05 10:57:15,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:15,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:57:15,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:15,496 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:15,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:15,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:57:15,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:57:15,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:57:15,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:57:15,499 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:57:15,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:15,536 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:57:15,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:57:15,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:57:15,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:15,540 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:57:15,540 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:57:15,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:57:15,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:57:15,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:57:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:57:15,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:57:15,543 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:57:15,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:15,544 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:57:15,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:57:15,544 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:57:15,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:57:15,544 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:15,545 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:57:15,545 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:15,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:15,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141857, now seen corresponding path program 6 times [2019-08-05 10:57:15,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:15,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:57:15,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:15,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:15,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:57:15,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:57:15,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:57:15,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:57:15,832 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:57:15,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:15,864 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:57:15,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:57:15,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:57:15,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:15,866 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:57:15,866 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:57:15,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:57:15,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:57:15,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:57:15,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:57:15,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:57:15,870 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:57:15,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:15,871 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:57:15,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:57:15,871 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:57:15,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:57:15,871 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:15,872 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:57:15,872 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:15,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:15,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820743, now seen corresponding path program 7 times [2019-08-05 10:57:15,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:15,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:57:15,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:16,329 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:16,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:16,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:57:16,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:57:16,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:57:16,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:57:16,331 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:57:16,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:16,369 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:57:16,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:57:16,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:57:16,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:16,371 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:57:16,371 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:57:16,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:57:16,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:57:16,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:57:16,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:57:16,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:57:16,376 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:57:16,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:16,376 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:57:16,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:57:16,377 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:57:16,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:57:16,377 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:16,377 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:57:16,378 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:16,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:16,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166495, now seen corresponding path program 8 times [2019-08-05 10:57:16,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:16,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:57:16,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:16,662 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:16,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:16,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:57:16,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:57:16,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:57:16,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:57:16,667 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:57:16,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:16,722 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:57:16,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:57:16,723 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:57:16,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:16,724 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:57:16,724 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:57:16,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:57:16,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:57:16,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:57:16,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:57:16,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:57:16,728 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:57:16,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:16,728 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:57:16,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:57:16,728 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:57:16,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:57:16,729 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:16,729 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:57:16,730 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:16,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:16,730 INFO L82 PathProgramCache]: Analyzing trace with hash -562523065, now seen corresponding path program 9 times [2019-08-05 10:57:16,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:16,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:57:16,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:17,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:17,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:57:17,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:57:17,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:57:17,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:57:17,127 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:57:17,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:17,183 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:57:17,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:57:17,184 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:57:17,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:17,185 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:57:17,185 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:57:17,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:57:17,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:57:17,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:57:17,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:57:17,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:57:17,189 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:57:17,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:17,189 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:57:17,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:57:17,189 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:57:17,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:57:17,190 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:17,190 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:57:17,190 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:17,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:17,191 INFO L82 PathProgramCache]: Analyzing trace with hash -258347807, now seen corresponding path program 10 times [2019-08-05 10:57:17,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:17,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:57:17,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:17,647 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-05 10:57:17,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:17,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:57:17,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:57:17,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:57:17,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:57:17,650 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:57:17,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:17,686 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:57:17,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:57:17,687 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:57:17,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:17,688 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:57:17,688 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:57:17,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:57:17,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:57:17,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:57:17,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:57:17,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:57:17,690 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:57:17,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:17,691 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:57:17,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:57:17,691 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:57:17,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:57:17,692 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:17,692 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:57:17,692 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:17,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:17,692 INFO L82 PathProgramCache]: Analyzing trace with hash 581150599, now seen corresponding path program 11 times [2019-08-05 10:57:17,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:17,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:57:17,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:18,073 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-05 10:57:18,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:18,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:57:18,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:57:18,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:57:18,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:57:18,075 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:57:18,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:18,107 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:57:18,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:57:18,107 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:57:18,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:18,108 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:57:18,109 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:57:18,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:57:18,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:57:18,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:57:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:57:18,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:57:18,111 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:57:18,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:18,112 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:57:18,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:57:18,112 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:57:18,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:57:18,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:18,113 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:57:18,113 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:18,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:18,113 INFO L82 PathProgramCache]: Analyzing trace with hash 835797409, now seen corresponding path program 12 times [2019-08-05 10:57:18,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:18,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:57:18,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:18,470 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-05 10:57:18,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:18,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:57:18,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:57:18,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:57:18,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:57:18,472 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:57:18,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:18,519 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:57:18,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:57:18,520 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:57:18,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:18,523 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:57:18,524 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:57:18,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:57:18,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:57:18,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:57:18,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:57:18,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:57:18,527 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:57:18,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:18,528 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:57:18,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:57:18,528 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:57:18,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:57:18,528 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:18,529 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:57:18,529 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:18,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:18,529 INFO L82 PathProgramCache]: Analyzing trace with hash 139913927, now seen corresponding path program 13 times [2019-08-05 10:57:18,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:18,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:57:18,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:19,050 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-05 10:57:19,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:19,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:57:19,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:57:19,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:57:19,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:57:19,053 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:57:19,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:19,126 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:57:19,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:57:19,127 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:57:19,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:19,128 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:57:19,128 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:57:19,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:57:19,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:57:19,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:57:19,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:57:19,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:57:19,132 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:57:19,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:19,132 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:57:19,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:57:19,133 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:57:19,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:57:19,133 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:19,133 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:57:19,134 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:19,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:19,134 INFO L82 PathProgramCache]: Analyzing trace with hash 42362465, now seen corresponding path program 14 times [2019-08-05 10:57:19,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:19,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:57:19,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:19,838 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-05 10:57:19,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:19,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:57:19,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:57:19,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:57:19,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:57:19,840 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:57:19,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:19,942 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:57:19,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:57:19,942 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:57:19,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:19,943 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:57:19,943 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:57:19,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:57:19,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:57:19,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:57:19,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:57:19,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:57:19,946 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:57:19,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:19,946 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:57:19,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:57:19,947 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:57:19,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:57:19,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:19,947 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:57:19,948 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:19,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:19,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234439, now seen corresponding path program 15 times [2019-08-05 10:57:19,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:19,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:57:19,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:20,378 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-05 10:57:20,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:20,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:57:20,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:57:20,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:57:20,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:57:20,379 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:57:20,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:20,428 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:57:20,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:57:20,429 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:57:20,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:20,430 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:57:20,430 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:57:20,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:57:20,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:57:20,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:57:20,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:57:20,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:57:20,435 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:57:20,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:20,435 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:57:20,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:57:20,435 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:57:20,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:57:20,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:20,436 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:57:20,436 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:20,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:20,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559969, now seen corresponding path program 16 times [2019-08-05 10:57:20,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:20,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:57:20,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:20,927 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-05 10:57:20,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:20,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:57:20,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:57:20,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:57:20,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:57:20,929 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:57:20,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:20,967 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:57:20,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:57:20,968 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:57:20,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:20,969 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:57:20,969 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:57:20,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:57:20,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:57:20,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:57:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:57:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:57:20,972 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:57:20,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:20,972 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:57:20,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:57:20,972 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:57:20,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:57:20,973 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:20,973 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:57:20,973 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:20,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:20,974 INFO L82 PathProgramCache]: Analyzing trace with hash -702152377, now seen corresponding path program 17 times [2019-08-05 10:57:20,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:20,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:57:20,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:21,337 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-05 10:57:21,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:21,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:57:21,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:57:21,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:57:21,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:57:21,339 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:57:21,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:21,493 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:57:21,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:57:21,500 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:57:21,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:21,501 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:57:21,501 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:57:21,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:57:21,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:57:21,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:57:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:57:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:57:21,504 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:57:21,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:21,505 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:57:21,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:57:21,505 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:57:21,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:57:21,505 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:21,506 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:57:21,506 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:21,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:21,506 INFO L82 PathProgramCache]: Analyzing trace with hash -291889183, now seen corresponding path program 18 times [2019-08-05 10:57:21,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:21,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:57:21,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:21,879 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-05 10:57:21,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:21,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:57:21,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:57:21,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:57:21,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:57:21,882 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:57:21,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:21,954 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:57:21,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:57:21,955 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:57:21,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:21,956 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:57:21,956 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:57:21,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:57:21,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:57:21,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:57:21,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:57:21,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:57:21,961 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:57:21,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:21,961 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:57:21,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:57:21,961 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:57:21,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:57:21,962 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:21,962 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:57:21,962 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:21,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:21,963 INFO L82 PathProgramCache]: Analyzing trace with hash -458632057, now seen corresponding path program 19 times [2019-08-05 10:57:21,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:21,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:57:21,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:22,389 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-05 10:57:22,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:22,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:57:22,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:57:22,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:57:22,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:57:22,392 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:57:22,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:22,449 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:57:22,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:57:22,449 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:57:22,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:22,450 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:57:22,450 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:57:22,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:57:22,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:57:22,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:57:22,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:57:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:57:22,454 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:57:22,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:22,455 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:57:22,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:57:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:57:22,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:57:22,455 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:22,456 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:57:22,456 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:22,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:22,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693855, now seen corresponding path program 20 times [2019-08-05 10:57:22,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:22,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:57:22,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:23,409 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-05 10:57:23,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:23,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:57:23,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:57:23,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:57:23,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:57:23,411 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:57:23,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:23,453 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:57:23,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:57:23,454 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:57:23,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:23,455 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:57:23,455 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:57:23,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:57:23,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:57:23,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:57:23,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:57:23,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:57:23,459 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:57:23,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:23,459 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:57:23,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:57:23,459 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:57:23,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:57:23,460 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:23,460 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:57:23,460 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:23,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:23,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161479, now seen corresponding path program 21 times [2019-08-05 10:57:23,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:23,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:57:23,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:23,919 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-05 10:57:23,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:23,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:57:23,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:57:23,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:57:23,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:57:23,920 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:57:24,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:24,031 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:57:24,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:57:24,034 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:57:24,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:24,035 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:57:24,035 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:57:24,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:57:24,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:57:24,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:57:24,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:57:24,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:57:24,038 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:57:24,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:24,038 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:57:24,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:57:24,038 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:57:24,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:57:24,039 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:24,039 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:57:24,039 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:24,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:24,040 INFO L82 PathProgramCache]: Analyzing trace with hash -818603679, now seen corresponding path program 22 times [2019-08-05 10:57:24,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:24,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:57:24,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:24,695 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-05 10:57:24,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:24,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:57:24,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:57:24,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:57:24,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:57:24,696 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:57:24,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:24,767 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:57:24,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:57:24,768 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:57:24,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:24,768 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:57:24,768 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:57:24,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:57:24,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:57:24,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:57:24,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:57:24,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:57:24,773 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:57:24,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:24,773 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:57:24,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:57:24,773 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:57:24,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:57:24,774 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:24,774 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:57:24,774 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:24,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:24,775 INFO L82 PathProgramCache]: Analyzing trace with hash 393087751, now seen corresponding path program 23 times [2019-08-05 10:57:24,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:24,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:57:24,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:25,312 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-05 10:57:25,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:25,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:57:25,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:57:25,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:57:25,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:57:25,314 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:57:25,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:25,383 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:57:25,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:57:25,384 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:57:25,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:25,384 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:57:25,385 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:57:25,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:57:25,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:57:25,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:57:25,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:57:25,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:57:25,389 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:57:25,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:25,390 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:57:25,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:57:25,390 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:57:25,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:57:25,390 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:25,391 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:57:25,391 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:25,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:25,391 INFO L82 PathProgramCache]: Analyzing trace with hash -699183583, now seen corresponding path program 24 times [2019-08-05 10:57:25,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:25,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:57:25,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:26,339 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-05 10:57:26,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:26,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:57:26,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:57:26,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:57:26,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:57:26,341 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:57:26,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:26,407 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:57:26,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:57:26,408 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:57:26,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:26,409 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:57:26,409 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:57:26,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:57:26,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:57:26,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:57:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:57:26,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:57:26,413 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:57:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:26,413 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:57:26,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:57:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:57:26,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:57:26,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:26,414 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:57:26,414 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:26,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:26,415 INFO L82 PathProgramCache]: Analyzing trace with hash -199856569, now seen corresponding path program 25 times [2019-08-05 10:57:26,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:26,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:57:26,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:27,076 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-05 10:57:27,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:27,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:57:27,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:57:27,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:57:27,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:57:27,078 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:57:27,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:27,123 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:57:27,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:57:27,123 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:57:27,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:27,124 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:57:27,124 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:57:27,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:57:27,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:57:27,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:57:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:57:27,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:57:27,128 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:57:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:27,128 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:57:27,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:57:27,128 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:57:27,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:57:27,129 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:27,129 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:57:27,129 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:27,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:27,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588319, now seen corresponding path program 26 times [2019-08-05 10:57:27,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:27,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:57:27,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:28,270 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-05 10:57:28,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:28,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:57:28,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:57:28,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:57:28,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:57:28,272 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:57:28,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:28,381 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:57:28,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:57:28,381 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:57:28,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:28,382 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:57:28,382 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:57:28,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:57:28,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:57:28,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:57:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:57:28,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:57:28,385 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:57:28,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:28,385 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:57:28,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:57:28,385 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:57:28,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:57:28,386 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:28,386 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:57:28,386 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:28,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:28,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302279, now seen corresponding path program 27 times [2019-08-05 10:57:28,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:28,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:57:28,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:30,107 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-05 10:57:30,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:30,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:57:30,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:57:30,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:57:30,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:57:30,109 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:57:30,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:30,205 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:57:30,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:57:30,206 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:57:30,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:30,206 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:57:30,207 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:57:30,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:57:30,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:57:30,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:57:30,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:57:30,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:57:30,210 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:57:30,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:30,210 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:57:30,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:57:30,210 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:57:30,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:57:30,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:30,211 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:57:30,211 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:30,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:30,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336991, now seen corresponding path program 28 times [2019-08-05 10:57:30,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:30,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:57:30,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:30,732 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-05 10:57:30,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:30,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:57:30,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:57:30,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:57:30,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:57:30,734 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:57:30,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:30,805 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:57:30,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:57:30,806 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:57:30,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:30,806 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:57:30,806 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:57:30,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:57:30,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:57:30,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:57:30,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:57:30,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:57:30,811 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:57:30,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:30,811 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:57:30,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:57:30,811 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:57:30,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:57:30,812 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:30,812 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:57:30,812 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:30,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:30,813 INFO L82 PathProgramCache]: Analyzing trace with hash 125289671, now seen corresponding path program 29 times [2019-08-05 10:57:30,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:30,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:57:30,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:31,377 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-05 10:57:31,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:31,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:57:31,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:57:31,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:57:31,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:57:31,379 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:57:31,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:31,452 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:57:31,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:57:31,452 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:57:31,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:31,453 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:57:31,453 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:57:31,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:57:31,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:57:31,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:57:31,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:57:31,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:57:31,458 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:57:31,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:31,458 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:57:31,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:57:31,458 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:57:31,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:57:31,459 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:31,459 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:57:31,459 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:31,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:31,459 INFO L82 PathProgramCache]: Analyzing trace with hash -410989471, now seen corresponding path program 30 times [2019-08-05 10:57:31,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:31,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:57:31,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:32,256 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-05 10:57:32,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:32,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:57:32,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:57:32,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:57:32,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:57:32,257 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:57:32,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:32,380 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:57:32,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:57:32,381 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:57:32,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:32,381 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:57:32,381 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:57:32,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:57:32,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:57:32,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:57:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:57:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:57:32,385 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:57:32,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:32,385 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:57:32,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:57:32,385 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:57:32,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:57:32,386 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:32,386 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:57:32,386 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:32,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:32,386 INFO L82 PathProgramCache]: Analyzing trace with hash 144226311, now seen corresponding path program 31 times [2019-08-05 10:57:32,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:32,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:57:32,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:33,437 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-05 10:57:33,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:33,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:57:33,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:57:33,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:57:33,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:57:33,439 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:57:33,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:33,508 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:57:33,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:57:33,508 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:57:33,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:33,509 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:57:33,509 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:57:33,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:57:33,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:57:33,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:57:33,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:57:33,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:57:33,513 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:57:33,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:33,513 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:57:33,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:57:33,514 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:57:33,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:57:33,514 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:33,514 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:57:33,515 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:33,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:33,515 INFO L82 PathProgramCache]: Analyzing trace with hash 176046369, now seen corresponding path program 32 times [2019-08-05 10:57:33,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:33,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:57:33,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:34,307 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-05 10:57:34,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:34,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:57:34,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:57:34,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:57:34,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:57:34,309 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:57:34,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:34,361 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:57:34,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:57:34,362 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:57:34,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:34,363 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:57:34,363 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:57:34,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:57:34,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:57:34,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:57:34,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:57:34,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:57:34,367 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:57:34,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:34,367 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:57:34,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:57:34,367 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:57:34,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:57:34,368 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:34,368 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:57:34,369 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:34,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:34,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468167, now seen corresponding path program 33 times [2019-08-05 10:57:34,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:34,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:57:34,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:35,072 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-05 10:57:35,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:35,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:57:35,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:57:35,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:57:35,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:57:35,074 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:57:35,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:35,136 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:57:35,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:57:35,137 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:57:35,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:35,138 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:57:35,138 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:57:35,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:57:35,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:57:35,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:57:35,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:57:35,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:57:35,141 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:57:35,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:35,141 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:57:35,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:57:35,141 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:57:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:57:35,142 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:35,142 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:57:35,142 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:35,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:35,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772833, now seen corresponding path program 34 times [2019-08-05 10:57:35,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:35,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:57:35,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:35,960 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-05 10:57:35,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:35,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:57:35,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:57:35,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:57:35,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:57:35,961 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:57:36,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:36,015 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:57:36,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:57:36,016 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:57:36,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:36,016 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:57:36,016 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:57:36,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:57:36,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:57:36,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:57:36,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:57:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:57:36,019 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:57:36,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:36,019 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:57:36,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:57:36,020 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:57:36,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:57:36,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:36,021 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:57:36,021 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:36,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:36,021 INFO L82 PathProgramCache]: Analyzing trace with hash 440348295, now seen corresponding path program 35 times [2019-08-05 10:57:36,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:36,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:57:36,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:37,118 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-05 10:57:37,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:37,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:57:37,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:57:37,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:57:37,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:57:37,120 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:57:37,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:37,197 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:57:37,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:57:37,198 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:57:37,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:37,198 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:57:37,199 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:57:37,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:57:37,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:57:37,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:57:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:57:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:57:37,202 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:57:37,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:37,202 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:57:37,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:57:37,202 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:57:37,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:57:37,202 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:37,202 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:57:37,203 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:37,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:37,203 INFO L82 PathProgramCache]: Analyzing trace with hash 765893281, now seen corresponding path program 36 times [2019-08-05 10:57:37,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:37,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:57:37,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:38,742 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-05 10:57:38,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:38,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:57:38,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:57:38,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:57:38,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:57:38,744 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:57:38,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:38,809 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:57:38,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:57:38,810 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:57:38,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:38,810 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:57:38,811 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:57:38,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:57:38,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:57:38,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:57:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:57:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:57:38,814 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:57:38,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:38,814 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:57:38,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:57:38,814 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:57:38,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:57:38,815 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:38,815 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:57:38,815 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:38,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:38,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114041, now seen corresponding path program 37 times [2019-08-05 10:57:38,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:38,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:57:38,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:39,720 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-05 10:57:39,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:39,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:57:39,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:57:39,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:57:39,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:57:39,722 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:57:39,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:39,813 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:57:39,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:57:39,814 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:57:39,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:39,815 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:57:39,815 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:57:39,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:57:39,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:57:39,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:57:39,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:57:39,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:57:39,817 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:57:39,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:39,818 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:57:39,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:57:39,818 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:57:39,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:57:39,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:39,819 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:57:39,819 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:39,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:39,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972193, now seen corresponding path program 38 times [2019-08-05 10:57:39,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:39,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:57:39,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:40,837 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-05 10:57:40,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:40,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:57:40,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:57:40,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:57:40,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:57:40,839 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:57:40,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:40,992 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:57:40,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:57:40,992 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:57:40,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:40,993 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:57:40,993 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:57:40,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:57:40,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:57:40,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:57:40,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:57:40,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:57:40,996 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:57:40,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:40,996 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:57:40,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:57:40,997 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:57:40,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:57:40,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:40,997 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:57:40,997 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:40,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:40,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495751, now seen corresponding path program 39 times [2019-08-05 10:57:40,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:41,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:57:41,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:42,017 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-05 10:57:42,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:42,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:57:42,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:57:42,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:57:42,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:57:42,019 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:57:42,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:42,104 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:57:42,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:57:42,105 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:57:42,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:42,105 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:57:42,106 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:57:42,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:57:42,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:57:42,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:57:42,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:57:42,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:57:42,108 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:57:42,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:42,108 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:57:42,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:57:42,108 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:57:42,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:57:42,109 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:42,109 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:57:42,109 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:42,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:42,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791457, now seen corresponding path program 40 times [2019-08-05 10:57:42,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:42,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:57:42,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:43,001 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-05 10:57:43,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:43,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:57:43,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:57:43,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:57:43,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:57:43,004 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:57:43,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:43,117 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:57:43,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:57:43,118 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:57:43,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:43,118 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:57:43,119 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:57:43,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:57:43,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:57:43,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:57:43,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:57:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:57:43,122 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:57:43,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:43,122 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:57:43,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:57:43,122 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:57:43,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:57:43,123 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:43,123 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:57:43,123 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:43,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:43,124 INFO L82 PathProgramCache]: Analyzing trace with hash -692041657, now seen corresponding path program 41 times [2019-08-05 10:57:43,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:43,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:57:43,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:44,223 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-05 10:57:44,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:44,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:57:44,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:57:44,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:57:44,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:57:44,225 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:57:44,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:44,303 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:57:44,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:57:44,303 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:57:44,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:44,304 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:57:44,304 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:57:44,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:57:44,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:57:44,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:57:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:57:44,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:57:44,307 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:57:44,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:44,307 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:57:44,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:57:44,308 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:57:44,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:57:44,308 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:44,308 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:57:44,308 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:44,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:44,308 INFO L82 PathProgramCache]: Analyzing trace with hash 21543137, now seen corresponding path program 42 times [2019-08-05 10:57:44,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:44,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:57:44,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:45,715 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-05 10:57:45,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:45,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:57:45,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:57:45,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:57:45,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:57:45,717 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:57:45,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:45,784 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:57:45,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:57:45,784 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:57:45,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:45,785 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:57:45,785 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:57:45,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:57:45,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:57:45,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:57:45,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:57:45,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:57:45,788 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:57:45,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:45,788 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:57:45,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:57:45,788 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:57:45,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:57:45,789 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:45,789 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:57:45,789 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:45,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:45,789 INFO L82 PathProgramCache]: Analyzing trace with hash 667835271, now seen corresponding path program 43 times [2019-08-05 10:57:45,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:45,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:57:45,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:46,758 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-05 10:57:46,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:46,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:57:46,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:57:46,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:57:46,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:57:46,760 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:57:46,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:46,857 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:57:46,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:57:46,858 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:57:46,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:46,859 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:57:46,859 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:57:46,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:57:46,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:57:46,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:57:46,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:57:46,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:57:46,862 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:57:46,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:46,862 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:57:46,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:57:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:57:46,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:57:46,863 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:46,863 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:57:46,863 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:46,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:46,864 INFO L82 PathProgramCache]: Analyzing trace with hash -771945055, now seen corresponding path program 44 times [2019-08-05 10:57:46,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:46,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:57:46,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:48,072 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-05 10:57:48,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:48,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:57:48,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:57:48,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:57:48,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:57:48,073 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:57:48,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:48,184 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:57:48,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:57:48,184 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:57:48,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:48,185 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:57:48,185 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:57:48,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:57:48,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:57:48,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:57:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:57:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:57:48,189 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:57:48,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:48,189 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:57:48,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:57:48,189 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:57:48,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:57:48,190 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:48,190 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:57:48,190 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:48,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:48,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505095, now seen corresponding path program 45 times [2019-08-05 10:57:48,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:48,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:57:48,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:49,585 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-05 10:57:49,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:49,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:57:49,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:57:49,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:57:49,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:57:49,586 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:57:49,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:49,912 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:57:49,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:57:49,913 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:57:49,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:49,913 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:57:49,913 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:57:49,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:57:49,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:57:49,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:57:49,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:57:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:57:49,915 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:57:49,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:49,915 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:57:49,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:57:49,915 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:57:49,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:57:49,915 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:49,915 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:57:49,916 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:49,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:49,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081121, now seen corresponding path program 46 times [2019-08-05 10:57:49,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:49,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:57:49,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:51,064 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-05 10:57:51,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:51,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:57:51,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:57:51,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:57:51,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:57:51,066 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:57:51,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:51,143 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:57:51,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:57:51,144 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:57:51,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:51,145 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:57:51,145 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:57:51,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:57:51,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:57:51,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:57:51,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:57:51,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:57:51,147 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:57:51,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:51,148 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:57:51,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:57:51,148 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:57:51,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:57:51,148 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:51,148 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:57:51,149 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:51,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:51,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192889, now seen corresponding path program 47 times [2019-08-05 10:57:51,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:51,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:57:51,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:52,331 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-05 10:57:52,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:52,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:57:52,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:57:52,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:57:52,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:57:52,333 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:57:52,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:52,404 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:57:52,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:57:52,405 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:57:52,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:52,405 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:57:52,406 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:57:52,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:57:52,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:57:52,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:57:52,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:57:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:57:52,409 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:57:52,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:52,409 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:57:52,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:57:52,410 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:57:52,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:57:52,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:52,410 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:57:52,410 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:52,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:52,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593313, now seen corresponding path program 48 times [2019-08-05 10:57:52,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:52,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:57:52,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:53,885 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-05 10:57:53,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:53,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:57:53,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:57:53,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:57:53,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:57:53,887 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:57:53,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:53,993 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:57:53,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:57:53,994 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:57:53,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:53,995 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:57:53,995 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:57:53,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:57:53,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:57:53,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:57:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:57:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:57:53,998 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:57:53,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:53,999 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:57:53,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:57:53,999 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:57:53,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:57:53,999 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:54,000 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:57:54,000 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:54,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:54,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314937, now seen corresponding path program 49 times [2019-08-05 10:57:54,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:54,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:57:54,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:55,310 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-05 10:57:55,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:55,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:57:55,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:57:55,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:57:55,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:57:55,311 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:57:55,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:55,388 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:57:55,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:57:55,388 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:57:55,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:55,389 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:57:55,389 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:57:55,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:57:55,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:57:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:57:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:57:55,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:57:55,393 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:57:55,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:55,393 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:57:55,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:57:55,393 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:57:55,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:57:55,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:55,394 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:57:55,394 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:55,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:55,394 INFO L82 PathProgramCache]: Analyzing trace with hash -105059359, now seen corresponding path program 50 times [2019-08-05 10:57:55,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:55,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:57:55,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:57,069 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-05 10:57:57,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:57,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:57:57,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:57:57,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:57:57,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:57:57,071 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:57:57,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:57,171 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:57:57,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:57:57,172 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:57:57,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:57,173 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:57:57,174 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:57:57,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:57:57,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:57:57,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:57:57,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:57:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:57:57,176 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:57:57,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:57,176 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:57:57,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:57:57,177 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:57:57,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:57:57,177 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:57,177 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:57:57,177 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:57,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:57,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125191, now seen corresponding path program 51 times [2019-08-05 10:57:57,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:57,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:57:57,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:58,924 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-05 10:57:58,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:58,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:57:58,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:57:58,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:57:58,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:57:58,925 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:57:59,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:59,031 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:57:59,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:57:59,031 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:57:59,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:59,032 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:57:59,032 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:57:59,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:57:59,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:57:59,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:57:59,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:57:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:57:59,035 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:57:59,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:59,035 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:57:59,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:57:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:57:59,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:57:59,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:59,036 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:57:59,036 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:59,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:59,036 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107873, now seen corresponding path program 52 times [2019-08-05 10:57:59,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:59,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:57:59,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:00,462 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-05 10:58:00,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:00,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:58:00,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:58:00,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:58:00,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:58:00,464 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:58:00,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:00,559 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:58:00,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:58:00,560 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:58:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:00,561 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:58:00,561 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:58:00,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:58:00,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:58:00,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:58:00,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:58:00,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:58:00,564 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:58:00,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:00,565 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:58:00,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:58:00,565 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:58:00,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:58:00,565 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:00,565 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:58:00,566 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:00,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:00,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832647, now seen corresponding path program 53 times [2019-08-05 10:58:00,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:00,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:58:00,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:02,228 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-05 10:58:02,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:02,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:58:02,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:58:02,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:58:02,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:58:02,229 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:58:02,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:02,307 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:58:02,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:58:02,308 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:58:02,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:02,309 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:58:02,309 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:58:02,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:58:02,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:58:02,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:58:02,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:58:02,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:58:02,312 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:58:02,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:02,312 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:58:02,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:58:02,312 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:58:02,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:58:02,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:02,313 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:58:02,313 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:02,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:02,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895583, now seen corresponding path program 54 times [2019-08-05 10:58:02,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:02,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:58:02,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:04,110 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-05 10:58:04,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:04,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:58:04,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:58:04,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:58:04,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:58:04,112 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:58:04,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:04,234 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:58:04,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:58:04,234 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:58:04,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:04,235 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:58:04,235 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:58:04,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:58:04,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:58:04,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:58:04,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:58:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:58:04,238 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:58:04,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:04,238 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:58:04,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:58:04,238 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:58:04,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:58:04,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:04,239 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:58:04,239 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:04,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:04,239 INFO L82 PathProgramCache]: Analyzing trace with hash -836059385, now seen corresponding path program 55 times [2019-08-05 10:58:04,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:04,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:58:04,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:06,027 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-05 10:58:06,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:06,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:58:06,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:58:06,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:58:06,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:58:06,028 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:58:06,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:06,131 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:58:06,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:58:06,131 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:58:06,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:06,132 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:58:06,132 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:58:06,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:58:06,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:58:06,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:58:06,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:58:06,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:58:06,136 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:58:06,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:06,136 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:58:06,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:58:06,136 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:58:06,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:58:06,137 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:06,137 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:58:06,137 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:06,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:06,137 INFO L82 PathProgramCache]: Analyzing trace with hash -148039135, now seen corresponding path program 56 times [2019-08-05 10:58:06,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:06,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:58:06,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:08,087 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-05 10:58:08,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:08,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:58:08,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:58:08,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:58:08,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:58:08,088 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:58:08,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:08,187 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:58:08,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:58:08,188 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:58:08,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:08,189 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:58:08,189 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:58:08,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:58:08,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:58:08,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:58:08,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:58:08,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:58:08,194 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:58:08,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:08,195 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:58:08,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:58:08,195 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:58:08,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:58:08,195 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:08,196 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:58:08,196 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:08,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:08,196 INFO L82 PathProgramCache]: Analyzing trace with hash -294247865, now seen corresponding path program 57 times [2019-08-05 10:58:08,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:08,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:58:08,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:10,520 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-05 10:58:10,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:10,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:58:10,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:58:10,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:58:10,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:58:10,522 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:58:10,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:10,610 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:58:10,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:58:10,611 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:58:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:10,611 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:58:10,612 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:58:10,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:58:10,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:58:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:58:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:58:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:58:10,615 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:58:10,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:10,615 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:58:10,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:58:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:58:10,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:58:10,616 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:10,616 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:58:10,617 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:10,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:10,617 INFO L82 PathProgramCache]: Analyzing trace with hash -531751199, now seen corresponding path program 58 times [2019-08-05 10:58:10,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:10,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:58:10,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:12,375 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-05 10:58:12,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:12,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:58:12,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:58:12,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:58:12,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:58:12,377 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:58:12,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:12,458 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:58:12,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:58:12,459 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:58:12,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:12,460 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:58:12,460 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:58:12,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:58:12,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:58:12,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:58:12,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:58:12,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:58:12,462 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:58:12,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:12,463 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:58:12,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:58:12,463 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:58:12,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:58:12,463 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:12,463 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:58:12,464 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:12,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:12,464 INFO L82 PathProgramCache]: Analyzing trace with hash 695580039, now seen corresponding path program 59 times [2019-08-05 10:58:12,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:12,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:58:12,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:14,636 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-05 10:58:14,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:14,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:58:14,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:58:14,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:58:14,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:58:14,638 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:58:14,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:14,764 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:58:14,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:58:14,765 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:58:14,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:14,766 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:58:14,766 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:58:14,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:58:14,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:58:14,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:58:14,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:58:14,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:58:14,769 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:58:14,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:14,770 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:58:14,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:58:14,770 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:58:14,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:58:14,770 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:14,770 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:58:14,770 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:14,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:14,771 INFO L82 PathProgramCache]: Analyzing trace with hash 88142753, now seen corresponding path program 60 times [2019-08-05 10:58:14,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:14,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:58:14,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:16,560 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-05 10:58:16,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:16,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:58:16,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:58:16,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:58:16,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:58:16,561 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:58:16,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:16,691 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:58:16,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:58:16,692 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:58:16,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:16,692 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:58:16,693 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:58:16,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:58:16,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:58:16,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:58:16,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:58:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:58:16,696 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:58:16,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:16,696 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:58:16,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:58:16,696 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:58:16,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:58:16,697 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:16,697 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:58:16,697 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:16,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:16,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543929, now seen corresponding path program 61 times [2019-08-05 10:58:16,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:16,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:58:16,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:18,735 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-05 10:58:18,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:18,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:58:18,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:58:18,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:58:18,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:58:18,737 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:58:18,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:18,872 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:58:18,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:58:18,872 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:58:18,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:18,873 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:58:18,873 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:58:18,874 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:58:18,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:58:18,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:58:18,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:58:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:58:18,876 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:58:18,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:18,876 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:58:18,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:58:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:58:18,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:58:18,877 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:18,877 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:58:18,877 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:18,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:18,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223519, now seen corresponding path program 62 times [2019-08-05 10:58:18,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:18,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:58:18,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:20,874 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-05 10:58:20,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:20,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:58:20,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:58:20,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:58:20,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:58:20,876 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:58:21,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:21,008 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:58:21,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:58:21,009 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:58:21,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:21,010 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:58:21,010 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:58:21,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:58:21,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:58:21,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:58:21,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:58:21,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:58:21,013 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:58:21,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:21,013 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:58:21,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:58:21,013 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:58:21,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:58:21,014 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:21,014 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:58:21,014 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:21,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:21,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774599, now seen corresponding path program 63 times [2019-08-05 10:58:21,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:21,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:58:21,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:23,174 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-05 10:58:23,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:23,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:58:23,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:58:23,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:58:23,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:58:23,176 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:58:23,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:23,353 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:58:23,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:58:23,355 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:58:23,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:23,356 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:58:23,356 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:58:23,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:58:23,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:58:23,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:58:23,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:58:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:58:23,358 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:58:23,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:23,358 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:58:23,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:58:23,359 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:58:23,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:58:23,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:23,359 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:58:23,359 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:23,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:23,360 INFO L82 PathProgramCache]: Analyzing trace with hash -892596959, now seen corresponding path program 64 times [2019-08-05 10:58:23,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:23,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:58:23,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:25,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-05 10:58:25,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:25,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:58:25,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:58:25,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:58:25,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:58:25,650 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:58:25,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:25,772 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:58:25,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:58:25,773 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:58:25,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:25,774 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:58:25,774 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:58:25,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:58:25,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:58:25,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:58:25,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:58:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:58:25,776 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:58:25,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:25,776 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:58:25,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:58:25,777 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:58:25,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:58:25,777 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:25,777 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:58:25,777 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:25,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:25,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703929, now seen corresponding path program 65 times [2019-08-05 10:58:25,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:25,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:58:25,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:27,801 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-05 10:58:27,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:27,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:58:27,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:58:27,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:58:27,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:58:27,803 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:58:27,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:27,916 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:58:27,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:58:27,917 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:58:27,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:27,918 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:58:27,918 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:58:27,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:58:27,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:58:27,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:58:27,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:58:27,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:58:27,921 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:58:27,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:27,921 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:58:27,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:58:27,922 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:58:27,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:58:27,922 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:27,923 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:58:27,923 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:27,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:27,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718369, now seen corresponding path program 66 times [2019-08-05 10:58:27,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:27,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:58:27,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:30,586 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-05 10:58:30,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:30,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:58:30,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:58:30,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:58:30,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:58:30,588 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:58:30,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:30,706 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:58:30,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:58:30,707 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:58:30,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:30,707 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:58:30,708 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:58:30,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:58:30,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:58:30,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:58:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:58:30,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:58:30,710 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:58:30,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:30,710 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:58:30,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:58:30,710 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:58:30,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:58:30,711 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:30,711 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:58:30,711 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:30,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:30,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438201, now seen corresponding path program 67 times [2019-08-05 10:58:30,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:30,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:58:30,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:32,928 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-05 10:58:32,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:32,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:58:32,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:58:32,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:58:32,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:58:32,930 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:58:33,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:33,059 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:58:33,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:58:33,060 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:58:33,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:33,061 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:58:33,061 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:58:33,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:58:33,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:58:33,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:58:33,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:58:33,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:58:33,063 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:58:33,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:33,064 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:58:33,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:58:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:58:33,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:58:33,064 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:33,064 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:58:33,064 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:33,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:33,065 INFO L82 PathProgramCache]: Analyzing trace with hash 976119457, now seen corresponding path program 68 times [2019-08-05 10:58:33,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:33,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:58:33,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:35,810 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-05 10:58:35,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:35,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:58:35,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:58:35,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:58:35,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:58:35,811 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:58:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:35,952 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:58:35,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:58:35,952 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:58:35,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:35,953 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:58:35,953 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:58:35,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:58:35,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:58:35,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:58:35,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:58:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:58:35,956 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:58:35,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:35,956 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:58:35,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:58:35,957 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:58:35,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:58:35,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:35,957 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:58:35,957 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:35,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:35,958 INFO L82 PathProgramCache]: Analyzing trace with hash 194930119, now seen corresponding path program 69 times [2019-08-05 10:58:35,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:35,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:58:35,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:38,270 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-05 10:58:38,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:38,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:58:38,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:58:38,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:58:38,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:58:38,272 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:58:38,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:38,406 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:58:38,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:58:38,407 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:58:38,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:38,408 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:58:38,408 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:58:38,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:58:38,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:58:38,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:58:38,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:58:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:58:38,411 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:58:38,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:38,412 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:58:38,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:58:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:58:38,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:58:38,412 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:38,412 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:58:38,413 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:38,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:38,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864417, now seen corresponding path program 70 times [2019-08-05 10:58:38,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:38,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:58:38,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:41,041 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-05 10:58:41,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:41,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:58:41,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:58:41,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:58:41,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:58:41,043 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:58:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:41,183 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:58:41,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:58:41,183 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:58:41,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:41,184 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:58:41,184 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:58:41,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:58:41,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:58:41,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:58:41,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:58:41,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:58:41,187 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:58:41,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:41,187 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:58:41,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:58:41,188 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:58:41,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:58:41,188 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:41,188 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:58:41,188 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:41,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:41,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779897, now seen corresponding path program 71 times [2019-08-05 10:58:41,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:41,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:58:41,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:43,946 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-05 10:58:43,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:43,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:58:43,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:58:43,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:58:43,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:58:43,947 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:58:44,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:44,074 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:58:44,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:58:44,074 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:58:44,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:44,075 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:58:44,076 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:58:44,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:58:44,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:58:44,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:58:44,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:58:44,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:58:44,078 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:58:44,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:44,079 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:58:44,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:58:44,079 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:58:44,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:58:44,080 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:44,080 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:58:44,080 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:44,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:44,080 INFO L82 PathProgramCache]: Analyzing trace with hash 365428769, now seen corresponding path program 72 times [2019-08-05 10:58:44,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:44,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:58:44,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:46,840 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-05 10:58:46,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:46,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:58:46,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:58:46,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:58:46,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:58:46,842 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:58:46,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:46,988 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:58:46,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:58:46,989 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:58:46,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:46,990 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:58:46,990 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:58:46,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:58:46,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:58:46,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:58:46,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:58:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:58:46,993 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:58:46,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:46,993 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:58:46,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:58:46,994 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:58:46,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:58:46,994 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:46,994 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:58:46,994 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:46,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:46,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612025, now seen corresponding path program 73 times [2019-08-05 10:58:46,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:47,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:58:47,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:49,701 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-05 10:58:49,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:49,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:58:49,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:58:49,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:58:49,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:58:49,702 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:58:49,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:49,889 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:58:49,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:58:49,890 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:58:49,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:49,891 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:58:49,891 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:58:49,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:58:49,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:58:49,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:58:49,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:58:49,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:58:49,893 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:58:49,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:49,894 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:58:49,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:58:49,894 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:58:49,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:58:49,895 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:49,895 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:58:49,895 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:49,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:49,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334495, now seen corresponding path program 74 times [2019-08-05 10:58:49,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:49,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:58:49,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:52,503 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-05 10:58:52,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:52,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:58:52,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:58:52,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:58:52,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:58:52,505 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:58:52,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:52,645 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:58:52,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:58:52,646 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:58:52,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:52,646 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:58:52,647 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:58:52,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:58:52,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:58:52,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:58:52,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:58:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:58:52,649 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:58:52,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:52,650 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:58:52,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:58:52,650 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:58:52,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:58:52,651 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:52,651 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:58:52,651 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:52,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:52,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600249, now seen corresponding path program 75 times [2019-08-05 10:58:52,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:52,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:58:52,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:55,585 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-05 10:58:55,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:55,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:58:55,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:58:55,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:58:55,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:58:55,587 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:58:55,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:55,742 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:58:55,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:58:55,743 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:58:55,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:55,743 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:58:55,743 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:58:55,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:58:55,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:58:55,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:58:55,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:58:55,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:58:55,745 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:58:55,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:55,746 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:58:55,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:58:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:58:55,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:58:55,747 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:55,747 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:58:55,747 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:55,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:55,747 INFO L82 PathProgramCache]: Analyzing trace with hash -268904031, now seen corresponding path program 76 times [2019-08-05 10:58:55,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:55,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:58:55,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:58,380 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-05 10:58:58,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:58,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:58:58,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:58:58,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:58:58,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:58:58,382 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:58:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:58,513 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:58:58,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:58:58,513 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:58:58,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:58,514 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:58:58,514 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:58:58,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:58:58,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:58:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:58:58,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:58:58,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:58:58,519 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:58:58,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:58,519 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:58:58,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:58:58,519 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:58:58,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:58:58,519 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:58,519 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:58:58,520 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:58,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:58,520 INFO L82 PathProgramCache]: Analyzing trace with hash 253907655, now seen corresponding path program 77 times [2019-08-05 10:58:58,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:58,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:58:58,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:01,583 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-05 10:59:01,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:01,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:59:01,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:59:01,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:59:01,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:59:01,586 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:59:01,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:01,998 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:59:01,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:59:01,998 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:59:01,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:01,999 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:59:01,999 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:59:02,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:59:02,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:59:02,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:59:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:59:02,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:59:02,003 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:59:02,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:02,003 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:59:02,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:59:02,004 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:59:02,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:59:02,004 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:02,004 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:59:02,004 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:02,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:02,005 INFO L82 PathProgramCache]: Analyzing trace with hash -718799263, now seen corresponding path program 78 times [2019-08-05 10:59:02,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:02,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:59:02,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:05,671 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-05 10:59:05,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:05,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:59:05,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:59:05,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:59:05,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:59:05,674 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:59:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:05,882 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:59:05,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:59:05,882 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:59:05,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:05,883 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:59:05,883 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:59:05,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:59:05,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:59:05,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:59:05,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:59:05,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:59:05,889 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:59:05,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:05,889 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:59:05,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:59:05,889 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:59:05,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:59:05,890 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:05,890 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:59:05,890 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:05,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:05,890 INFO L82 PathProgramCache]: Analyzing trace with hash -807942649, now seen corresponding path program 79 times [2019-08-05 10:59:05,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:05,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:59:05,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:08,875 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-05 10:59:08,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:08,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:59:08,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:59:08,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:59:08,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:59:08,876 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:59:09,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:09,054 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:59:09,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:59:09,054 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:59:09,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:09,055 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:59:09,055 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:59:09,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:59:09,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:59:09,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:59:09,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:59:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:59:09,059 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:59:09,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:09,059 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:59:09,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:59:09,059 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:59:09,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:59:09,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:09,060 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:59:09,060 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:09,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:09,060 INFO L82 PathProgramCache]: Analyzing trace with hash 723579681, now seen corresponding path program 80 times [2019-08-05 10:59:09,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:09,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:59:09,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:12,235 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-05 10:59:12,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:12,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:59:12,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:59:12,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:59:12,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:59:12,236 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:59:12,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:12,425 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:59:12,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:59:12,426 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:59:12,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:12,427 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:59:12,427 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:59:12,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:59:12,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:59:12,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:59:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:59:12,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:59:12,430 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:59:12,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:12,430 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:59:12,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:59:12,430 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:59:12,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:59:12,430 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:12,431 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:59:12,431 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:12,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:12,431 INFO L82 PathProgramCache]: Analyzing trace with hash 956131655, now seen corresponding path program 81 times [2019-08-05 10:59:12,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:12,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:59:12,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:15,814 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-05 10:59:15,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:15,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:59:15,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:59:15,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:59:15,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:59:15,815 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 10:59:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:15,967 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:59:15,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:59:15,967 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:59:15,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:15,968 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:59:15,968 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:59:15,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:59:15,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:59:15,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:59:15,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:59:15,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:59:15,971 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:59:15,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:15,972 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:59:15,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:59:15,972 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:59:15,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:59:15,972 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:15,973 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 10:59:15,973 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:15,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:15,973 INFO L82 PathProgramCache]: Analyzing trace with hash -424691743, now seen corresponding path program 82 times [2019-08-05 10:59:15,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:16,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:59:16,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:19,534 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-05 10:59:19,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:19,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:59:19,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:59:19,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:59:19,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:59:19,535 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-08-05 10:59:19,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:19,843 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:59:19,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:59:19,844 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-05 10:59:19,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:19,845 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:59:19,845 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:59:19,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:59:19,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:59:19,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:59:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:59:19,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:59:19,848 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 10:59:19,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:19,848 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:59:19,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:59:19,848 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:59:19,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:59:19,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:19,849 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-05 10:59:19,849 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:19,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:19,849 INFO L82 PathProgramCache]: Analyzing trace with hash -280544121, now seen corresponding path program 83 times [2019-08-05 10:59:19,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:19,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:59:19,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:23,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:23,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:59:23,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:59:23,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:59:23,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:59:23,310 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-08-05 10:59:23,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:23,688 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:59:23,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:59:23,688 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-05 10:59:23,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:23,689 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:59:23,689 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:59:23,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:59:23,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:59:23,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:59:23,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:59:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:59:23,693 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-05 10:59:23,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:23,693 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:59:23,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:59:23,693 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:59:23,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:59:23,694 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:23,694 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-05 10:59:23,694 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:23,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:23,694 INFO L82 PathProgramCache]: Analyzing trace with hash -106935135, now seen corresponding path program 84 times [2019-08-05 10:59:23,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:23,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:59:23,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:27,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:27,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:27,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:59:27,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:59:27,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:59:27,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:59:27,216 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-08-05 10:59:27,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:27,380 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:59:27,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:59:27,380 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-05 10:59:27,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:27,380 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:59:27,381 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:59:27,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:59:27,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:59:27,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:59:27,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:59:27,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:59:27,383 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-05 10:59:27,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:27,383 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:59:27,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:59:27,383 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:59:27,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:59:27,384 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:27,384 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-05 10:59:27,384 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:27,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:27,385 INFO L82 PathProgramCache]: Analyzing trace with hash 979976135, now seen corresponding path program 85 times [2019-08-05 10:59:27,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:27,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:59:27,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:30,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:30,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:30,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:59:30,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:59:30,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:59:30,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:59:30,987 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-08-05 10:59:31,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:31,152 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:59:31,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:59:31,153 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-05 10:59:31,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:31,154 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:59:31,154 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:59:31,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:59:31,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:59:31,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:59:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:59:31,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:59:31,157 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-05 10:59:31,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:31,158 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:59:31,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:59:31,158 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:59:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:59:31,158 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:31,159 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-05 10:59:31,159 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:31,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:31,159 INFO L82 PathProgramCache]: Analyzing trace with hash 314487137, now seen corresponding path program 86 times [2019-08-05 10:59:31,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:31,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:59:31,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:34,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:34,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:34,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:59:34,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:59:34,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:59:34,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:59:34,740 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-08-05 10:59:35,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:35,024 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 10:59:35,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:59:35,025 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-08-05 10:59:35,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:35,026 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:59:35,026 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:59:35,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:59:35,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:59:35,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:59:35,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:59:35,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:59:35,029 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-05 10:59:35,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:35,029 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:59:35,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:59:35,029 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:59:35,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:59:35,030 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:35,030 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-08-05 10:59:35,030 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:35,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:35,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164679, now seen corresponding path program 87 times [2019-08-05 10:59:35,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:35,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:59:35,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:38,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:38,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:38,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:59:38,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:59:38,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:59:38,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:59:38,752 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-08-05 10:59:38,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:38,898 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:59:38,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:59:38,899 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-08-05 10:59:38,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:38,899 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:59:38,900 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:59:38,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:59:38,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:59:38,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:59:38,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:59:38,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:59:38,902 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-05 10:59:38,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:38,903 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:59:38,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:59:38,903 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:59:38,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:59:38,904 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:38,904 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-05 10:59:38,904 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:38,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:38,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364705, now seen corresponding path program 88 times [2019-08-05 10:59:38,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:38,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:59:38,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:42,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:42,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:42,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:59:42,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:59:42,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:59:42,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:59:42,716 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-08-05 10:59:42,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:42,868 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 10:59:42,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:59:42,869 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-05 10:59:42,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:42,870 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:59:42,870 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:59:42,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:59:42,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:59:42,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:59:42,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:59:42,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:59:42,872 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-05 10:59:42,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:42,873 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:59:42,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:59:42,873 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:59:42,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:59:42,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:42,874 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-08-05 10:59:42,874 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:42,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:42,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663623, now seen corresponding path program 89 times [2019-08-05 10:59:42,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:42,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:59:42,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:46,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:46,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:46,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:59:46,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:59:46,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:59:46,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:59:46,697 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-08-05 10:59:46,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:46,939 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:59:46,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:59:46,940 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-05 10:59:46,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:46,941 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:59:46,941 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:59:46,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:59:46,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:59:46,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:59:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:59:46,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 10:59:46,944 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-05 10:59:46,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:46,944 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 10:59:46,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:59:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 10:59:46,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:59:46,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:46,945 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-08-05 10:59:46,945 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:46,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:46,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930081, now seen corresponding path program 90 times [2019-08-05 10:59:46,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:46,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:59:46,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:50,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:50,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:50,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:59:50,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:59:50,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:59:50,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:59:50,604 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-08-05 10:59:50,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:50,768 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 10:59:50,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:59:50,768 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-08-05 10:59:50,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:50,769 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:59:50,769 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:59:50,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:59:50,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:59:50,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:59:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:59:50,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:59:50,773 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-05 10:59:50,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:50,773 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:59:50,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:59:50,774 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:59:50,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:59:50,774 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:50,774 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-08-05 10:59:50,774 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:50,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:50,775 INFO L82 PathProgramCache]: Analyzing trace with hash 854092167, now seen corresponding path program 91 times [2019-08-05 10:59:50,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:50,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:59:50,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:54,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:54,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:59:54,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:59:54,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:59:54,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:59:54,745 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-08-05 10:59:54,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:54,907 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:59:54,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:59:54,907 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-08-05 10:59:54,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:54,908 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:59:54,908 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:59:54,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:59:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:59:54,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 10:59:54,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:59:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 10:59:54,911 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-05 10:59:54,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:54,912 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 10:59:54,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:59:54,912 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 10:59:54,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:59:54,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:54,912 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-08-05 10:59:54,913 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:54,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:54,913 INFO L82 PathProgramCache]: Analyzing trace with hash 707051425, now seen corresponding path program 92 times [2019-08-05 10:59:54,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:54,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:59:54,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:59,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:59,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:59,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:59:59,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:59:59,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:59:59,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:59:59,078 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-08-05 10:59:59,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:59,261 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 10:59:59,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:59:59,261 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-08-05 10:59:59,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:59,262 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:59:59,262 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:59:59,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:59:59,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:59:59,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:59:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:59:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:59:59,265 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-08-05 10:59:59,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:59,265 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:59:59,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:59:59,265 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:59:59,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:59:59,266 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:59,266 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-08-05 10:59:59,266 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:59,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:59,266 INFO L82 PathProgramCache]: Analyzing trace with hash 443755719, now seen corresponding path program 93 times [2019-08-05 10:59:59,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:59,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:59:59,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:04,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:04,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 11:00:04,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 11:00:04,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 11:00:04,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:00:04,134 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-08-05 11:00:04,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:04,300 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 11:00:04,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 11:00:04,301 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-08-05 11:00:04,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:04,302 INFO L225 Difference]: With dead ends: 98 [2019-08-05 11:00:04,302 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 11:00:04,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:00:04,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 11:00:04,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 11:00:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 11:00:04,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 11:00:04,305 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-08-05 11:00:04,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:04,305 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 11:00:04,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 11:00:04,305 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 11:00:04,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 11:00:04,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:04,306 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-08-05 11:00:04,306 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:04,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:04,307 INFO L82 PathProgramCache]: Analyzing trace with hash 871523425, now seen corresponding path program 94 times [2019-08-05 11:00:04,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:04,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:00:04,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:04,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:00:04,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:04,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:04,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:04,512 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 11:00:04,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-08-05 11:00:04,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:00:04,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:00:04,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:00:04,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:00:04,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:00:04,595 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 3 states. [2019-08-05 11:00:04,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:04,596 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 11:00:04,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:00:04,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-08-05 11:00:04,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:04,597 INFO L225 Difference]: With dead ends: 96 [2019-08-05 11:00:04,597 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:00:04,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:00:04,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:00:04,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:00:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:00:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:00:04,598 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2019-08-05 11:00:04,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:04,598 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:00:04,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:00:04,599 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:00:04,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:00:04,605 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:00:04 BoogieIcfgContainer [2019-08-05 11:00:04,605 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:00:04,607 INFO L168 Benchmark]: Toolchain (without parser) took 171305.70 ms. Allocated memory was 141.6 MB in the beginning and 444.1 MB in the end (delta: 302.5 MB). Free memory was 110.7 MB in the beginning and 214.9 MB in the end (delta: -104.2 MB). Peak memory consumption was 198.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:00:04,608 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 141.6 MB. Free memory is still 112.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:00:04,609 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.62 ms. Allocated memory is still 141.6 MB. Free memory was 110.7 MB in the beginning and 109.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:00:04,609 INFO L168 Benchmark]: Boogie Preprocessor took 30.52 ms. Allocated memory is still 141.6 MB. Free memory was 109.1 MB in the beginning and 107.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:00:04,610 INFO L168 Benchmark]: RCFGBuilder took 359.30 ms. Allocated memory is still 141.6 MB. Free memory was 107.8 MB in the beginning and 95.2 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:00:04,611 INFO L168 Benchmark]: TraceAbstraction took 170869.91 ms. Allocated memory was 141.6 MB in the beginning and 444.1 MB in the end (delta: 302.5 MB). Free memory was 94.8 MB in the beginning and 214.9 MB in the end (delta: -120.1 MB). Peak memory consumption was 182.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:00:04,616 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.23 ms. Allocated memory is still 141.6 MB. Free memory is still 112.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.62 ms. Allocated memory is still 141.6 MB. Free memory was 110.7 MB in the beginning and 109.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.52 ms. Allocated memory is still 141.6 MB. Free memory was 109.1 MB in the beginning and 107.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 359.30 ms. Allocated memory is still 141.6 MB. Free memory was 107.8 MB in the beginning and 95.2 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 170869.91 ms. Allocated memory was 141.6 MB in the beginning and 444.1 MB in the end (delta: 302.5 MB). Free memory was 94.8 MB in the beginning and 214.9 MB in the end (delta: -120.1 MB). Peak memory consumption was 182.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 110]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. SAFE Result, 170.8s OverallTime, 95 OverallIterations, 94 TraceHistogramMax, 11.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 284 SDtfs, 0 SDslu, 1189 SDs, 0 SdLazy, 5748 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4655 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 4466 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 154.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=94, 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, 95 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 157.0s InterpolantComputationTime, 4750 NumberOfCodeBlocks, 4750 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 4655 ConstructedInterpolants, 0 QuantifiedInterpolants, 2087055 SizeOfPredicates, 200 NumberOfNonLiveVariables, 24225 ConjunctsInSsa, 4669 ConjunctsInUnsatCore, 95 InterpolantComputations, 2 PerfectInterpolantSequences, 4465/142880 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...