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/loopAcceleration/loopWithNondeterministicBranch.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:20:50,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:20:50,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:20:50,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:20:50,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:20:50,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:20:50,221 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:20:50,222 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:20:50,224 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:20:50,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:20:50,226 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:20:50,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:20:50,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:20:50,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:20:50,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:20:50,230 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:20:50,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:20:50,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:20:50,233 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:20:50,235 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:20:50,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:20:50,238 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:20:50,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:20:50,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:20:50,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:20:50,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:20:50,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:20:50,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:20:50,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:20:50,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:20:50,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:20:50,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:20:50,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:20:50,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:20:50,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:20:50,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:20:50,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:20:50,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:20:50,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:20:50,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:20:50,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:20:50,287 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:20:50,300 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:20:50,303 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:20:50,305 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:20:50,305 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:20:50,306 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopWithNondeterministicBranch.bpl [2019-08-05 11:20:50,306 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopWithNondeterministicBranch.bpl' [2019-08-05 11:20:50,339 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:20:50,340 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:20:50,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:20:50,343 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:20:50,343 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:20:50,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "loopWithNondeterministicBranch.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:20:50" (1/1) ... [2019-08-05 11:20:50,370 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "loopWithNondeterministicBranch.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:20:50" (1/1) ... [2019-08-05 11:20:50,376 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:20:50,378 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:20:50,378 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:20:50,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:20:50,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:20:50,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:20:50,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:20:50,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "loopWithNondeterministicBranch.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:20:50" (1/1) ... [2019-08-05 11:20:50,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "loopWithNondeterministicBranch.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:20:50" (1/1) ... [2019-08-05 11:20:50,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "loopWithNondeterministicBranch.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:20:50" (1/1) ... [2019-08-05 11:20:50,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "loopWithNondeterministicBranch.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:20:50" (1/1) ... [2019-08-05 11:20:50,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "loopWithNondeterministicBranch.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:20:50" (1/1) ... [2019-08-05 11:20:50,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "loopWithNondeterministicBranch.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:20:50" (1/1) ... [2019-08-05 11:20:50,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "loopWithNondeterministicBranch.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:20:50" (1/1) ... [2019-08-05 11:20:50,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:20:50,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:20:50,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:20:50,409 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:20:50,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "loopWithNondeterministicBranch.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:20:50" (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 11:20:50,484 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:20:50,485 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:20:50,485 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:20:50,766 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:20:50,767 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:20:50,768 INFO L202 PluginConnector]: Adding new model loopWithNondeterministicBranch.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:20:50 BoogieIcfgContainer [2019-08-05 11:20:50,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:20:50,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:20:50,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:20:50,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:20:50,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loopWithNondeterministicBranch.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:20:50" (1/2) ... [2019-08-05 11:20:50,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4218b8b9 and model type loopWithNondeterministicBranch.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:20:50, skipping insertion in model container [2019-08-05 11:20:50,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "loopWithNondeterministicBranch.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:20:50" (2/2) ... [2019-08-05 11:20:50,777 INFO L109 eAbstractionObserver]: Analyzing ICFG loopWithNondeterministicBranch.bpl [2019-08-05 11:20:50,786 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:20:50,794 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 11:20:50,810 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 11:20:50,836 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:20:50,837 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:20:50,837 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:20:50,837 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:20:50,838 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:20:50,838 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:20:50,838 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:20:50,838 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:20:50,838 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:20:50,852 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 11:20:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:20:50,860 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:50,861 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:20:50,864 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:50,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:50,870 INFO L82 PathProgramCache]: Analyzing trace with hash 30208, now seen corresponding path program 1 times [2019-08-05 11:20:50,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:50,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:20:50,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:51,013 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 11:20:51,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:20:51,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:20:51,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:20:51,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:20:51,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:20:51,036 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-08-05 11:20:51,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:51,115 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:20:51,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:20:51,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:20:51,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:51,132 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:20:51,133 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:20:51,135 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 11:20:51,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:20:51,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:20:51,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:20:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:20:51,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 3 [2019-08-05 11:20:51,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:51,175 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:20:51,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:20:51,175 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:20:51,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:20:51,176 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:51,176 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:20:51,177 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:51,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:51,177 INFO L82 PathProgramCache]: Analyzing trace with hash 945080, now seen corresponding path program 1 times [2019-08-05 11:20:51,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:51,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:20:51,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:51,293 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 11:20:51,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:51,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:20:51,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:20:51,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:20:51,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:20:51,296 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2019-08-05 11:20:51,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:51,370 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:20:51,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:20:51,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 11:20:51,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:51,371 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:20:51,372 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:20:51,373 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 11:20:51,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:20:51,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:20:51,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:20:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:20:51,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2019-08-05 11:20:51,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:51,376 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:20:51,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:20:51,376 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:20:51,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:20:51,376 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:51,377 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:20:51,377 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:51,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:51,378 INFO L82 PathProgramCache]: Analyzing trace with hash 29306112, now seen corresponding path program 2 times [2019-08-05 11:20:51,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:51,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:20:51,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:51,481 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 11:20:51,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:51,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:20:51,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:20:51,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:20:51,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:20:51,484 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2019-08-05 11:20:51,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:51,548 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:20:51,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:20:51,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 11:20:51,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:51,550 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:20:51,550 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:20:51,551 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 11:20:51,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:20:51,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:20:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:20:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:20:51,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2019-08-05 11:20:51,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:51,554 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:20:51,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:20:51,554 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:20:51,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:20:51,555 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:51,555 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 11:20:51,556 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:51,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:51,556 INFO L82 PathProgramCache]: Analyzing trace with hash 908498104, now seen corresponding path program 3 times [2019-08-05 11:20:51,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:51,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:20:51,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:51,642 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 11:20:51,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:51,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:20:51,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:20:51,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:20:51,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:20:51,645 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2019-08-05 11:20:51,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:51,778 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:20:51,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:20:51,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 11:20:51,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:51,780 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:20:51,780 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:20:51,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:20:51,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:20:51,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:20:51,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:20:51,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:20:51,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2019-08-05 11:20:51,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:51,785 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:20:51,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:20:51,785 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:20:51,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:20:51,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:51,787 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 11:20:51,788 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:51,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:51,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1901321216, now seen corresponding path program 4 times [2019-08-05 11:20:51,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:51,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:20:51,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:51,947 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 11:20:51,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:51,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:20:51,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:20:51,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:20:51,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:20:51,950 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2019-08-05 11:20:52,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:52,013 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:20:52,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:20:52,014 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 11:20:52,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:52,015 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:20:52,015 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:20:52,016 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 11:20:52,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:20:52,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:20:52,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:20:52,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 11:20:52,018 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2019-08-05 11:20:52,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:52,018 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 11:20:52,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:20:52,019 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 11:20:52,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:20:52,019 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:52,019 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 11:20:52,019 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:52,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:52,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1188593080, now seen corresponding path program 5 times [2019-08-05 11:20:52,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:52,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:20:52,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:52,192 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 11:20:52,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:52,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:20:52,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:20:52,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:20:52,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:20:52,194 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-08-05 11:20:52,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:52,237 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:20:52,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:20:52,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 11:20:52,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:52,238 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:20:52,238 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:20:52,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:20:52,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:20:52,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:20:52,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:20:52,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:20:52,242 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2019-08-05 11:20:52,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:52,242 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:20:52,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:20:52,242 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:20:52,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:20:52,243 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:52,243 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 11:20:52,243 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:52,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:52,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1808311552, now seen corresponding path program 6 times [2019-08-05 11:20:52,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:52,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:20:52,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:52,457 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 11:20:52,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:52,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:20:52,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:20:52,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:20:52,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:20:52,459 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2019-08-05 11:20:52,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:52,521 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:20:52,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:20:52,522 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 11:20:52,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:52,522 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:20:52,523 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:20:52,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:20:52,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:20:52,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:20:52,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:20:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:20:52,526 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2019-08-05 11:20:52,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:52,526 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:20:52,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:20:52,527 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:20:52,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:20:52,527 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:52,527 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 11:20:52,528 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:52,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:52,528 INFO L82 PathProgramCache]: Analyzing trace with hash -223074632, now seen corresponding path program 7 times [2019-08-05 11:20:52,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:52,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:20:52,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:52,677 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 11:20:52,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:52,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:20:52,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:20:52,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:20:52,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:20:52,680 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2019-08-05 11:20:53,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:53,001 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 11:20:53,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:20:53,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 11:20:53,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:53,002 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:20:53,002 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:20:53,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:20:53,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:20:53,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:20:53,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:20:53,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:20:53,005 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2019-08-05 11:20:53,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:53,005 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:20:53,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:20:53,005 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:20:53,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:20:53,006 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:53,006 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 11:20:53,006 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:53,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:53,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1674629632, now seen corresponding path program 8 times [2019-08-05 11:20:53,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:53,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:20:53,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:53,143 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 11:20:53,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:53,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:20:53,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:20:53,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:20:53,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:20:53,145 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 11 states. [2019-08-05 11:20:53,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:53,205 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:20:53,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:20:53,206 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 11:20:53,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:53,206 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:20:53,206 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:20:53,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:20:53,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:20:53,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:20:53,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:20:53,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 11:20:53,209 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2019-08-05 11:20:53,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:53,210 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 11:20:53,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:20:53,210 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 11:20:53,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:20:53,210 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:53,211 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 11:20:53,211 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:53,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:53,211 INFO L82 PathProgramCache]: Analyzing trace with hash 373919672, now seen corresponding path program 9 times [2019-08-05 11:20:53,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:53,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:20:53,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:53,382 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 11:20:53,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:53,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:20:53,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:20:53,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:20:53,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:20:53,384 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 12 states. [2019-08-05 11:20:53,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:53,442 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 11:20:53,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:20:53,443 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 11:20:53,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:53,444 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:20:53,444 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:20:53,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:20:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:20:53,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:20:53,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:20:53,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:20:53,449 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2019-08-05 11:20:53,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:53,450 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:20:53,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:20:53,450 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:20:53,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:20:53,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:53,450 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 11:20:53,451 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:53,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:53,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1293383424, now seen corresponding path program 10 times [2019-08-05 11:20:53,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:53,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:20:53,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:53,688 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 11:20:53,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:53,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:20:53,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:20:53,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:20:53,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:20:53,690 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 13 states. [2019-08-05 11:20:53,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:53,770 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:20:53,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:20:53,770 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 11:20:53,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:53,771 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:20:53,771 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:20:53,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:20:53,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:20:53,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:20:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:20:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 11:20:53,774 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2019-08-05 11:20:53,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:53,774 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 11:20:53,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:20:53,775 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 11:20:53,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:20:53,775 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:53,775 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 11:20:53,776 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:53,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:53,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1440171848, now seen corresponding path program 11 times [2019-08-05 11:20:53,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:53,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:20:53,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:53,998 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 11:20:53,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:53,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:20:53,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:20:53,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:20:53,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:20:53,999 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 14 states. [2019-08-05 11:20:54,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:54,024 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 11:20:54,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:20:54,025 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 11:20:54,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:54,026 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:20:54,026 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:20:54,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:20:54,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:20:54,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:20:54,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:20:54,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 11:20:54,030 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2019-08-05 11:20:54,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:54,031 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 11:20:54,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:20:54,031 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 11:20:54,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:20:54,031 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:54,032 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 11:20:54,032 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:54,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:54,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1695645696, now seen corresponding path program 12 times [2019-08-05 11:20:54,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:54,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:20:54,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:54,271 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 11:20:54,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:54,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:20:54,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:20:54,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:20:54,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:20:54,273 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 15 states. [2019-08-05 11:20:54,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:54,310 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:20:54,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:20:54,310 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 11:20:54,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:54,311 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:20:54,311 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:20:54,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:20:54,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:20:54,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:20:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:20:54,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 11:20:54,315 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2019-08-05 11:20:54,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:54,315 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 11:20:54,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:20:54,315 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 11:20:54,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:20:54,316 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:54,316 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 11:20:54,316 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:54,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:54,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1025400392, now seen corresponding path program 13 times [2019-08-05 11:20:54,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:54,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:20:54,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:54,576 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 11:20:54,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:54,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:20:54,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:20:54,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:20:54,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:20:54,578 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 16 states. [2019-08-05 11:20:54,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:54,602 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 11:20:54,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:20:54,603 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 11:20:54,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:54,604 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:20:54,604 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:20:54,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:20:54,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:20:54,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:20:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:20:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 11:20:54,608 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2019-08-05 11:20:54,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:54,609 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 11:20:54,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:20:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 11:20:54,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:20:54,609 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:54,609 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 11:20:54,610 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:54,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:54,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1722632448, now seen corresponding path program 14 times [2019-08-05 11:20:54,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:54,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:20:54,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:54,924 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 11:20:54,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:54,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:20:54,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:20:54,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:20:54,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:20:54,926 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 17 states. [2019-08-05 11:20:55,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:55,213 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:20:55,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:20:55,214 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 11:20:55,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:55,215 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:20:55,215 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:20:55,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:20:55,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:20:55,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:20:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:20:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 11:20:55,219 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 17 [2019-08-05 11:20:55,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:55,219 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 11:20:55,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:20:55,219 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 11:20:55,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:20:55,220 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:55,220 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 11:20:55,220 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:55,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:55,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1861989704, now seen corresponding path program 15 times [2019-08-05 11:20:55,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:55,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:20:55,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:55,409 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 11:20:55,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:55,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:20:55,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:20:55,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:20:55,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:20:55,411 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 18 states. [2019-08-05 11:20:55,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:55,457 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 11:20:55,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:20:55,458 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 11:20:55,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:55,459 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:20:55,459 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:20:55,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:20:55,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:20:55,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:20:55,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:20:55,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 11:20:55,463 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2019-08-05 11:20:55,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:55,463 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 11:20:55,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:20:55,464 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 11:20:55,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:20:55,464 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:55,464 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 11:20:55,465 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:55,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:55,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1887097344, now seen corresponding path program 16 times [2019-08-05 11:20:55,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:55,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:20:55,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:55,677 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 11:20:55,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:55,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:20:55,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:20:55,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:20:55,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:20:55,679 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 19 states. [2019-08-05 11:20:55,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:55,743 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 11:20:55,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:20:55,746 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 11:20:55,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:55,746 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:20:55,746 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:20:55,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:20:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:20:55,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 11:20:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:20:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 11:20:55,749 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2019-08-05 11:20:55,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:55,750 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 11:20:55,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:20:55,750 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 11:20:55,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:20:55,750 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:55,750 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 11:20:55,751 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:55,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:55,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1629533112, now seen corresponding path program 17 times [2019-08-05 11:20:55,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:55,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:20:55,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:56,273 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 11:20:56,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:56,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:20:56,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:20:56,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:20:56,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:20:56,275 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 20 states. [2019-08-05 11:20:56,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:56,329 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 11:20:56,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:20:56,330 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 11:20:56,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:56,331 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:20:56,331 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:20:56,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:20:56,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:20:56,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 11:20:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:20:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 11:20:56,334 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 20 [2019-08-05 11:20:56,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:56,334 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 11:20:56,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:20:56,335 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 11:20:56,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:20:56,335 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:56,335 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 11:20:56,336 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:56,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:56,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1024072448, now seen corresponding path program 18 times [2019-08-05 11:20:56,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:56,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:20:56,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:56,894 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 11:20:56,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:56,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:20:56,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:20:56,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:20:56,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:20:56,896 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 21 states. [2019-08-05 11:20:56,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:56,931 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 11:20:56,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:20:56,932 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 11:20:56,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:56,933 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:20:56,933 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:20:56,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:20:56,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:20:56,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 11:20:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:20:56,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 11:20:56,936 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2019-08-05 11:20:56,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:56,937 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 11:20:56,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:20:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 11:20:56,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:20:56,938 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:56,938 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 11:20:56,938 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:56,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:56,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1681466184, now seen corresponding path program 19 times [2019-08-05 11:20:56,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:56,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:20:56,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:57,248 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 11:20:57,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:57,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:20:57,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:20:57,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:20:57,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:20:57,250 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 22 states. [2019-08-05 11:20:57,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:57,292 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 11:20:57,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:20:57,293 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 11:20:57,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:57,293 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:20:57,294 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:20:57,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:20:57,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:20:57,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 11:20:57,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:20:57,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 11:20:57,297 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 22 [2019-08-05 11:20:57,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:57,297 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 11:20:57,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:20:57,298 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 11:20:57,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:20:57,298 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:57,298 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 11:20:57,299 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:57,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:57,299 INFO L82 PathProgramCache]: Analyzing trace with hash -585835520, now seen corresponding path program 20 times [2019-08-05 11:20:57,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:57,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:20:57,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:57,615 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 11:20:57,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:57,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:20:57,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:20:57,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:20:57,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:20:57,617 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 23 states. [2019-08-05 11:20:57,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:57,665 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 11:20:57,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:20:57,666 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 11:20:57,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:57,667 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:20:57,667 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:20:57,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:20:57,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:20:57,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 11:20:57,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:20:57,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 11:20:57,671 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2019-08-05 11:20:57,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:57,671 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 11:20:57,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:20:57,672 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 11:20:57,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:20:57,672 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:57,672 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 11:20:57,673 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:57,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:57,673 INFO L82 PathProgramCache]: Analyzing trace with hash -981023304, now seen corresponding path program 21 times [2019-08-05 11:20:57,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:57,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:20:57,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:58,204 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 11:20:58,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:58,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:20:58,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:20:58,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:20:58,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:20:58,205 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 24 states. [2019-08-05 11:20:58,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:58,281 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 11:20:58,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:20:58,283 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 11:20:58,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:58,283 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:20:58,283 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:20:58,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:20:58,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:20:58,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 11:20:58,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:20:58,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 11:20:58,287 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2019-08-05 11:20:58,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:58,288 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 11:20:58,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:20:58,288 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 11:20:58,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:20:58,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:58,289 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 11:20:58,289 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:58,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:58,289 INFO L82 PathProgramCache]: Analyzing trace with hash -346942720, now seen corresponding path program 22 times [2019-08-05 11:20:58,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:58,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:20:58,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:58,676 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 11:20:58,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:58,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:20:58,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:20:58,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:20:58,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:20:58,678 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 25 states. [2019-08-05 11:20:58,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:58,741 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 11:20:58,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:20:58,741 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 11:20:58,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:58,741 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:20:58,741 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:20:58,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:20:58,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:20:58,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 11:20:58,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:20:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 11:20:58,745 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 25 [2019-08-05 11:20:58,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:58,745 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 11:20:58,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:20:58,745 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 11:20:58,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:20:58,746 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:58,746 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 11:20:58,746 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:58,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:58,746 INFO L82 PathProgramCache]: Analyzing trace with hash 2129686200, now seen corresponding path program 23 times [2019-08-05 11:20:58,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:58,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:20:58,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:20:59,358 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 11:20:59,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:20:59,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:20:59,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:20:59,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:20:59,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:20:59,360 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 26 states. [2019-08-05 11:20:59,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:20:59,431 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 11:20:59,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:20:59,434 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 11:20:59,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:20:59,434 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:20:59,435 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:20:59,436 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 11:20:59,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:20:59,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 11:20:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:20:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 11:20:59,438 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2019-08-05 11:20:59,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:20:59,438 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 11:20:59,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:20:59,438 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 11:20:59,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:20:59,439 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:20:59,439 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 11:20:59,439 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:20:59,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:20:59,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1595771392, now seen corresponding path program 24 times [2019-08-05 11:20:59,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:20:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:20:59,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:20:59,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:00,069 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 11:21:00,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:00,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:21:00,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:21:00,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:21:00,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:21:00,071 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 27 states. [2019-08-05 11:21:00,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:00,116 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 11:21:00,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:21:00,117 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 11:21:00,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:00,117 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:21:00,117 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 11:21:00,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:21:00,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 11:21:00,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 11:21:00,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:21:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 11:21:00,121 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2019-08-05 11:21:00,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:00,122 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 11:21:00,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:21:00,122 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 11:21:00,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:21:00,122 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:00,123 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 11:21:00,123 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:00,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:00,123 INFO L82 PathProgramCache]: Analyzing trace with hash -2070685768, now seen corresponding path program 25 times [2019-08-05 11:21:00,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:00,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:21:00,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:01,556 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 11:21:01,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:01,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:21:01,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:21:01,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:21:01,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:21:01,558 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 28 states. [2019-08-05 11:21:01,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:01,863 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 11:21:01,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:21:01,864 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 11:21:01,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:01,864 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:21:01,864 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:21:01,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:21:01,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:21:01,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 11:21:01,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:21:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 11:21:01,867 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 28 [2019-08-05 11:21:01,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:01,867 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 11:21:01,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:21:01,868 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 11:21:01,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:21:01,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:01,868 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 11:21:01,869 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:01,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:01,869 INFO L82 PathProgramCache]: Analyzing trace with hash 233259264, now seen corresponding path program 26 times [2019-08-05 11:21:01,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:01,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:21:01,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:02,714 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 11:21:02,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:02,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:21:02,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:21:02,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:21:02,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:21:02,717 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 29 states. [2019-08-05 11:21:02,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:02,783 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 11:21:02,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:21:02,784 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 11:21:02,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:02,784 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:21:02,785 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:21:02,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:21:02,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:21:02,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 11:21:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:21:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 11:21:02,789 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 29 [2019-08-05 11:21:02,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:02,790 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 11:21:02,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:21:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 11:21:02,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:21:02,790 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:02,791 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 11:21:02,791 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:02,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:02,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1358888776, now seen corresponding path program 27 times [2019-08-05 11:21:02,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:02,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:21:02,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:03,210 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 11:21:03,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:03,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:21:03,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:21:03,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:21:03,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:21:03,212 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 30 states. [2019-08-05 11:21:03,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:03,366 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 11:21:03,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:21:03,367 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 11:21:03,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:03,367 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:21:03,368 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:21:03,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:21:03,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:21:03,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 11:21:03,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:21:03,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 11:21:03,371 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2019-08-05 11:21:03,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:03,371 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 11:21:03,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:21:03,372 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 11:21:03,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:21:03,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:03,372 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 11:21:03,372 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:03,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:03,373 INFO L82 PathProgramCache]: Analyzing trace with hash 824129536, now seen corresponding path program 28 times [2019-08-05 11:21:03,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:03,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:21:03,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:03,765 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 11:21:03,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:03,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:21:03,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:21:03,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:21:03,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:21:03,766 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 31 states. [2019-08-05 11:21:03,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:03,854 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 11:21:03,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:21:03,855 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 11:21:03,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:03,855 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:21:03,855 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:21:03,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:21:03,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:21:03,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 11:21:03,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:21:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 11:21:03,860 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 31 [2019-08-05 11:21:03,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:03,860 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 11:21:03,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:21:03,860 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 11:21:03,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:21:03,861 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:03,861 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 11:21:03,861 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:03,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:03,862 INFO L82 PathProgramCache]: Analyzing trace with hash -221779528, now seen corresponding path program 29 times [2019-08-05 11:21:03,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:03,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:21:03,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:04,355 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 11:21:04,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:04,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:21:04,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:21:04,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:21:04,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:21:04,357 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 32 states. [2019-08-05 11:21:04,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:04,551 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 11:21:04,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:21:04,551 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 11:21:04,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:04,552 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:21:04,552 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:21:04,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:21:04,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:21:04,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 11:21:04,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:21:04,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 11:21:04,557 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 32 [2019-08-05 11:21:04,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:04,557 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 11:21:04,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:21:04,557 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 11:21:04,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:21:04,558 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:04,558 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 11:21:04,558 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:04,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:04,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1714777856, now seen corresponding path program 30 times [2019-08-05 11:21:04,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:04,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:21:04,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:04,985 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 11:21:04,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:04,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:21:04,985 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:21:04,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:21:04,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:21:04,986 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 33 states. [2019-08-05 11:21:05,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:05,050 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 11:21:05,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:21:05,050 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 11:21:05,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:05,051 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:21:05,051 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:21:05,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:21:05,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:21:05,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 11:21:05,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:21:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 11:21:05,055 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 33 [2019-08-05 11:21:05,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:05,055 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 11:21:05,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:21:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 11:21:05,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:21:05,056 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:05,056 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 11:21:05,056 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:05,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:05,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1618514616, now seen corresponding path program 31 times [2019-08-05 11:21:05,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:05,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:21:05,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:05,584 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 11:21:05,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:05,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:21:05,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:21:05,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:21:05,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:21:05,586 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 34 states. [2019-08-05 11:21:05,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:05,668 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 11:21:05,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:21:05,669 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 11:21:05,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:05,670 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:21:05,670 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:21:05,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:21:05,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:21:05,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 11:21:05,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:21:05,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 11:21:05,674 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 34 [2019-08-05 11:21:05,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:05,674 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 11:21:05,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:21:05,675 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 11:21:05,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:21:05,675 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:05,675 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 11:21:05,675 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:05,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:05,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1365645824, now seen corresponding path program 32 times [2019-08-05 11:21:05,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:05,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:21:05,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:06,138 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 11:21:06,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:06,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:21:06,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:21:06,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:21:06,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:21:06,140 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 35 states. [2019-08-05 11:21:06,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:06,195 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 11:21:06,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:21:06,196 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 11:21:06,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:06,196 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:21:06,197 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:21:06,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:21:06,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:21:06,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 11:21:06,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:21:06,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 11:21:06,200 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 35 [2019-08-05 11:21:06,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:06,201 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 11:21:06,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:21:06,201 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 11:21:06,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:21:06,201 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:06,201 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 11:21:06,202 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:06,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:06,202 INFO L82 PathProgramCache]: Analyzing trace with hash 614661048, now seen corresponding path program 33 times [2019-08-05 11:21:06,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:06,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:21:06,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:06,765 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 11:21:06,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:06,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:21:06,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:21:06,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:21:06,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:21:06,766 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 36 states. [2019-08-05 11:21:06,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:06,838 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 11:21:06,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:21:06,838 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 11:21:06,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:06,839 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:21:06,839 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:21:06,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:21:06,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:21:06,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 11:21:06,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:21:06,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 11:21:06,843 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 36 [2019-08-05 11:21:06,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:06,844 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 11:21:06,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:21:06,844 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 11:21:06,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:21:06,844 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:06,844 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 11:21:06,845 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:06,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:06,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1874631936, now seen corresponding path program 34 times [2019-08-05 11:21:06,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:06,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:21:06,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:08,017 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 11:21:08,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:08,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:21:08,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:21:08,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:21:08,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:21:08,018 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 37 states. [2019-08-05 11:21:08,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:08,075 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 11:21:08,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:21:08,076 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 11:21:08,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:08,077 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:21:08,077 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:21:08,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:21:08,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:21:08,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 11:21:08,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:21:08,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 11:21:08,080 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 37 [2019-08-05 11:21:08,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:08,080 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 11:21:08,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:21:08,081 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 11:21:08,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:21:08,081 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:08,082 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 11:21:08,082 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:08,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:08,082 INFO L82 PathProgramCache]: Analyzing trace with hash -2015943496, now seen corresponding path program 35 times [2019-08-05 11:21:08,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:08,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:21:08,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:08,656 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 11:21:08,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:08,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:21:08,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:21:08,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:21:08,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:21:08,658 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 38 states. [2019-08-05 11:21:08,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:08,799 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 11:21:08,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:21:08,800 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 11:21:08,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:08,801 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:21:08,801 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:21:08,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:21:08,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:21:08,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 11:21:08,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:21:08,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 11:21:08,804 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 38 [2019-08-05 11:21:08,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:08,805 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 11:21:08,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:21:08,805 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 11:21:08,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 11:21:08,805 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:08,805 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 11:21:08,805 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:08,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:08,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1930269696, now seen corresponding path program 36 times [2019-08-05 11:21:08,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:08,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:21:08,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:10,608 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 11:21:10,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:10,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:21:10,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:21:10,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:21:10,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:21:10,610 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 39 states. [2019-08-05 11:21:10,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:10,688 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 11:21:10,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:21:10,689 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 11:21:10,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:10,689 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:21:10,689 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:21:10,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:21:10,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:21:10,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 11:21:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:21:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 11:21:10,692 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 39 [2019-08-05 11:21:10,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:10,693 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 11:21:10,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:21:10,693 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 11:21:10,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:21:10,693 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:10,693 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 11:21:10,694 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:10,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:10,694 INFO L82 PathProgramCache]: Analyzing trace with hash -291172936, now seen corresponding path program 37 times [2019-08-05 11:21:10,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:10,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:21:10,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:11,488 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 11:21:11,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:11,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:21:11,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:21:11,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:21:11,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:21:11,489 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 40 states. [2019-08-05 11:21:11,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:11,552 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 11:21:11,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:21:11,552 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 11:21:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:11,553 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:21:11,553 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:21:11,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:21:11,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:21:11,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 11:21:11,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:21:11,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 11:21:11,556 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 40 [2019-08-05 11:21:11,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:11,557 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 11:21:11,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:21:11,557 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 11:21:11,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:21:11,557 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:11,557 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 11:21:11,557 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:11,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:11,558 INFO L82 PathProgramCache]: Analyzing trace with hash -436417792, now seen corresponding path program 38 times [2019-08-05 11:21:11,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:11,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:21:11,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:12,473 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 11:21:12,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:12,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:21:12,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:21:12,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:21:12,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:21:12,474 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 41 states. [2019-08-05 11:21:12,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:12,533 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 11:21:12,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:21:12,534 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 11:21:12,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:12,535 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:21:12,535 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:21:12,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:21:12,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:21:12,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 11:21:12,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:21:12,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 11:21:12,538 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 41 [2019-08-05 11:21:12,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:12,538 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 11:21:12,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:21:12,538 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 11:21:12,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:21:12,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:12,538 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 11:21:12,539 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:12,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:12,539 INFO L82 PathProgramCache]: Analyzing trace with hash -644041032, now seen corresponding path program 39 times [2019-08-05 11:21:12,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:12,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:21:12,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:13,656 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 11:21:13,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:13,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:21:13,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:21:13,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:21:13,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:21:13,658 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 42 states. [2019-08-05 11:21:13,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:13,729 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 11:21:13,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:21:13,729 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 11:21:13,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:13,730 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:21:13,730 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:21:13,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:21:13,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:21:13,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 11:21:13,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:21:13,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 11:21:13,733 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 42 [2019-08-05 11:21:13,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:13,733 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 11:21:13,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:21:13,733 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 11:21:13,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 11:21:13,734 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:13,734 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 11:21:13,734 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:13,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:13,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1509573120, now seen corresponding path program 40 times [2019-08-05 11:21:13,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:13,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:21:13,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:14,475 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 11:21:14,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:14,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:21:14,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:21:14,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:21:14,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:21:14,476 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 43 states. [2019-08-05 11:21:14,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:14,538 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 11:21:14,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:21:14,538 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 11:21:14,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:14,539 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:21:14,539 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:21:14,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:21:14,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:21:14,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 11:21:14,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:21:14,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 11:21:14,542 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 43 [2019-08-05 11:21:14,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:14,543 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 11:21:14,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:21:14,543 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 11:21:14,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:21:14,543 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:14,544 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 11:21:14,544 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:14,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:14,544 INFO L82 PathProgramCache]: Analyzing trace with hash -447864904, now seen corresponding path program 41 times [2019-08-05 11:21:14,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:14,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:21:14,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:15,268 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 11:21:15,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:15,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:21:15,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:21:15,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:21:15,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:21:15,270 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 44 states. [2019-08-05 11:21:15,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:15,357 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 11:21:15,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:21:15,357 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 11:21:15,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:15,358 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:21:15,358 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:21:15,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:21:15,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:21:15,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 11:21:15,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:21:15,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 11:21:15,361 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 44 [2019-08-05 11:21:15,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:15,361 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 11:21:15,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:21:15,361 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 11:21:15,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:21:15,362 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:15,362 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 11:21:15,362 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:15,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:15,362 INFO L82 PathProgramCache]: Analyzing trace with hash -998901504, now seen corresponding path program 42 times [2019-08-05 11:21:15,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:15,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:21:15,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:16,928 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 11:21:16,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:16,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:21:16,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:21:16,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:21:16,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:21:16,929 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 45 states. [2019-08-05 11:21:17,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:17,009 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 11:21:17,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:21:17,010 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 11:21:17,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:17,011 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:21:17,011 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:21:17,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:21:17,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:21:17,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 11:21:17,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:21:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 11:21:17,014 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 45 [2019-08-05 11:21:17,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:17,015 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 11:21:17,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:21:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 11:21:17,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:21:17,015 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:17,015 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 11:21:17,016 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:17,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:17,016 INFO L82 PathProgramCache]: Analyzing trace with hash -901166920, now seen corresponding path program 43 times [2019-08-05 11:21:17,017 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:17,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:21:17,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:18,017 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 11:21:18,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:18,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:21:18,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:21:18,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:21:18,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:21:18,019 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 46 states. [2019-08-05 11:21:18,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:18,126 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 11:21:18,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:21:18,127 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 11:21:18,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:18,128 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:21:18,128 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:21:18,129 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 11:21:18,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:21:18,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 11:21:18,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:21:18,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 11:21:18,131 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 46 [2019-08-05 11:21:18,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:18,132 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 11:21:18,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:21:18,132 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 11:21:18,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 11:21:18,132 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:18,132 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 11:21:18,133 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:18,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:18,133 INFO L82 PathProgramCache]: Analyzing trace with hash 2128605184, now seen corresponding path program 44 times [2019-08-05 11:21:18,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:18,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:21:18,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:18,943 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 11:21:18,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:18,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:21:18,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:21:18,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:21:18,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:21:18,944 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 47 states. [2019-08-05 11:21:19,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:19,293 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 11:21:19,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:21:19,293 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 11:21:19,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:19,294 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:21:19,294 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:21:19,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:21:19,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:21:19,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 11:21:19,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:21:19,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 11:21:19,297 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 47 [2019-08-05 11:21:19,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:19,297 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 11:21:19,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:21:19,297 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 11:21:19,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:21:19,298 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:19,298 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 11:21:19,298 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:19,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:19,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1562259896, now seen corresponding path program 45 times [2019-08-05 11:21:19,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:19,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:21:19,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:20,269 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 11:21:20,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:20,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:21:20,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:21:20,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:21:20,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:21:20,271 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 48 states. [2019-08-05 11:21:20,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:20,332 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 11:21:20,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:21:20,333 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 11:21:20,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:20,334 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:21:20,334 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:21:20,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:21:20,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:21:20,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 11:21:20,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 11:21:20,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 11:21:20,337 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 48 [2019-08-05 11:21:20,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:20,337 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 11:21:20,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:21:20,338 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 11:21:20,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 11:21:20,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:20,338 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 11:21:20,338 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:20,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:20,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1185425152, now seen corresponding path program 46 times [2019-08-05 11:21:20,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:20,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:21:20,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:21,216 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 11:21:21,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:21,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:21:21,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:21:21,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:21:21,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:21:21,217 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 49 states. [2019-08-05 11:21:21,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:21,307 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 11:21:21,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:21:21,308 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 11:21:21,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:21,309 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:21:21,309 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:21:21,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:21:21,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:21:21,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 11:21:21,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:21:21,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 11:21:21,312 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 49 [2019-08-05 11:21:21,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:21,313 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 11:21:21,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:21:21,313 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 11:21:21,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:21:21,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:21,313 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 11:21:21,314 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:21,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:21,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1906517320, now seen corresponding path program 47 times [2019-08-05 11:21:21,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:21,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:21:21,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:22,187 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 11:21:22,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:22,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:21:22,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:21:22,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:21:22,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:21:22,189 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 50 states. [2019-08-05 11:21:22,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:22,267 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 11:21:22,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:21:22,267 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 11:21:22,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:22,268 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:21:22,268 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:21:22,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:21:22,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:21:22,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 11:21:22,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 11:21:22,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 11:21:22,271 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 50 [2019-08-05 11:21:22,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:22,271 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 11:21:22,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:21:22,271 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 11:21:22,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:21:22,272 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:22,272 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 11:21:22,272 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:22,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:22,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1027513856, now seen corresponding path program 48 times [2019-08-05 11:21:22,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:22,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:21:22,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:23,485 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 11:21:23,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:23,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:21:23,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:21:23,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:21:23,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:21:23,487 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 51 states. [2019-08-05 11:21:23,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:23,575 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 11:21:23,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:21:23,575 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 11:21:23,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:23,576 INFO L225 Difference]: With dead ends: 55 [2019-08-05 11:21:23,576 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 11:21:23,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:21:23,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 11:21:23,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 11:21:23,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:21:23,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 11:21:23,580 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 51 [2019-08-05 11:21:23,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:23,580 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 11:21:23,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:21:23,581 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 11:21:23,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:21:23,581 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:23,581 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 11:21:23,581 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:23,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:23,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1788167096, now seen corresponding path program 49 times [2019-08-05 11:21:23,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:23,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:21:23,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:24,716 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 11:21:24,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:24,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:21:24,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:21:24,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:21:24,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:21:24,717 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 52 states. [2019-08-05 11:21:24,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:24,824 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 11:21:24,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:21:24,824 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 11:21:24,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:24,825 INFO L225 Difference]: With dead ends: 56 [2019-08-05 11:21:24,825 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 11:21:24,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:21:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 11:21:24,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 11:21:24,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 11:21:24,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 11:21:24,828 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 52 [2019-08-05 11:21:24,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:24,829 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 11:21:24,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:21:24,829 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 11:21:24,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 11:21:24,829 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:24,829 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 11:21:24,830 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:24,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:24,830 INFO L82 PathProgramCache]: Analyzing trace with hash -401386240, now seen corresponding path program 50 times [2019-08-05 11:21:24,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:24,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:21:24,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:26,269 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 11:21:26,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:26,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:21:26,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:21:26,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:21:26,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:21:26,271 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 53 states. [2019-08-05 11:21:26,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:26,356 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 11:21:26,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:21:26,356 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 11:21:26,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:26,358 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:21:26,358 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 11:21:26,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:21:26,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 11:21:26,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 11:21:26,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:21:26,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 11:21:26,360 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 53 [2019-08-05 11:21:26,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:26,361 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 11:21:26,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:21:26,361 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 11:21:26,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:21:26,361 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:26,362 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 11:21:26,362 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:26,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:26,362 INFO L82 PathProgramCache]: Analyzing trace with hash 441937080, now seen corresponding path program 51 times [2019-08-05 11:21:26,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:26,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:21:26,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:28,224 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 11:21:28,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:28,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:21:28,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:21:28,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:21:28,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:21:28,226 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 54 states. [2019-08-05 11:21:28,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:28,331 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 11:21:28,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:21:28,332 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 11:21:28,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:28,333 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:21:28,333 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:21:28,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:21:28,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:21:28,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 11:21:28,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 11:21:28,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 11:21:28,336 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 54 [2019-08-05 11:21:28,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:28,337 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 11:21:28,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:21:28,337 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 11:21:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:21:28,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:28,338 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 11:21:28,338 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:28,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:28,339 INFO L82 PathProgramCache]: Analyzing trace with hash 815156224, now seen corresponding path program 52 times [2019-08-05 11:21:28,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:28,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:21:28,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:29,359 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 11:21:29,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:29,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:21:29,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:21:29,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:21:29,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:21:29,360 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 55 states. [2019-08-05 11:21:29,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:29,445 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 11:21:29,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:21:29,445 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 11:21:29,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:29,446 INFO L225 Difference]: With dead ends: 59 [2019-08-05 11:21:29,446 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 11:21:29,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:21:29,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 11:21:29,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 11:21:29,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:21:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 11:21:29,449 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 55 [2019-08-05 11:21:29,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:29,450 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 11:21:29,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:21:29,450 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 11:21:29,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 11:21:29,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:29,451 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 11:21:29,451 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:29,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:29,451 INFO L82 PathProgramCache]: Analyzing trace with hash -499952200, now seen corresponding path program 53 times [2019-08-05 11:21:29,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:29,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:21:29,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:30,565 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 11:21:30,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:30,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:21:30,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:21:30,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:21:30,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:21:30,566 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 56 states. [2019-08-05 11:21:30,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:30,693 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 11:21:30,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:21:30,694 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 11:21:30,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:30,695 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:21:30,695 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:21:30,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:21:30,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:21:30,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 11:21:30,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 11:21:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 11:21:30,698 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 56 [2019-08-05 11:21:30,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:30,698 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 11:21:30,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:21:30,698 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 11:21:30,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 11:21:30,699 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:30,699 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 11:21:30,699 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:30,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:30,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1681359616, now seen corresponding path program 54 times [2019-08-05 11:21:30,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:30,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:21:30,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:31,904 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 11:21:31,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:31,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:21:31,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:21:31,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:21:31,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:21:31,905 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 57 states. [2019-08-05 11:21:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:32,045 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 11:21:32,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:21:32,046 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 11:21:32,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:32,047 INFO L225 Difference]: With dead ends: 61 [2019-08-05 11:21:32,047 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 11:21:32,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:21:32,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 11:21:32,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 11:21:32,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:21:32,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 11:21:32,051 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2019-08-05 11:21:32,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:32,051 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 11:21:32,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:21:32,051 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 11:21:32,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 11:21:32,051 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:32,052 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 11:21:32,052 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:32,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:32,052 INFO L82 PathProgramCache]: Analyzing trace with hash 582549176, now seen corresponding path program 55 times [2019-08-05 11:21:32,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:32,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:21:32,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:33,416 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 11:21:33,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:33,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:21:33,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:21:33,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:21:33,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:21:33,417 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 58 states. [2019-08-05 11:21:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:33,506 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 11:21:33,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:21:33,507 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 11:21:33,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:33,508 INFO L225 Difference]: With dead ends: 62 [2019-08-05 11:21:33,508 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:21:33,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:21:33,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:21:33,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 11:21:33,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 11:21:33,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 11:21:33,511 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 58 [2019-08-05 11:21:33,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:33,511 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 11:21:33,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:21:33,511 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 11:21:33,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 11:21:33,512 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:33,512 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 11:21:33,512 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:33,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:33,513 INFO L82 PathProgramCache]: Analyzing trace with hash 879163904, now seen corresponding path program 56 times [2019-08-05 11:21:33,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:33,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:21:33,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:34,795 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 11:21:34,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:34,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:21:34,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:21:34,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:21:34,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:21:34,797 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 59 states. [2019-08-05 11:21:34,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:34,879 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 11:21:34,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:21:34,879 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 11:21:34,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:34,880 INFO L225 Difference]: With dead ends: 63 [2019-08-05 11:21:34,880 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 11:21:34,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:21:34,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 11:21:34,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 11:21:34,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:21:34,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 11:21:34,883 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 59 [2019-08-05 11:21:34,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:34,884 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 11:21:34,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:21:34,884 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 11:21:34,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 11:21:34,885 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:34,885 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 11:21:34,885 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:34,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:34,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1484285880, now seen corresponding path program 57 times [2019-08-05 11:21:34,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:34,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:21:34,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:36,318 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 11:21:36,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:36,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:21:36,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:21:36,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:21:36,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:21:36,320 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 60 states. [2019-08-05 11:21:36,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:36,463 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 11:21:36,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:21:36,464 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 11:21:36,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:36,465 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:21:36,465 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:21:36,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:21:36,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:21:36,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 11:21:36,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 11:21:36,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 11:21:36,467 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2019-08-05 11:21:36,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:36,468 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 11:21:36,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:21:36,468 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 11:21:36,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:21:36,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:36,468 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 11:21:36,469 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:36,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:36,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1231769344, now seen corresponding path program 58 times [2019-08-05 11:21:36,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:36,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:21:36,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:38,108 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 11:21:38,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:38,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:21:38,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:21:38,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:21:38,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:21:38,109 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 61 states. [2019-08-05 11:21:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:38,242 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 11:21:38,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:21:38,242 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 11:21:38,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:38,243 INFO L225 Difference]: With dead ends: 65 [2019-08-05 11:21:38,243 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 11:21:38,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:21:38,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 11:21:38,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 11:21:38,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:21:38,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 11:21:38,246 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 61 [2019-08-05 11:21:38,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:38,246 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 11:21:38,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:21:38,246 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 11:21:38,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:21:38,247 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:38,247 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 11:21:38,247 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:38,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:38,247 INFO L82 PathProgramCache]: Analyzing trace with hash 469864632, now seen corresponding path program 59 times [2019-08-05 11:21:38,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:38,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:21:38,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:39,639 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 11:21:39,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:39,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 11:21:39,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:21:39,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:21:39,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:21:39,641 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 62 states. [2019-08-05 11:21:39,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:39,769 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 11:21:39,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:21:39,770 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 11:21:39,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:39,771 INFO L225 Difference]: With dead ends: 66 [2019-08-05 11:21:39,771 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 11:21:39,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:21:39,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 11:21:39,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 11:21:39,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 11:21:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 11:21:39,774 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 62 [2019-08-05 11:21:39,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:39,774 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 11:21:39,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:21:39,775 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 11:21:39,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 11:21:39,775 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:39,775 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 11:21:39,775 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:39,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:39,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1680910336, now seen corresponding path program 60 times [2019-08-05 11:21:39,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:39,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:21:39,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:41,155 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 11:21:41,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:41,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 11:21:41,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 11:21:41,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 11:21:41,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:21:41,157 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 63 states. [2019-08-05 11:21:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:41,290 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 11:21:41,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:21:41,290 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 11:21:41,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:41,291 INFO L225 Difference]: With dead ends: 67 [2019-08-05 11:21:41,291 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 11:21:41,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:21:41,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 11:21:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 11:21:41,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:21:41,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 11:21:41,294 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 63 [2019-08-05 11:21:41,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:41,295 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 11:21:41,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 11:21:41,295 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 11:21:41,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 11:21:41,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:41,296 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 11:21:41,296 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:41,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:41,296 INFO L82 PathProgramCache]: Analyzing trace with hash 568621496, now seen corresponding path program 61 times [2019-08-05 11:21:41,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:41,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:21:41,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:42,706 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 11:21:42,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:42,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 11:21:42,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 11:21:42,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 11:21:42,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:21:42,708 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 64 states. [2019-08-05 11:21:42,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:42,918 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 11:21:42,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 11:21:42,919 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 11:21:42,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:42,919 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:21:42,919 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:21:42,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:21:42,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:21:42,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 11:21:42,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 11:21:42,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 11:21:42,921 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 64 [2019-08-05 11:21:42,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:42,921 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 11:21:42,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 11:21:42,921 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 11:21:42,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 11:21:42,922 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:42,922 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 11:21:42,922 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:42,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:42,922 INFO L82 PathProgramCache]: Analyzing trace with hash 447405824, now seen corresponding path program 62 times [2019-08-05 11:21:42,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:42,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:21:42,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:44,450 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 11:21:44,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:44,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 11:21:44,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 11:21:44,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 11:21:44,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:21:44,452 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 65 states. [2019-08-05 11:21:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:44,593 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 11:21:44,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 11:21:44,593 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 11:21:44,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:44,594 INFO L225 Difference]: With dead ends: 69 [2019-08-05 11:21:44,594 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 11:21:44,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:21:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 11:21:44,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 11:21:44,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:21:44,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 11:21:44,597 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 65 [2019-08-05 11:21:44,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:44,597 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 11:21:44,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 11:21:44,597 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 11:21:44,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 11:21:44,598 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:44,598 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 11:21:44,598 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:44,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:44,599 INFO L82 PathProgramCache]: Analyzing trace with hash 984687288, now seen corresponding path program 63 times [2019-08-05 11:21:44,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:44,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:21:44,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:46,088 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 11:21:46,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:46,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 11:21:46,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 11:21:46,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 11:21:46,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:21:46,090 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 66 states. [2019-08-05 11:21:46,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:46,237 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 11:21:46,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 11:21:46,237 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 11:21:46,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:46,238 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:21:46,238 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:21:46,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:21:46,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:21:46,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 11:21:46,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 11:21:46,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 11:21:46,242 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 66 [2019-08-05 11:21:46,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:46,242 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 11:21:46,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 11:21:46,242 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 11:21:46,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 11:21:46,243 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:46,243 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 11:21:46,243 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:46,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:46,243 INFO L82 PathProgramCache]: Analyzing trace with hash 460543488, now seen corresponding path program 64 times [2019-08-05 11:21:46,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:46,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:21:46,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:47,761 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 11:21:47,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:47,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 11:21:47,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 11:21:47,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 11:21:47,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:21:47,763 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 67 states. [2019-08-05 11:21:47,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:47,860 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 11:21:47,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 11:21:47,860 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 11:21:47,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:47,861 INFO L225 Difference]: With dead ends: 71 [2019-08-05 11:21:47,861 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 11:21:47,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:21:47,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 11:21:47,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 11:21:47,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:21:47,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 11:21:47,865 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 67 [2019-08-05 11:21:47,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:47,865 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 11:21:47,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 11:21:47,866 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 11:21:47,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:21:47,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:47,866 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 11:21:47,866 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:47,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:47,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1391954872, now seen corresponding path program 65 times [2019-08-05 11:21:47,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:47,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:21:47,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:49,688 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 11:21:49,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:49,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 11:21:49,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 11:21:49,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 11:21:49,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:21:49,690 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 68 states. [2019-08-05 11:21:49,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:49,797 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 11:21:49,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 11:21:49,798 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 11:21:49,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:49,798 INFO L225 Difference]: With dead ends: 72 [2019-08-05 11:21:49,799 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 11:21:49,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 11:21:49,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 11:21:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 11:21:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 11:21:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 11:21:49,801 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 68 [2019-08-05 11:21:49,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:49,801 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 11:21:49,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 11:21:49,802 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 11:21:49,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 11:21:49,802 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:49,802 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 11:21:49,802 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:49,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:49,802 INFO L82 PathProgramCache]: Analyzing trace with hash 200936704, now seen corresponding path program 66 times [2019-08-05 11:21:49,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:49,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:21:49,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:51,449 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 11:21:51,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:51,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 11:21:51,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 11:21:51,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 11:21:51,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:21:51,450 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 69 states. [2019-08-05 11:21:51,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:51,655 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 11:21:51,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 11:21:51,656 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 11:21:51,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:51,657 INFO L225 Difference]: With dead ends: 73 [2019-08-05 11:21:51,657 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 11:21:51,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:21:51,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 11:21:51,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 11:21:51,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:21:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 11:21:51,660 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 69 [2019-08-05 11:21:51,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:51,660 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 11:21:51,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 11:21:51,660 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 11:21:51,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:21:51,661 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:51,661 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 11:21:51,661 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:51,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:51,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1934079160, now seen corresponding path program 67 times [2019-08-05 11:21:51,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:51,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:21:51,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:53,726 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 11:21:53,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:53,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 11:21:53,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 11:21:53,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 11:21:53,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:21:53,727 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 70 states. [2019-08-05 11:21:53,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:53,942 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 11:21:53,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 11:21:53,942 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 11:21:53,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:53,943 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:21:53,943 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:21:53,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 11:21:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:21:53,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 11:21:53,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 11:21:53,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 11:21:53,947 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 70 [2019-08-05 11:21:53,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:53,948 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 11:21:53,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 11:21:53,948 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 11:21:53,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 11:21:53,949 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:53,949 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 11:21:53,951 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:53,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:53,951 INFO L82 PathProgramCache]: Analyzing trace with hash -173079552, now seen corresponding path program 68 times [2019-08-05 11:21:53,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:53,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:21:53,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:56,749 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 11:21:56,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:56,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 11:21:56,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 11:21:56,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 11:21:56,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:21:56,750 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 71 states. [2019-08-05 11:21:56,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:56,925 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 11:21:56,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 11:21:56,926 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 11:21:56,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:56,927 INFO L225 Difference]: With dead ends: 75 [2019-08-05 11:21:56,927 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 11:21:56,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:21:56,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 11:21:56,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 11:21:56,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:21:56,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 11:21:56,930 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 71 [2019-08-05 11:21:56,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:56,930 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 11:21:56,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 11:21:56,930 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 11:21:56,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 11:21:56,931 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:56,931 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 11:21:56,931 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:56,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:56,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1070490184, now seen corresponding path program 69 times [2019-08-05 11:21:56,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:56,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 11:21:56,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:21:58,973 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 11:21:58,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:21:58,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 11:21:58,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 11:21:58,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 11:21:58,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:21:58,974 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 72 states. [2019-08-05 11:21:59,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:21:59,106 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 11:21:59,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 11:21:59,106 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 11:21:59,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:21:59,107 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:21:59,107 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:21:59,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 11:21:59,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:21:59,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 11:21:59,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 11:21:59,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 11:21:59,111 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2019-08-05 11:21:59,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:21:59,111 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 11:21:59,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 11:21:59,111 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 11:21:59,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 11:21:59,111 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:21:59,112 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 11:21:59,112 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:21:59,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:21:59,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1174551296, now seen corresponding path program 70 times [2019-08-05 11:21:59,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:21:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:21:59,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:21:59,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:00,831 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 11:22:00,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:00,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 11:22:00,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 11:22:00,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 11:22:00,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:22:00,833 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 73 states. [2019-08-05 11:22:00,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:00,929 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 11:22:00,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 11:22:00,930 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 11:22:00,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:00,930 INFO L225 Difference]: With dead ends: 77 [2019-08-05 11:22:00,931 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 11:22:00,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:22:00,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 11:22:00,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 11:22:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:22:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 11:22:00,934 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 73 [2019-08-05 11:22:00,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:00,934 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 11:22:00,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 11:22:00,934 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 11:22:00,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 11:22:00,935 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:00,935 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 11:22:00,935 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:00,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:00,935 INFO L82 PathProgramCache]: Analyzing trace with hash 2051360440, now seen corresponding path program 71 times [2019-08-05 11:22:00,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:00,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:22:00,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:02,763 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 11:22:02,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:02,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 11:22:02,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 11:22:02,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 11:22:02,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:22:02,765 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 74 states. [2019-08-05 11:22:02,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:02,895 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 11:22:02,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 11:22:02,895 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 11:22:02,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:02,897 INFO L225 Difference]: With dead ends: 78 [2019-08-05 11:22:02,897 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 11:22:02,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 11:22:02,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 11:22:02,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 11:22:02,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 11:22:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 11:22:02,900 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 74 [2019-08-05 11:22:02,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:02,900 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 11:22:02,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 11:22:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 11:22:02,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 11:22:02,901 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:02,901 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 11:22:02,901 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:02,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:02,901 INFO L82 PathProgramCache]: Analyzing trace with hash -832327168, now seen corresponding path program 72 times [2019-08-05 11:22:02,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:02,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:22:02,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:05,122 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 11:22:05,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:05,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 11:22:05,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 11:22:05,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 11:22:05,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:22:05,124 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 75 states. [2019-08-05 11:22:05,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:05,229 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 11:22:05,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 11:22:05,229 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 11:22:05,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:05,230 INFO L225 Difference]: With dead ends: 79 [2019-08-05 11:22:05,230 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 11:22:05,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:22:05,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 11:22:05,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 11:22:05,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:22:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 11:22:05,233 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 75 [2019-08-05 11:22:05,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:05,233 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 11:22:05,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 11:22:05,234 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 11:22:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 11:22:05,234 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:05,234 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 11:22:05,234 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:05,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:05,235 INFO L82 PathProgramCache]: Analyzing trace with hash -32329800, now seen corresponding path program 73 times [2019-08-05 11:22:05,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:05,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 11:22:05,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:07,208 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 11:22:07,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:07,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 11:22:07,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 11:22:07,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 11:22:07,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:22:07,210 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 76 states. [2019-08-05 11:22:07,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:07,350 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 11:22:07,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 11:22:07,350 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 11:22:07,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:07,351 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:22:07,351 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 11:22:07,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 11:22:07,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 11:22:07,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 11:22:07,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 11:22:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 11:22:07,354 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 76 [2019-08-05 11:22:07,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:07,354 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 11:22:07,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 11:22:07,355 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 11:22:07,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 11:22:07,355 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:07,355 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 11:22:07,356 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:07,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:07,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1002215168, now seen corresponding path program 74 times [2019-08-05 11:22:07,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:07,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:22:07,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:09,468 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 11:22:09,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:09,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 11:22:09,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 11:22:09,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 11:22:09,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:22:09,469 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 77 states. [2019-08-05 11:22:09,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:09,591 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 11:22:09,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 11:22:09,591 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 11:22:09,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:09,592 INFO L225 Difference]: With dead ends: 81 [2019-08-05 11:22:09,592 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 11:22:09,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:22:09,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 11:22:09,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 11:22:09,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:22:09,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 11:22:09,595 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 77 [2019-08-05 11:22:09,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:09,595 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 11:22:09,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 11:22:09,596 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 11:22:09,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 11:22:09,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:09,596 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 11:22:09,597 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:09,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:09,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1003890504, now seen corresponding path program 75 times [2019-08-05 11:22:09,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:09,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 11:22:09,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:11,580 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 11:22:11,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:11,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 11:22:11,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 11:22:11,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 11:22:11,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:22:11,582 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 78 states. [2019-08-05 11:22:12,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:12,104 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 11:22:12,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 11:22:12,105 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 11:22:12,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:12,105 INFO L225 Difference]: With dead ends: 82 [2019-08-05 11:22:12,106 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 11:22:12,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 11:22:12,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 11:22:12,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 11:22:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 11:22:12,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 11:22:12,108 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 78 [2019-08-05 11:22:12,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:12,109 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 11:22:12,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 11:22:12,109 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 11:22:12,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 11:22:12,109 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:12,110 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 11:22:12,110 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:12,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:12,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1055825920, now seen corresponding path program 76 times [2019-08-05 11:22:12,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:12,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 11:22:12,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:14,673 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 11:22:14,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:14,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 11:22:14,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 11:22:14,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 11:22:14,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:22:14,675 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 79 states. [2019-08-05 11:22:14,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:14,823 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 11:22:14,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 11:22:14,823 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 11:22:14,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:14,824 INFO L225 Difference]: With dead ends: 83 [2019-08-05 11:22:14,824 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 11:22:14,825 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 11:22:14,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 11:22:14,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 11:22:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:22:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 11:22:14,827 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 79 [2019-08-05 11:22:14,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:14,827 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 11:22:14,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 11:22:14,827 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 11:22:14,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 11:22:14,828 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:14,828 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 11:22:14,828 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:14,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:14,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1629143480, now seen corresponding path program 77 times [2019-08-05 11:22:14,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:14,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 11:22:14,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:16,913 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 11:22:16,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:16,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 11:22:16,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 11:22:16,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 11:22:16,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:22:16,914 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 80 states. [2019-08-05 11:22:17,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:17,044 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 11:22:17,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 11:22:17,044 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 11:22:17,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:17,045 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:22:17,045 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:22:17,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 11:22:17,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:22:17,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 11:22:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 11:22:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 11:22:17,048 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 80 [2019-08-05 11:22:17,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:17,049 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 11:22:17,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 11:22:17,049 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 11:22:17,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 11:22:17,049 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:17,050 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 11:22:17,050 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:17,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:17,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1036151040, now seen corresponding path program 78 times [2019-08-05 11:22:17,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:17,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 11:22:17,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:19,491 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 11:22:19,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:19,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 11:22:19,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 11:22:19,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 11:22:19,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:22:19,493 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 81 states. [2019-08-05 11:22:19,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:19,626 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 11:22:19,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 11:22:19,627 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 11:22:19,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:19,628 INFO L225 Difference]: With dead ends: 85 [2019-08-05 11:22:19,628 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 11:22:19,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:22:19,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 11:22:19,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 11:22:19,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:22:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 11:22:19,631 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 81 [2019-08-05 11:22:19,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:19,631 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 11:22:19,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 11:22:19,631 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 11:22:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 11:22:19,631 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:19,631 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 11:22:19,632 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:19,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:19,632 INFO L82 PathProgramCache]: Analyzing trace with hash -2055902536, now seen corresponding path program 79 times [2019-08-05 11:22:19,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:19,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 11:22:19,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:21,882 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 11:22:21,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:21,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 11:22:21,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 11:22:21,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 11:22:21,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:22:21,884 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 82 states. [2019-08-05 11:22:21,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:21,998 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 11:22:21,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 11:22:21,999 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 11:22:21,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:22,000 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:22:22,000 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 11:22:22,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 11:22:22,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 11:22:22,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 11:22:22,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 11:22:22,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 11:22:22,003 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 82 [2019-08-05 11:22:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:22,003 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 11:22:22,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 11:22:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 11:22:22,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 11:22:22,004 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:22,004 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 11:22:22,004 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:22,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:22,004 INFO L82 PathProgramCache]: Analyzing trace with hash 691539456, now seen corresponding path program 80 times [2019-08-05 11:22:22,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:22,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 11:22:22,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:26,303 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 11:22:26,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:26,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 11:22:26,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 11:22:26,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 11:22:26,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:22:26,304 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 83 states. [2019-08-05 11:22:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:26,418 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 11:22:26,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 11:22:26,418 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 11:22:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:26,419 INFO L225 Difference]: With dead ends: 87 [2019-08-05 11:22:26,419 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 11:22:26,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:22:26,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 11:22:26,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 11:22:26,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:22:26,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 11:22:26,423 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 83 [2019-08-05 11:22:26,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:26,423 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 11:22:26,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 11:22:26,423 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 11:22:26,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 11:22:26,423 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:26,424 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 11:22:26,424 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:26,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:26,424 INFO L82 PathProgramCache]: Analyzing trace with hash -37104712, now seen corresponding path program 81 times [2019-08-05 11:22:26,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:26,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 11:22:26,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:29,379 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 11:22:29,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:29,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 11:22:29,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 11:22:29,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 11:22:29,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:22:29,381 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 84 states. [2019-08-05 11:22:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:29,495 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 11:22:29,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 11:22:29,495 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 11:22:29,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:29,496 INFO L225 Difference]: With dead ends: 88 [2019-08-05 11:22:29,496 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 11:22:29,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 11:22:29,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 11:22:29,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 11:22:29,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 11:22:29,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 11:22:29,500 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 84 [2019-08-05 11:22:29,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:29,500 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 11:22:29,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 11:22:29,501 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 11:22:29,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 11:22:29,501 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:29,501 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 11:22:29,502 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:29,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:29,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1150237440, now seen corresponding path program 82 times [2019-08-05 11:22:29,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:29,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 11:22:29,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:33,086 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 11:22:33,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:33,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 11:22:33,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 11:22:33,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 11:22:33,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:22:33,087 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 85 states. [2019-08-05 11:22:33,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:33,203 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 11:22:33,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 11:22:33,203 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-05 11:22:33,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:33,204 INFO L225 Difference]: With dead ends: 89 [2019-08-05 11:22:33,204 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 11:22:33,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:22:33,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 11:22:33,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 11:22:33,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:22:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 11:22:33,209 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 85 [2019-08-05 11:22:33,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:33,209 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 11:22:33,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 11:22:33,210 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 11:22:33,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 11:22:33,210 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:33,210 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-05 11:22:33,210 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:33,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:33,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1297613640, now seen corresponding path program 83 times [2019-08-05 11:22:33,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:33,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 11:22:33,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:35,875 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 11:22:35,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:35,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 11:22:35,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 11:22:35,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 11:22:35,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:22:35,877 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 86 states. [2019-08-05 11:22:36,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:36,227 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 11:22:36,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 11:22:36,227 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-05 11:22:36,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:36,228 INFO L225 Difference]: With dead ends: 90 [2019-08-05 11:22:36,228 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 11:22:36,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 11:22:36,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 11:22:36,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 11:22:36,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 11:22:36,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 11:22:36,231 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 86 [2019-08-05 11:22:36,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:36,231 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 11:22:36,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 11:22:36,231 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 11:22:36,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 11:22:36,232 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:36,232 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-05 11:22:36,233 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:36,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:36,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1571308544, now seen corresponding path program 84 times [2019-08-05 11:22:36,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:36,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 11:22:36,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:38,728 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 11:22:38,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:38,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 11:22:38,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 11:22:38,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 11:22:38,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:22:38,729 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 87 states. [2019-08-05 11:22:38,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:38,854 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 11:22:38,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 11:22:38,854 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-05 11:22:38,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:38,855 INFO L225 Difference]: With dead ends: 91 [2019-08-05 11:22:38,855 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 11:22:38,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:22:38,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 11:22:38,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 11:22:38,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:22:38,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 11:22:38,858 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2019-08-05 11:22:38,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:38,858 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 11:22:38,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 11:22:38,858 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 11:22:38,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 11:22:38,859 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:38,859 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-05 11:22:38,859 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:38,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:38,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1465915976, now seen corresponding path program 85 times [2019-08-05 11:22:38,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:38,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 11:22:38,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:41,415 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 11:22:41,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:41,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 11:22:41,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 11:22:41,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 11:22:41,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:22:41,417 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 88 states. [2019-08-05 11:22:41,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:41,620 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 11:22:41,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 11:22:41,621 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-05 11:22:41,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:41,622 INFO L225 Difference]: With dead ends: 92 [2019-08-05 11:22:41,622 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 11:22:41,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 11:22:41,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 11:22:41,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 11:22:41,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 11:22:41,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 11:22:41,625 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 88 [2019-08-05 11:22:41,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:41,625 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 11:22:41,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 11:22:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 11:22:41,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 11:22:41,626 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:41,626 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-05 11:22:41,626 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:41,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:41,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1801253632, now seen corresponding path program 86 times [2019-08-05 11:22:41,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:41,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 11:22:41,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:44,168 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 11:22:44,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:44,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 11:22:44,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 11:22:44,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 11:22:44,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:22:44,170 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 89 states. [2019-08-05 11:22:44,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:44,443 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 11:22:44,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 11:22:44,443 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-08-05 11:22:44,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:44,444 INFO L225 Difference]: With dead ends: 93 [2019-08-05 11:22:44,444 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 11:22:44,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:22:44,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 11:22:44,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 11:22:44,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:22:44,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 11:22:44,446 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 89 [2019-08-05 11:22:44,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:44,446 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 11:22:44,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 11:22:44,446 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 11:22:44,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 11:22:44,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:44,447 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-08-05 11:22:44,447 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:44,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:44,447 INFO L82 PathProgramCache]: Analyzing trace with hash 4296376, now seen corresponding path program 87 times [2019-08-05 11:22:44,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:44,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 11:22:44,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:47,237 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 11:22:47,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:47,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 11:22:47,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 11:22:47,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 11:22:47,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:22:47,238 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 90 states. [2019-08-05 11:22:47,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:47,410 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 11:22:47,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 11:22:47,410 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-08-05 11:22:47,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:47,411 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:22:47,411 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:22:47,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 11:22:47,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:22:47,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 11:22:47,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 11:22:47,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 11:22:47,415 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2019-08-05 11:22:47,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:47,416 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 11:22:47,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 11:22:47,416 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 11:22:47,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 11:22:47,416 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:47,416 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-05 11:22:47,417 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:47,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:47,417 INFO L82 PathProgramCache]: Analyzing trace with hash 133196288, now seen corresponding path program 88 times [2019-08-05 11:22:47,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:47,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 11:22:47,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:50,330 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 11:22:50,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:50,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 11:22:50,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 11:22:50,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 11:22:50,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:22:50,331 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 91 states. [2019-08-05 11:22:50,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:50,458 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 11:22:50,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 11:22:50,459 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-05 11:22:50,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:50,460 INFO L225 Difference]: With dead ends: 95 [2019-08-05 11:22:50,460 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 11:22:50,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:22:50,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 11:22:50,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 11:22:50,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:22:50,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 11:22:50,463 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 91 [2019-08-05 11:22:50,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:50,463 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 11:22:50,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 11:22:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 11:22:50,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 11:22:50,464 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:50,464 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-08-05 11:22:50,464 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:50,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:50,465 INFO L82 PathProgramCache]: Analyzing trace with hash -165873736, now seen corresponding path program 89 times [2019-08-05 11:22:50,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:50,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 11:22:50,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:53,318 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 11:22:53,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:53,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 11:22:53,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 11:22:53,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 11:22:53,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:22:53,320 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 92 states. [2019-08-05 11:22:53,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:53,475 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 11:22:53,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 11:22:53,475 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-05 11:22:53,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:53,476 INFO L225 Difference]: With dead ends: 96 [2019-08-05 11:22:53,476 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 11:22:53,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 11:22:53,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 11:22:53,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 11:22:53,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 11:22:53,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 11:22:53,479 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 92 [2019-08-05 11:22:53,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:53,479 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 11:22:53,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 11:22:53,479 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 11:22:53,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 11:22:53,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:53,480 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-08-05 11:22:53,480 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:53,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:53,480 INFO L82 PathProgramCache]: Analyzing trace with hash -847109888, now seen corresponding path program 90 times [2019-08-05 11:22:53,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:53,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 11:22:53,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:56,581 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 11:22:56,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:56,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 11:22:56,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 11:22:56,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 11:22:56,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:22:56,583 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 93 states. [2019-08-05 11:22:56,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:56,758 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 11:22:56,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 11:22:56,758 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-08-05 11:22:56,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:56,759 INFO L225 Difference]: With dead ends: 97 [2019-08-05 11:22:56,759 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 11:22:56,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:22:56,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 11:22:56,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 11:22:56,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:22:56,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 11:22:56,762 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2019-08-05 11:22:56,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:56,763 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 11:22:56,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 11:22:56,763 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 11:22:56,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 11:22:56,763 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:56,763 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-08-05 11:22:56,763 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:56,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:56,764 INFO L82 PathProgramCache]: Analyzing trace with hash -490594120, now seen corresponding path program 91 times [2019-08-05 11:22:56,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:56,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 11:22:56,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:22:59,693 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 11:22:59,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:22:59,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 11:22:59,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 11:22:59,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 11:22:59,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:22:59,694 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 94 states. [2019-08-05 11:22:59,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:22:59,896 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 11:22:59,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 11:22:59,896 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-08-05 11:22:59,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:22:59,897 INFO L225 Difference]: With dead ends: 98 [2019-08-05 11:22:59,897 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 11:22:59,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 11:22:59,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 11:22:59,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 11:22:59,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 11:22:59,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 11:22:59,899 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 94 [2019-08-05 11:22:59,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:22:59,899 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 11:22:59,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 11:22:59,899 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 11:22:59,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 11:22:59,900 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:22:59,900 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-08-05 11:22:59,900 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:22:59,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:22:59,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1971460096, now seen corresponding path program 92 times [2019-08-05 11:22:59,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:22:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:22:59,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 11:22:59,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:02,895 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 11:23:02,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:02,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 11:23:02,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 11:23:02,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 11:23:02,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:23:02,896 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 95 states. [2019-08-05 11:23:03,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:03,073 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 11:23:03,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 11:23:03,074 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-08-05 11:23:03,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:03,075 INFO L225 Difference]: With dead ends: 99 [2019-08-05 11:23:03,075 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 11:23:03,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:23:03,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 11:23:03,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 11:23:03,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:23:03,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 11:23:03,078 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 95 [2019-08-05 11:23:03,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:03,078 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 11:23:03,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 11:23:03,079 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 11:23:03,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 11:23:03,079 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:03,079 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-08-05 11:23:03,080 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:03,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:03,080 INFO L82 PathProgramCache]: Analyzing trace with hash 985729464, now seen corresponding path program 93 times [2019-08-05 11:23:03,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:03,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 11:23:03,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:06,267 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:23:06,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:06,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 11:23:06,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 11:23:06,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 11:23:06,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:23:06,269 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 96 states. [2019-08-05 11:23:06,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:06,419 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 11:23:06,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 11:23:06,419 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-08-05 11:23:06,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:06,420 INFO L225 Difference]: With dead ends: 100 [2019-08-05 11:23:06,420 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 11:23:06,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 11:23:06,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 11:23:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 11:23:06,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 11:23:06,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 11:23:06,424 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2019-08-05 11:23:06,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:06,424 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 11:23:06,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 11:23:06,424 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 11:23:06,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 11:23:06,425 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:06,425 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-08-05 11:23:06,425 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:06,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:06,425 INFO L82 PathProgramCache]: Analyzing trace with hash 492850944, now seen corresponding path program 94 times [2019-08-05 11:23:06,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:06,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 11:23:06,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:10,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:10,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:10,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 11:23:10,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 11:23:10,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 11:23:10,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:23:10,179 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 97 states. [2019-08-05 11:23:10,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:10,363 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 11:23:10,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 11:23:10,364 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-08-05 11:23:10,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:10,365 INFO L225 Difference]: With dead ends: 101 [2019-08-05 11:23:10,365 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 11:23:10,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:23:10,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 11:23:10,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 11:23:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:23:10,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 11:23:10,368 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 97 [2019-08-05 11:23:10,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:10,368 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 11:23:10,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 11:23:10,368 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 11:23:10,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 11:23:10,368 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:10,369 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-08-05 11:23:10,369 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:10,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:10,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1901481288, now seen corresponding path program 95 times [2019-08-05 11:23:10,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:10,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 11:23:10,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:13,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:13,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:13,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 11:23:13,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 11:23:13,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 11:23:13,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:23:13,466 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 98 states. [2019-08-05 11:23:13,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:13,620 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 11:23:13,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 11:23:13,620 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-08-05 11:23:13,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:13,621 INFO L225 Difference]: With dead ends: 102 [2019-08-05 11:23:13,622 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 11:23:13,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 11:23:13,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 11:23:13,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 11:23:13,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 11:23:13,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 11:23:13,624 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 98 [2019-08-05 11:23:13,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:13,625 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 11:23:13,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 11:23:13,625 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 11:23:13,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 11:23:13,625 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:13,625 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 11:23:13,625 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:13,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:13,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1183630848, now seen corresponding path program 96 times [2019-08-05 11:23:13,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:13,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 11:23:13,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:16,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:16,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:16,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 11:23:16,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 11:23:16,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 11:23:16,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:23:16,942 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 99 states. [2019-08-05 11:23:17,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:17,085 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 11:23:17,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 11:23:17,085 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 11:23:17,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:17,086 INFO L225 Difference]: With dead ends: 103 [2019-08-05 11:23:17,086 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 11:23:17,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:23:17,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 11:23:17,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 11:23:17,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:23:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 11:23:17,089 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2019-08-05 11:23:17,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:17,090 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 11:23:17,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 11:23:17,090 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 11:23:17,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 11:23:17,091 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:17,091 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-08-05 11:23:17,091 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:17,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:17,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1962140744, now seen corresponding path program 97 times [2019-08-05 11:23:17,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:17,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 11:23:17,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:20,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:20,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:20,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 11:23:20,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 11:23:20,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 11:23:20,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:23:20,259 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 100 states. [2019-08-05 11:23:20,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:20,446 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 11:23:20,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 11:23:20,446 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-08-05 11:23:20,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:20,447 INFO L225 Difference]: With dead ends: 104 [2019-08-05 11:23:20,447 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 11:23:20,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 11:23:20,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 11:23:20,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 11:23:20,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 11:23:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 11:23:20,450 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 100 [2019-08-05 11:23:20,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:20,451 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 11:23:20,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 11:23:20,451 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 11:23:20,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:23:20,451 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:20,451 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-08-05 11:23:20,451 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:20,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:20,452 INFO L82 PathProgramCache]: Analyzing trace with hash -696812288, now seen corresponding path program 98 times [2019-08-05 11:23:20,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:20,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 11:23:20,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:23,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:23,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:23,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 11:23:23,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 11:23:23,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 11:23:23,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:23:23,705 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 101 states. [2019-08-05 11:23:23,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:23,950 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 11:23:23,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 11:23:23,950 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-08-05 11:23:23,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:23,951 INFO L225 Difference]: With dead ends: 105 [2019-08-05 11:23:23,951 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 11:23:23,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:23:23,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 11:23:23,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 11:23:23,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:23:23,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 11:23:23,954 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 101 [2019-08-05 11:23:23,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:23,954 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 11:23:23,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 11:23:23,955 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 11:23:23,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 11:23:23,955 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:23,955 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-08-05 11:23:23,955 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:23,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:23,956 INFO L82 PathProgramCache]: Analyzing trace with hash -126335816, now seen corresponding path program 99 times [2019-08-05 11:23:23,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:23,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 11:23:23,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:27,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:27,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 11:23:27,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 11:23:27,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 11:23:27,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:23:27,519 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 102 states. [2019-08-05 11:23:27,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:27,680 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 11:23:27,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 11:23:27,681 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-08-05 11:23:27,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:27,681 INFO L225 Difference]: With dead ends: 106 [2019-08-05 11:23:27,682 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 11:23:27,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 11:23:27,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 11:23:27,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 11:23:27,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 11:23:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 11:23:27,684 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2019-08-05 11:23:27,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:27,685 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 11:23:27,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 11:23:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 11:23:27,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 11:23:27,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:27,686 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-08-05 11:23:27,686 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:27,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:27,686 INFO L82 PathProgramCache]: Analyzing trace with hash 378565632, now seen corresponding path program 100 times [2019-08-05 11:23:27,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:27,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 11:23:27,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:31,291 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:31,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:31,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 11:23:31,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 11:23:31,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 11:23:31,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:23:31,293 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 103 states. [2019-08-05 11:23:31,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:31,526 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 11:23:31,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 11:23:31,527 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-08-05 11:23:31,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:31,528 INFO L225 Difference]: With dead ends: 107 [2019-08-05 11:23:31,528 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 11:23:31,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:23:31,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 11:23:31,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 11:23:31,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:23:31,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 11:23:31,531 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 103 [2019-08-05 11:23:31,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:31,531 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 11:23:31,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 11:23:31,532 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 11:23:31,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 11:23:31,532 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:31,532 INFO L399 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-08-05 11:23:31,533 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:31,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:31,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1149358664, now seen corresponding path program 101 times [2019-08-05 11:23:31,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:31,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 11:23:31,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:35,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:35,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:35,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 11:23:35,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 11:23:35,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 11:23:35,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:23:35,020 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 104 states. [2019-08-05 11:23:35,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:35,197 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 11:23:35,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 11:23:35,198 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-08-05 11:23:35,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:35,199 INFO L225 Difference]: With dead ends: 108 [2019-08-05 11:23:35,199 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 11:23:35,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 11:23:35,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 11:23:35,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 11:23:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 11:23:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 11:23:35,202 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 104 [2019-08-05 11:23:35,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:35,203 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 11:23:35,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 11:23:35,203 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 11:23:35,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 11:23:35,203 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:35,203 INFO L399 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-08-05 11:23:35,204 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:35,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:35,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1270371584, now seen corresponding path program 102 times [2019-08-05 11:23:35,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:35,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 11:23:35,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:39,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:39,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:39,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 11:23:39,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 11:23:39,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 11:23:39,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:23:39,227 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 105 states. [2019-08-05 11:23:39,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:39,478 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 11:23:39,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 11:23:39,479 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-08-05 11:23:39,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:39,480 INFO L225 Difference]: With dead ends: 109 [2019-08-05 11:23:39,480 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 11:23:39,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:23:39,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 11:23:39,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 11:23:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:23:39,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 11:23:39,483 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 105 [2019-08-05 11:23:39,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:39,483 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 11:23:39,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 11:23:39,484 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 11:23:39,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 11:23:39,484 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:39,484 INFO L399 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-08-05 11:23:39,484 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:39,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:39,485 INFO L82 PathProgramCache]: Analyzing trace with hash -726804808, now seen corresponding path program 103 times [2019-08-05 11:23:39,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:39,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 11:23:39,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:43,311 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:43,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:43,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 11:23:43,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 11:23:43,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 11:23:43,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:23:43,313 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 106 states. [2019-08-05 11:23:43,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:43,487 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 11:23:43,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 11:23:43,488 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-08-05 11:23:43,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:43,489 INFO L225 Difference]: With dead ends: 110 [2019-08-05 11:23:43,489 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 11:23:43,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 11:23:43,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 11:23:43,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 11:23:43,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 11:23:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 11:23:43,492 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 106 [2019-08-05 11:23:43,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:43,492 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 11:23:43,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 11:23:43,492 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 11:23:43,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 11:23:43,493 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:43,493 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-08-05 11:23:43,493 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:43,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:43,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1056103936, now seen corresponding path program 104 times [2019-08-05 11:23:43,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:43,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 11:23:43,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:47,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:47,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 11:23:47,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 11:23:47,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 11:23:47,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:23:47,890 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 107 states. [2019-08-05 11:23:48,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:48,123 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 11:23:48,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 11:23:48,123 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-08-05 11:23:48,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:48,125 INFO L225 Difference]: With dead ends: 111 [2019-08-05 11:23:48,125 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 11:23:48,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:23:48,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 11:23:48,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 11:23:48,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:23:48,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 11:23:48,128 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 107 [2019-08-05 11:23:48,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:48,128 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 11:23:48,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 11:23:48,129 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 11:23:48,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 11:23:48,129 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:48,129 INFO L399 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-08-05 11:23:48,129 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:48,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:48,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1620524984, now seen corresponding path program 105 times [2019-08-05 11:23:48,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:48,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 11:23:48,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:52,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:52,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:52,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 11:23:52,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 11:23:52,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 11:23:52,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:23:52,021 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 108 states. [2019-08-05 11:23:52,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:52,228 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 11:23:52,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 11:23:52,228 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-08-05 11:23:52,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:52,229 INFO L225 Difference]: With dead ends: 112 [2019-08-05 11:23:52,229 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 11:23:52,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 11:23:52,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 11:23:52,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 11:23:52,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 11:23:52,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 11:23:52,232 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 108 [2019-08-05 11:23:52,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:52,232 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 11:23:52,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 11:23:52,232 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 11:23:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 11:23:52,233 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:52,233 INFO L399 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-08-05 11:23:52,233 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:52,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:52,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1303324416, now seen corresponding path program 106 times [2019-08-05 11:23:52,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:52,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 11:23:52,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:23:56,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:23:56,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:23:56,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 11:23:56,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 11:23:56,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 11:23:56,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:23:56,127 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 109 states. [2019-08-05 11:23:56,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:23:56,391 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 11:23:56,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 11:23:56,392 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-08-05 11:23:56,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:23:56,393 INFO L225 Difference]: With dead ends: 113 [2019-08-05 11:23:56,393 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 11:23:56,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:23:56,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 11:23:56,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 11:23:56,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:23:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 11:23:56,396 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 109 [2019-08-05 11:23:56,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:23:56,396 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 11:23:56,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 11:23:56,396 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 11:23:56,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 11:23:56,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:23:56,397 INFO L399 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-08-05 11:23:56,397 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:23:56,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:23:56,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1748342600, now seen corresponding path program 107 times [2019-08-05 11:23:56,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:23:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:23:56,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 11:23:56,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:24:00,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:00,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 11:24:00,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 11:24:00,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 11:24:00,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 11:24:00,359 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 110 states. [2019-08-05 11:24:00,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:00,561 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 11:24:00,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 11:24:00,562 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-08-05 11:24:00,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:00,563 INFO L225 Difference]: With dead ends: 114 [2019-08-05 11:24:00,563 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 11:24:00,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 11:24:00,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 11:24:00,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 11:24:00,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 11:24:00,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 11:24:00,566 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 110 [2019-08-05 11:24:00,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:00,567 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 11:24:00,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 11:24:00,567 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 11:24:00,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 11:24:00,567 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:00,567 INFO L399 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-08-05 11:24:00,568 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:00,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:00,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1635962880, now seen corresponding path program 108 times [2019-08-05 11:24:00,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:00,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 11:24:00,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:04,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:24:04,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:04,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 11:24:04,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 11:24:04,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 11:24:04,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:24:04,500 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 111 states. [2019-08-05 11:24:04,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:04,811 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 11:24:04,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 11:24:04,812 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-08-05 11:24:04,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:04,813 INFO L225 Difference]: With dead ends: 115 [2019-08-05 11:24:04,813 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 11:24:04,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:24:04,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 11:24:04,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 11:24:04,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:24:04,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 11:24:04,816 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 111 [2019-08-05 11:24:04,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:04,817 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 11:24:04,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 11:24:04,817 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 11:24:04,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 11:24:04,817 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:04,818 INFO L399 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-08-05 11:24:04,818 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:04,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:04,818 INFO L82 PathProgramCache]: Analyzing trace with hash -824749640, now seen corresponding path program 109 times [2019-08-05 11:24:04,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:04,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 11:24:04,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:24:08,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:08,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 11:24:08,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 11:24:08,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 11:24:08,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 11:24:08,866 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 112 states. [2019-08-05 11:24:09,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:09,104 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 11:24:09,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 11:24:09,104 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-08-05 11:24:09,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:09,105 INFO L225 Difference]: With dead ends: 116 [2019-08-05 11:24:09,105 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 11:24:09,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 11:24:09,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 11:24:09,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 11:24:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 11:24:09,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 11:24:09,108 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 112 [2019-08-05 11:24:09,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:09,109 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 11:24:09,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 11:24:09,109 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 11:24:09,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 11:24:09,109 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:09,109 INFO L399 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-08-05 11:24:09,110 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:09,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:09,110 INFO L82 PathProgramCache]: Analyzing trace with hash 202573568, now seen corresponding path program 110 times [2019-08-05 11:24:09,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:09,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 11:24:09,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:13,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:24:13,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:13,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 11:24:13,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 11:24:13,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 11:24:13,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:24:13,215 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 113 states. [2019-08-05 11:24:13,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:13,412 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 11:24:13,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 11:24:13,413 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-08-05 11:24:13,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:13,413 INFO L225 Difference]: With dead ends: 117 [2019-08-05 11:24:13,414 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 11:24:13,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:24:13,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 11:24:13,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 11:24:13,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:24:13,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 11:24:13,416 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 113 [2019-08-05 11:24:13,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:13,416 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 11:24:13,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 11:24:13,417 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 11:24:13,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 11:24:13,417 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:13,417 INFO L399 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-08-05 11:24:13,417 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:13,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:13,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1984821944, now seen corresponding path program 111 times [2019-08-05 11:24:13,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:13,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 11:24:13,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:24:17,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:17,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 11:24:17,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 11:24:17,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 11:24:17,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 11:24:17,598 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 114 states. [2019-08-05 11:24:17,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:17,913 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 11:24:17,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 11:24:17,913 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2019-08-05 11:24:17,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:17,914 INFO L225 Difference]: With dead ends: 118 [2019-08-05 11:24:17,914 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 11:24:17,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 11:24:17,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 11:24:17,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 11:24:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 11:24:17,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 11:24:17,916 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 114 [2019-08-05 11:24:17,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:17,917 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 11:24:17,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 11:24:17,917 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 11:24:17,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 11:24:17,918 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:17,918 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2019-08-05 11:24:17,918 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:17,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:17,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1399946752, now seen corresponding path program 112 times [2019-08-05 11:24:17,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:17,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 11:24:17,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:22,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:24:22,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:22,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 11:24:22,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 11:24:22,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 11:24:22,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:24:22,122 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 115 states. [2019-08-05 11:24:22,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:22,366 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 11:24:22,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 11:24:22,367 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2019-08-05 11:24:22,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:22,367 INFO L225 Difference]: With dead ends: 119 [2019-08-05 11:24:22,367 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 11:24:22,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:24:22,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 11:24:22,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 11:24:22,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:24:22,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 11:24:22,370 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 115 [2019-08-05 11:24:22,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:22,370 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 11:24:22,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 11:24:22,371 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 11:24:22,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 11:24:22,371 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:22,371 INFO L399 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2019-08-05 11:24:22,372 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:22,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:22,372 INFO L82 PathProgramCache]: Analyzing trace with hash 448684984, now seen corresponding path program 113 times [2019-08-05 11:24:22,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:22,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 11:24:22,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:24:26,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:26,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 11:24:26,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 11:24:26,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 11:24:26,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 11:24:26,620 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 116 states. [2019-08-05 11:24:26,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:26,856 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 11:24:26,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 11:24:26,857 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2019-08-05 11:24:26,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:26,857 INFO L225 Difference]: With dead ends: 120 [2019-08-05 11:24:26,857 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 11:24:26,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 11:24:26,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 11:24:26,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-08-05 11:24:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 11:24:26,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 11:24:26,861 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 116 [2019-08-05 11:24:26,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:26,861 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 11:24:26,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 11:24:26,861 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 11:24:26,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 11:24:26,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:26,862 INFO L399 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2019-08-05 11:24:26,862 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:26,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:26,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1024341248, now seen corresponding path program 114 times [2019-08-05 11:24:26,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:26,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 11:24:26,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:31,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:24:31,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:31,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-05 11:24:31,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-05 11:24:31,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-05 11:24:31,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:24:31,187 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 117 states. [2019-08-05 11:24:31,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:31,410 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-05 11:24:31,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-05 11:24:31,411 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 117 [2019-08-05 11:24:31,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:31,411 INFO L225 Difference]: With dead ends: 121 [2019-08-05 11:24:31,412 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 11:24:31,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:24:31,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 11:24:31,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-05 11:24:31,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:24:31,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-05 11:24:31,414 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 117 [2019-08-05 11:24:31,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:31,414 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-05 11:24:31,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-05 11:24:31,414 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-05 11:24:31,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 11:24:31,415 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:31,415 INFO L399 BasicCegarLoop]: trace histogram [115, 1, 1, 1] [2019-08-05 11:24:31,415 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:31,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:31,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1689816248, now seen corresponding path program 115 times [2019-08-05 11:24:31,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:31,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 11:24:31,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:35,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:24:35,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:35,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-08-05 11:24:35,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-08-05 11:24:35,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-08-05 11:24:35,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 11:24:35,888 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 118 states. [2019-08-05 11:24:36,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:36,218 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-05 11:24:36,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-08-05 11:24:36,219 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 118 [2019-08-05 11:24:36,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:36,219 INFO L225 Difference]: With dead ends: 122 [2019-08-05 11:24:36,220 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 11:24:36,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 11:24:36,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 11:24:36,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-08-05 11:24:36,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 11:24:36,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-05 11:24:36,222 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 118 [2019-08-05 11:24:36,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:36,223 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-05 11:24:36,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-08-05 11:24:36,223 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-05 11:24:36,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 11:24:36,223 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:36,223 INFO L399 BasicCegarLoop]: trace histogram [116, 1, 1, 1] [2019-08-05 11:24:36,224 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:36,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:36,224 INFO L82 PathProgramCache]: Analyzing trace with hash 844704768, now seen corresponding path program 116 times [2019-08-05 11:24:36,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:36,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 11:24:36,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:40,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:24:40,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:40,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2019-08-05 11:24:40,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-08-05 11:24:40,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-08-05 11:24:40,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 11:24:40,741 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 119 states. [2019-08-05 11:24:41,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:41,027 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-08-05 11:24:41,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-08-05 11:24:41,027 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 119 [2019-08-05 11:24:41,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:41,028 INFO L225 Difference]: With dead ends: 123 [2019-08-05 11:24:41,028 INFO L226 Difference]: Without dead ends: 123 [2019-08-05 11:24:41,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 11:24:41,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-08-05 11:24:41,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-08-05 11:24:41,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:24:41,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-08-05 11:24:41,031 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 119 [2019-08-05 11:24:41,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:41,031 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2019-08-05 11:24:41,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-08-05 11:24:41,031 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2019-08-05 11:24:41,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 11:24:41,031 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:41,031 INFO L399 BasicCegarLoop]: trace histogram [117, 1, 1, 1] [2019-08-05 11:24:41,032 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:41,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:41,032 INFO L82 PathProgramCache]: Analyzing trace with hash 416052664, now seen corresponding path program 117 times [2019-08-05 11:24:41,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:41,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 11:24:41,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:24:45,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:24:45,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:24:45,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2019-08-05 11:24:45,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-08-05 11:24:45,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-08-05 11:24:45,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 11:24:45,641 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 120 states. [2019-08-05 11:24:45,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:24:45,882 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-08-05 11:24:45,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-08-05 11:24:45,883 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 120 [2019-08-05 11:24:45,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:24:45,883 INFO L225 Difference]: With dead ends: 124 [2019-08-05 11:24:45,884 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 11:24:45,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 11:24:45,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 11:24:45,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-08-05 11:24:45,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 11:24:45,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-08-05 11:24:45,887 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 120 [2019-08-05 11:24:45,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:24:45,888 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-08-05 11:24:45,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-08-05 11:24:45,888 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-08-05 11:24:45,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 11:24:45,888 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:24:45,888 INFO L399 BasicCegarLoop]: trace histogram [118, 1, 1, 1] [2019-08-05 11:24:45,889 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:24:45,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:24:45,889 INFO L82 PathProgramCache]: Analyzing trace with hash 12739328, now seen corresponding path program 118 times [2019-08-05 11:24:45,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:24:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:24:45,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 11:24:45,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 11:24:47,632 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 11:24:47,632 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:24:47,636 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:24:47,636 INFO L202 PluginConnector]: Adding new model loopWithNondeterministicBranch.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:24:47 BoogieIcfgContainer [2019-08-05 11:24:47,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:24:47,639 INFO L168 Benchmark]: Toolchain (without parser) took 237298.19 ms. Allocated memory was 134.2 MB in the beginning and 863.5 MB in the end (delta: 729.3 MB). Free memory was 111.7 MB in the beginning and 808.4 MB in the end (delta: -696.7 MB). Peak memory consumption was 763.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:24:47,640 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 134.2 MB. Free memory was 112.9 MB in the beginning and 112.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:24:47,640 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.81 ms. Allocated memory is still 134.2 MB. Free memory was 111.7 MB in the beginning and 109.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:24:47,641 INFO L168 Benchmark]: Boogie Preprocessor took 27.69 ms. Allocated memory is still 134.2 MB. Free memory was 109.7 MB in the beginning and 108.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:24:47,641 INFO L168 Benchmark]: RCFGBuilder took 359.21 ms. Allocated memory is still 134.2 MB. Free memory was 108.6 MB in the beginning and 97.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:24:47,642 INFO L168 Benchmark]: TraceAbstraction took 236867.06 ms. Allocated memory was 134.2 MB in the beginning and 863.5 MB in the end (delta: 729.3 MB). Free memory was 97.7 MB in the beginning and 808.4 MB in the end (delta: -710.7 MB). Peak memory consumption was 749.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:24:47,645 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 134.2 MB. Free memory was 112.9 MB in the beginning and 112.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.81 ms. Allocated memory is still 134.2 MB. Free memory was 111.7 MB in the beginning and 109.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.69 ms. Allocated memory is still 134.2 MB. Free memory was 109.7 MB in the beginning and 108.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 359.21 ms. Allocated memory is still 134.2 MB. Free memory was 108.6 MB in the beginning and 97.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 236867.06 ms. Allocated memory was 134.2 MB in the beginning and 863.5 MB in the end (delta: 729.3 MB). Free memory was 97.7 MB in the beginning and 808.4 MB in the end (delta: -710.7 MB). Peak memory consumption was 749.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 19). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 118,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 122 with TraceHistMax 118,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 72 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. TIMEOUT Result, 236.8s OverallTime, 119 OverallIterations, 118 TraceHistogramMax, 17.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 591 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 14228 SolverSat, 229 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7139 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7021 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 212.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=118, 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, 118 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 215.3s InterpolantComputationTime, 7257 NumberOfCodeBlocks, 7257 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 7139 ConstructedInterpolants, 0 QuantifiedInterpolants, 1692179 SizeOfPredicates, 118 NumberOfNonLiveVariables, 28556 ConjunctsInSsa, 7139 ConjunctsInUnsatCore, 118 InterpolantComputations, 1 PerfectInterpolantSequences, 0/273819 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown