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/20170319-ConjunctivePathPrograms/const1.i_3.bplTransformedIcfg_BEv2_6.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:49:04,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:49:04,099 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:49:04,111 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:49:04,111 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:49:04,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:49:04,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:49:04,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:49:04,118 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:49:04,119 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:49:04,120 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:49:04,120 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:49:04,120 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:49:04,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:49:04,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:49:04,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:49:04,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:49:04,125 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:49:04,127 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:49:04,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:49:04,131 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:49:04,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:49:04,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:49:04,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:49:04,137 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:49:04,137 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:49:04,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:49:04,139 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:49:04,139 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:49:04,140 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:49:04,140 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:49:04,141 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:49:04,142 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:49:04,143 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:49:04,144 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:49:04,144 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:49:04,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:49:04,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:49:04,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:49:04,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:49:04,147 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:49:04,177 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:49:04,193 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:49:04,199 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:49:04,200 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:49:04,201 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:49:04,202 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/const1.i_3.bplTransformedIcfg_BEv2_6.bpl [2019-08-05 10:49:04,203 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/const1.i_3.bplTransformedIcfg_BEv2_6.bpl' [2019-08-05 10:49:04,238 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:49:04,241 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:49:04,241 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:49:04,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:49:04,242 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:49:04,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:04" (1/1) ... [2019-08-05 10:49:04,269 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:04" (1/1) ... [2019-08-05 10:49:04,277 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:49:04,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:49:04,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:49:04,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:49:04,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:04" (1/1) ... [2019-08-05 10:49:04,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:04" (1/1) ... [2019-08-05 10:49:04,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:04" (1/1) ... [2019-08-05 10:49:04,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:04" (1/1) ... [2019-08-05 10:49:04,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:04" (1/1) ... [2019-08-05 10:49:04,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:04" (1/1) ... [2019-08-05 10:49:04,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:04" (1/1) ... [2019-08-05 10:49:04,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:49:04,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:49:04,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:49:04,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:49:04,302 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:49:04,373 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:49:04,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:49:04,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:49:04,563 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:49:04,564 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:49:04,565 INFO L202 PluginConnector]: Adding new model const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:49:04 BoogieIcfgContainer [2019-08-05 10:49:04,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:49:04,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:49:04,567 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:49:04,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:49:04,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:04" (1/2) ... [2019-08-05 10:49:04,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73daf00a and model type const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:49:04, skipping insertion in model container [2019-08-05 10:49:04,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:49:04" (2/2) ... [2019-08-05 10:49:04,573 INFO L109 eAbstractionObserver]: Analyzing ICFG const1.i_3.bplTransformedIcfg_BEv2_6.bpl [2019-08-05 10:49:04,583 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:49:04,590 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:49:04,607 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:49:04,633 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:49:04,633 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:49:04,634 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:49:04,634 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:49:04,634 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:49:04,634 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:49:04,634 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:49:04,634 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:49:04,635 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:49:04,647 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:49:04,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:49:04,655 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:04,656 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:49:04,659 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:04,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:04,664 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:49:04,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:04,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:49:04,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:04,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:04,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:49:04,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:49:04,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:49:04,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:49:04,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:49:04,807 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:49:04,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:04,831 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:49:04,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:49:04,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:49:04,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:04,843 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:49:04,844 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:49:04,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:49:04,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:49:04,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:49:04,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:49:04,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:49:04,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:49:04,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:04,876 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:49:04,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:49:04,876 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:49:04,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:49:04,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:04,877 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:49:04,877 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:04,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:04,878 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:49:04,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:04,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:49:04,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:05,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:05,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:05,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:49:05,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:49:05,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:49:05,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:49:05,027 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:49:05,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:05,098 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:49:05,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:49:05,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:49:05,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:05,099 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:49:05,100 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:49:05,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:49:05,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:49:05,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:49:05,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:49:05,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:49:05,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:49:05,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:05,103 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:49:05,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:49:05,104 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:49:05,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:49:05,104 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:05,105 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:49:05,105 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:05,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:05,106 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:49:05,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:05,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:49:05,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:05,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:05,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:05,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:49:05,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:49:05,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:49:05,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:49:05,220 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:49:05,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:05,256 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:49:05,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:49:05,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:49:05,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:05,258 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:49:05,258 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:49:05,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:49:05,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:49:05,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:49:05,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:49:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:49:05,261 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:49:05,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:05,261 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:49:05,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:49:05,262 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:49:05,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:49:05,262 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:05,262 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:49:05,263 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:05,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:05,263 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:49:05,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:05,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:49:05,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:05,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:05,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:49:05,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:49:05,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:49:05,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:49:05,361 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:49:05,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:05,397 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:49:05,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:49:05,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:49:05,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:05,401 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:49:05,401 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:49:05,403 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 10:49:05,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:49:05,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:49:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:49:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:49:05,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:49:05,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:05,407 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:49:05,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:49:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:49:05,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:49:05,408 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:05,408 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:49:05,409 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:05,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:05,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:49:05,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:05,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:49:05,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:05,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:05,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:05,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:49:05,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:49:05,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:49:05,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:49:05,616 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:49:05,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:05,641 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:49:05,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:49:05,642 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:49:05,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:05,643 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:49:05,643 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:49:05,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:49:05,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:49:05,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:49:05,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:49:05,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:49:05,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:49:05,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:05,646 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:49:05,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:49:05,646 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:49:05,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:49:05,647 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:05,647 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:49:05,647 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:05,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:05,648 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:49:05,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:05,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:49:05,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:05,925 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:05,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:05,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:49:05,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:49:05,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:49:05,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:49:05,927 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:49:05,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:05,979 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:49:05,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:49:05,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:49:05,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:05,980 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:49:05,980 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:49:05,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:49:05,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:49:05,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:49:05,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:49:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:49:05,983 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:49:05,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:05,984 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:49:05,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:49:05,984 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:49:05,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:49:05,985 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:05,985 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:49:05,985 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:05,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:05,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:49:05,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:06,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:49:06,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:06,262 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:06,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:06,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:49:06,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:49:06,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:49:06,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:49:06,265 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:49:06,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:06,294 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:49:06,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:49:06,295 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:49:06,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:06,295 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:49:06,296 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:49:06,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:49:06,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:49:06,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:49:06,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:49:06,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:49:06,299 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:49:06,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:06,300 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:49:06,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:49:06,300 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:49:06,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:49:06,301 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:06,301 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:49:06,301 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:06,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:06,302 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:49:06,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:06,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:49:06,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:06,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:06,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:49:06,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:49:06,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:49:06,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:49:06,510 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:49:06,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:06,545 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:49:06,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:49:06,545 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:49:06,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:06,546 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:49:06,547 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:49:06,547 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 10:49:06,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:49:06,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:49:06,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:49:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:49:06,550 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:49:06,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:06,550 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:49:06,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:49:06,550 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:49:06,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:49:06,551 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:06,551 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:49:06,551 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:06,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:06,552 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:49:06,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:06,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:49:06,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:07,004 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:07,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:07,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:49:07,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:49:07,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:49:07,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:49:07,006 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:49:07,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:07,051 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:49:07,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:49:07,052 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:49:07,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:07,052 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:49:07,052 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:49:07,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:49:07,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:49:07,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:49:07,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:49:07,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:49:07,056 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:49:07,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:07,056 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:49:07,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:49:07,057 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:49:07,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:49:07,057 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:07,057 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:49:07,058 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:07,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:07,058 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:49:07,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:07,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:49:07,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:07,228 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:07,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:07,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:49:07,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:49:07,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:49:07,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:49:07,231 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:49:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:07,264 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:49:07,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:49:07,265 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:49:07,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:07,265 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:49:07,265 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:49:07,266 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 10:49:07,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:49:07,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:49:07,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:49:07,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:49:07,270 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:49:07,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:07,270 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:49:07,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:49:07,270 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:49:07,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:49:07,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:07,271 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:49:07,271 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:07,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:07,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:49:07,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:07,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:49:07,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:07,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:07,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:49:07,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:49:07,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:49:07,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:49:07,510 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:49:07,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:07,543 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:49:07,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:49:07,550 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:49:07,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:07,551 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:49:07,551 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:49:07,551 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 10:49:07,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:49:07,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:49:07,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:49:07,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:49:07,554 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:49:07,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:07,555 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:49:07,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:49:07,555 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:49:07,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:49:07,555 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:07,556 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:49:07,556 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:07,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:07,556 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:49:07,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:07,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:49:07,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:07,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:07,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:49:07,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:49:07,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:49:07,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:49:07,831 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:49:07,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:07,878 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:49:07,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:49:07,879 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:49:07,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:07,880 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:49:07,880 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:49:07,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:49:07,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:49:07,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:49:07,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:49:07,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:49:07,884 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:49:07,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:07,884 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:49:07,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:49:07,884 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:49:07,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:49:07,885 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:07,885 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:49:07,885 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:07,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:07,886 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:49:07,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:07,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:49:07,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:08,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:08,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:49:08,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:49:08,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:49:08,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:49:08,105 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:49:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:08,132 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:49:08,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:49:08,132 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:49:08,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:08,135 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:49:08,135 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:49:08,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:49:08,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:49:08,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:49:08,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:49:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:49:08,139 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:49:08,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:08,139 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:49:08,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:49:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:49:08,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:49:08,140 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:08,140 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:49:08,140 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:08,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:08,140 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:49:08,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:08,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:49:08,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:08,394 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:08,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:08,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:49:08,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:49:08,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:49:08,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:49:08,395 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:49:08,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:08,428 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:49:08,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:49:08,429 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:49:08,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:08,430 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:49:08,430 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:49:08,430 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 10:49:08,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:49:08,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:49:08,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:49:08,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:49:08,435 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:49:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:08,435 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:49:08,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:49:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:49:08,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:49:08,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:08,436 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:49:08,436 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:08,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:08,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:49:08,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:08,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:49:08,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:08,658 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:08,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:08,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:49:08,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:49:08,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:49:08,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:49:08,660 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:49:08,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:08,693 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:49:08,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:49:08,699 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:49:08,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:08,700 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:49:08,700 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:49:08,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:49:08,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:49:08,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:49:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:49:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:49:08,704 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:49:08,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:08,704 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:49:08,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:49:08,705 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:49:08,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:49:08,705 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:08,705 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:49:08,706 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:08,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:08,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:49:08,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:08,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:49:08,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:09,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:09,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:49:09,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:49:09,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:49:09,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:49:09,160 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:49:09,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:09,203 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:49:09,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:49:09,204 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:49:09,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:09,204 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:49:09,204 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:49:09,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:49:09,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:49:09,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:49:09,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:49:09,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:49:09,208 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:49:09,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:09,208 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:49:09,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:49:09,209 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:49:09,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:49:09,209 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:09,209 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:49:09,210 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:09,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:09,210 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:49:09,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:09,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:49:09,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:09,426 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:09,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:09,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:49:09,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:49:09,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:49:09,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:49:09,431 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:49:09,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:09,495 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:49:09,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:49:09,496 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:49:09,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:09,496 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:49:09,496 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:49:09,497 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 10:49:09,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:49:09,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:49:09,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:49:09,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:49:09,499 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:49:09,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:09,499 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:49:09,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:49:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:49:09,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:49:09,500 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:09,500 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:49:09,500 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:09,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:09,501 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 10:49:09,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:09,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:49:09,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:10,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:10,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:49:10,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:49:10,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:49:10,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:49:10,259 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:49:10,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:10,287 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:49:10,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:49:10,293 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:49:10,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:10,294 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:49:10,294 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:49:10,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:49:10,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:49:10,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:49:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:49:10,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:49:10,297 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:49:10,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:10,298 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:49:10,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:49:10,298 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:49:10,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:49:10,299 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:10,299 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:49:10,299 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:10,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:10,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 10:49:10,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:10,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:49:10,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:10,711 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:10,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:10,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:49:10,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:49:10,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:49:10,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:49:10,713 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:49:10,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:10,752 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:49:10,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:49:10,753 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:49:10,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:10,754 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:49:10,754 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:49:10,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:49:10,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:49:10,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:49:10,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:49:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:49:10,768 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:49:10,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:10,769 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:49:10,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:49:10,769 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:49:10,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:49:10,769 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:10,770 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:49:10,770 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:10,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:10,770 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 10:49:10,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:10,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:49:10,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:11,433 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:11,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:11,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:49:11,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:49:11,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:49:11,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:49:11,434 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:49:11,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:11,462 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:49:11,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:49:11,463 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:49:11,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:11,464 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:49:11,464 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:49:11,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:49:11,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:49:11,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:49:11,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:49:11,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:49:11,468 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:49:11,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:11,468 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:49:11,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:49:11,468 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:49:11,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:49:11,469 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:11,469 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:49:11,469 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:11,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:11,470 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 10:49:11,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:11,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:49:11,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:11,831 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:11,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:11,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:49:11,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:49:11,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:49:11,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:49:11,833 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:49:11,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:11,864 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:49:11,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:49:11,865 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:49:11,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:11,866 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:49:11,866 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:49:11,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:49:11,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:49:11,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:49:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:49:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:49:11,869 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:49:11,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:11,869 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:49:11,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:49:11,870 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:49:11,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:49:11,870 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:11,870 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:49:11,871 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:11,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:11,871 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-05 10:49:11,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:11,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:49:11,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:12,284 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:12,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:12,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:49:12,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:49:12,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:49:12,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:49:12,286 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:49:12,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:12,358 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:49:12,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:49:12,361 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:49:12,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:12,362 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:49:12,362 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:49:12,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:49:12,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:49:12,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:49:12,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:49:12,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:49:12,365 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:49:12,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:12,365 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:49:12,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:49:12,365 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:49:12,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:49:12,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:12,366 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:49:12,367 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:12,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:12,368 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-05 10:49:12,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:12,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:49:12,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:12,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:12,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:49:12,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:49:12,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:49:12,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:49:12,863 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:49:12,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:12,893 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:49:12,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:49:12,894 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:49:12,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:12,894 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:49:12,894 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:49:12,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:49:12,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:49:12,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:49:12,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:49:12,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:49:12,898 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:49:12,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:12,898 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:49:12,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:49:12,899 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:49:12,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:49:12,899 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:12,899 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:49:12,900 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:12,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:12,900 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-05 10:49:12,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:12,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:49:12,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:13,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:13,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:49:13,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:49:13,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:49:13,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:49:13,223 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:49:13,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:13,282 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:49:13,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:49:13,282 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:49:13,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:13,283 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:49:13,283 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:49:13,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:49:13,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:49:13,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:49:13,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:49:13,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:49:13,287 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:49:13,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:13,287 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:49:13,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:49:13,288 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:49:13,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:49:13,288 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:13,288 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:49:13,289 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:13,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:13,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-05 10:49:13,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:13,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:49:13,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:13,888 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:13,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:13,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:49:13,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:49:13,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:49:13,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:49:13,890 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:49:13,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:13,937 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:49:13,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:49:13,938 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:49:13,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:13,938 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:49:13,939 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:49:13,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:49:13,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:49:13,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:49:13,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:49:13,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:49:13,943 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:49:13,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:13,943 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:49:13,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:49:13,943 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:49:13,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:49:13,944 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:13,944 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:49:13,944 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:13,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:13,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-05 10:49:13,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:13,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:49:13,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:14,407 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:14,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:14,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:49:14,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:49:14,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:49:14,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:49:14,409 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:49:14,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:14,502 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:49:14,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:49:14,503 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:49:14,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:14,503 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:49:14,503 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:49:14,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:49:14,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:49:14,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:49:14,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:49:14,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:49:14,506 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:49:14,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:14,506 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:49:14,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:49:14,506 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:49:14,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:49:14,507 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:14,507 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:49:14,508 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:14,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:14,508 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-05 10:49:14,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:14,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:49:14,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:15,146 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:15,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:15,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:49:15,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:49:15,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:49:15,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:49:15,148 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:49:15,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:15,229 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:49:15,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:49:15,229 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:49:15,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:15,230 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:49:15,230 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:49:15,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:49:15,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:49:15,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:49:15,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:49:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:49:15,233 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:49:15,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:15,233 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:49:15,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:49:15,233 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:49:15,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:49:15,234 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:15,234 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:49:15,234 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:15,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:15,235 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-05 10:49:15,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:15,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:49:15,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:15,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:15,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:49:15,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:49:15,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:49:15,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:49:15,681 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:49:15,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:15,737 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:49:15,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:49:15,737 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:49:15,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:15,737 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:49:15,738 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:49:15,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:49:15,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:49:15,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:49:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:49:15,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:49:15,741 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:49:15,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:15,742 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:49:15,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:49:15,742 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:49:15,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:49:15,742 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:15,743 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:49:15,743 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:15,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:15,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-05 10:49:15,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:15,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:49:15,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:16,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:16,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:49:16,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:49:16,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:49:16,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:49:16,118 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:49:16,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:16,208 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:49:16,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:49:16,208 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:49:16,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:16,209 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:49:16,209 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:49:16,209 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 10:49:16,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:49:16,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:49:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:49:16,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:49:16,211 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:49:16,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:16,212 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:49:16,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:49:16,212 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:49:16,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:49:16,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:16,213 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:49:16,213 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:16,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:16,213 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-05 10:49:16,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:16,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:49:16,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:17,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:17,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:49:17,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:49:17,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:49:17,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:49:17,008 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:49:17,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:17,153 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:49:17,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:49:17,153 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:49:17,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:17,154 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:49:17,154 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:49:17,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:49:17,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:49:17,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:49:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:49:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:49:17,158 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:49:17,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:17,159 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:49:17,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:49:17,159 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:49:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:49:17,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:17,160 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:49:17,160 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:17,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:17,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-05 10:49:17,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:17,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:49:17,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:17,744 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:17,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:17,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:49:17,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:49:17,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:49:17,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:49:17,746 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:49:17,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:17,798 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:49:17,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:49:17,798 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:49:17,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:17,798 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:49:17,798 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:49:17,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:49:17,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:49:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:49:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:49:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:49:17,804 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:49:17,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:17,804 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:49:17,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:49:17,804 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:49:17,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:49:17,805 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:17,805 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:49:17,806 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:17,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:17,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-05 10:49:17,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:17,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:49:17,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:18,442 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:18,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:18,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:49:18,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:49:18,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:49:18,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:49:18,444 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:49:18,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:18,493 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:49:18,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:49:18,494 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:49:18,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:18,495 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:49:18,495 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:49:18,496 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:49:18,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:49:18,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:49:18,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:49:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:49:18,499 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:49:18,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:18,499 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:49:18,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:49:18,499 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:49:18,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:49:18,500 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:18,500 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:49:18,500 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:18,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:18,500 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-05 10:49:18,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:18,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:49:18,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:18,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:18,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:49:18,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:49:18,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:49:18,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:49:18,947 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:49:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:18,994 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:49:18,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:49:18,995 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:49:18,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:18,995 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:49:18,995 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:49:18,997 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 10:49:18,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:49:18,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:49:18,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:49:19,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:49:19,000 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:49:19,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:19,000 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:49:19,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:49:19,000 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:49:19,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:49:19,001 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:19,001 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:49:19,001 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:19,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:19,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-05 10:49:19,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:19,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:49:19,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:19,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:19,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:49:19,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:49:19,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:49:19,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:49:19,550 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:49:19,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:19,603 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:49:19,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:49:19,604 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:49:19,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:19,604 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:49:19,604 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:49:19,605 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 10:49:19,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:49:19,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:49:19,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:49:19,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:49:19,607 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:49:19,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:19,608 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:49:19,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:49:19,608 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:49:19,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:49:19,608 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:19,608 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:49:19,609 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:19,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:19,609 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-05 10:49:19,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:19,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:49:19,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:20,327 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:20,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:20,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:49:20,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:49:20,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:49:20,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:49:20,328 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:49:20,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:20,368 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:49:20,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:49:20,368 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:49:20,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:20,369 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:49:20,369 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:49:20,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:49:20,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:49:20,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:49:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:49:20,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:49:20,373 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:49:20,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:20,373 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:49:20,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:49:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:49:20,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:49:20,374 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:20,374 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:49:20,375 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:20,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:20,375 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-05 10:49:20,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:20,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:49:20,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:20,946 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:20,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:20,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:49:20,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:49:20,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:49:20,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:49:20,948 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:49:21,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:21,039 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:49:21,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:49:21,039 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:49:21,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:21,040 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:49:21,040 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:49:21,041 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 10:49:21,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:49:21,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:49:21,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:49:21,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:49:21,044 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:49:21,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:21,044 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:49:21,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:49:21,044 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:49:21,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:49:21,045 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:21,045 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:49:21,045 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:21,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:21,045 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-05 10:49:21,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:21,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:49:21,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:22,313 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:22,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:22,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:49:22,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:49:22,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:49:22,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:49:22,315 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:49:22,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:22,403 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:49:22,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:49:22,404 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:49:22,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:22,404 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:49:22,404 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:49:22,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:49:22,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:49:22,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:49:22,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:49:22,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:49:22,406 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:49:22,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:22,407 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:49:22,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:49:22,407 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:49:22,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:49:22,407 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:22,407 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:49:22,408 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:22,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:22,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-05 10:49:22,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:22,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:49:22,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:23,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:23,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:49:23,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:49:23,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:49:23,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:49:23,139 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:49:23,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:23,222 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:49:23,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:49:23,222 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:49:23,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:23,223 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:49:23,223 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:49:23,224 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 10:49:23,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:49:23,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:49:23,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:49:23,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:49:23,226 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:49:23,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:23,226 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:49:23,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:49:23,227 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:49:23,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:49:23,227 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:23,227 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:49:23,228 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:23,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:23,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-05 10:49:23,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:23,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:49:23,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:23,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:23,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:49:23,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:49:23,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:49:23,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:49:23,901 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:49:23,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:23,951 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:49:23,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:49:23,951 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:49:23,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:23,952 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:49:23,952 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:49:23,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:49:23,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:49:23,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:49:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:49:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:49:23,956 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:49:23,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:23,956 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:49:23,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:49:23,957 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:49:23,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:49:23,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:23,957 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:49:23,957 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:23,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:23,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-05 10:49:23,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:23,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:49:23,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:24,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:24,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:49:24,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:49:24,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:49:24,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:49:24,783 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:49:24,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:24,859 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:49:24,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:49:24,860 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:49:24,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:24,860 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:49:24,860 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:49:24,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:49:24,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:49:24,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:49:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:49:24,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:49:24,864 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:49:24,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:24,864 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:49:24,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:49:24,864 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:49:24,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:49:24,865 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:24,865 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:49:24,865 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:24,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:24,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-05 10:49:24,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:24,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:49:24,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:25,586 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:25,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:25,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:49:25,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:49:25,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:49:25,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:49:25,588 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:49:25,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:25,657 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:49:25,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:49:25,657 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:49:25,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:25,658 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:49:25,658 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:49:25,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:49:25,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:49:25,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:49:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:49:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:49:25,661 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:49:25,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:25,661 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:49:25,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:49:25,661 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:49:25,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:49:25,662 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:25,662 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:49:25,662 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:25,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:25,662 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-05 10:49:25,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:25,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:49:25,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:26,666 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:26,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:26,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:49:26,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:49:26,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:49:26,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:49:26,668 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:49:26,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:26,773 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:49:26,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:49:26,773 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:49:26,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:26,773 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:49:26,773 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:49:26,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:49:26,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:49:26,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:49:26,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:49:26,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:49:26,775 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:49:26,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:26,776 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:49:26,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:49:26,776 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:49:26,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:49:26,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:26,777 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:49:26,777 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:26,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:26,777 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-05 10:49:26,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:26,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:49:26,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:27,535 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:27,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:27,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:49:27,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:49:27,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:49:27,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:49:27,537 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:49:27,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:27,590 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:49:27,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:49:27,590 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:49:27,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:27,591 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:49:27,591 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:49:27,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:49:27,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:49:27,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:49:27,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:49:27,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:49:27,594 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:49:27,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:27,595 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:49:27,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:49:27,595 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:49:27,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:49:27,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:27,595 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:49:27,595 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:27,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:27,596 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-05 10:49:27,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:27,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:49:27,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:28,386 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:28,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:28,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:49:28,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:49:28,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:49:28,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:49:28,388 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:49:28,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:28,489 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:49:28,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:49:28,490 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:49:28,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:28,490 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:49:28,491 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:49:28,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:49:28,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:49:28,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:49:28,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:49:28,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:49:28,493 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:49:28,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:28,493 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:49:28,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:49:28,494 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:49:28,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:49:28,494 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:28,494 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:49:28,494 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:28,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:28,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-05 10:49:28,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:28,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:49:28,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:29,350 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:29,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:29,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:49:29,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:49:29,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:49:29,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:49:29,351 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:49:29,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:29,422 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:49:29,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:49:29,423 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:49:29,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:29,424 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:49:29,424 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:49:29,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:49:29,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:49:29,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:49:29,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:49:29,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:49:29,427 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:49:29,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:29,428 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:49:29,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:49:29,428 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:49:29,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:49:29,428 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:29,429 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:49:29,429 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:29,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:29,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-05 10:49:29,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:29,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:49:29,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:30,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:30,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:30,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:49:30,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:49:30,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:49:30,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:49:30,621 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:49:31,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:31,001 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:49:31,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:49:31,001 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:49:31,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:31,002 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:49:31,002 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:49:31,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:49:31,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:49:31,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:49:31,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:49:31,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:49:31,003 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:49:31,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:31,004 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:49:31,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:49:31,004 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:49:31,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:49:31,005 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:31,005 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:49:31,005 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:31,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:31,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-05 10:49:31,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:31,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:49:31,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:32,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:32,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:49:32,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:49:32,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:49:32,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:49:32,172 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:49:32,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:32,240 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:49:32,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:49:32,240 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:49:32,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:32,241 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:49:32,241 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:49:32,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:49:32,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:49:32,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:49:32,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:49:32,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:49:32,243 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:49:32,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:32,244 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:49:32,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:49:32,244 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:49:32,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:49:32,245 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:32,245 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:49:32,245 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:32,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:32,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-05 10:49:32,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:32,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:49:32,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:33,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:33,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:33,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:49:33,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:49:33,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:49:33,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:49:33,125 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:49:33,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:33,184 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:49:33,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:49:33,184 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:49:33,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:33,185 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:49:33,185 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:49:33,186 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 10:49:33,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:49:33,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:49:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:49:33,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:49:33,188 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:49:33,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:33,188 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:49:33,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:49:33,188 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:49:33,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:49:33,189 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:33,189 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:49:33,189 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:33,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:33,189 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-05 10:49:33,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:33,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:49:33,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:34,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:34,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:49:34,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:49:34,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:49:34,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:49:34,285 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:49:34,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:34,355 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:49:34,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:49:34,355 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:49:34,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:34,356 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:49:34,356 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:49:34,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:49:34,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:49:34,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:49:34,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:49:34,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:49:34,362 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:49:34,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:34,362 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:49:34,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:49:34,363 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:49:34,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:49:34,363 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:34,363 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:49:34,363 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:34,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:34,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-05 10:49:34,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:34,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:49:34,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:36,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:36,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:36,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:49:36,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:49:36,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:49:36,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:49:36,265 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:49:36,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:36,326 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:49:36,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:49:36,326 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:49:36,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:36,326 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:49:36,327 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:49:36,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:49:36,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:49:36,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:49:36,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:49:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:49:36,329 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:49:36,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:36,329 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:49:36,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:49:36,330 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:49:36,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:49:36,330 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:36,330 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:49:36,331 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:36,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:36,331 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-05 10:49:36,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:36,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:49:36,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:37,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:37,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:37,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:49:37,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:49:37,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:49:37,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:49:37,820 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:49:37,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:37,894 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:49:37,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:49:37,895 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:49:37,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:37,896 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:49:37,896 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:49:37,897 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 10:49:37,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:49:37,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:49:37,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:49:37,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:49:37,899 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:49:37,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:37,900 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:49:37,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:49:37,900 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:49:37,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:49:37,900 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:37,900 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:49:37,900 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:37,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:37,901 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-05 10:49:37,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:37,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:49:37,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:39,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:39,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:39,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:49:39,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:49:39,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:49:39,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:49:39,218 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:49:39,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:39,325 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:49:39,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:49:39,326 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:49:39,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:39,327 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:49:39,327 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:49:39,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:49:39,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:49:39,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:49:39,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:49:39,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:49:39,329 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:49:39,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:39,329 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:49:39,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:49:39,330 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:49:39,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:49:39,330 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:39,330 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:49:39,331 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:39,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:39,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-05 10:49:39,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:39,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:49:39,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:40,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:40,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:40,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:49:40,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:49:40,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:49:40,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:49:40,903 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:49:40,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:40,976 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:49:40,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:49:40,976 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:49:40,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:40,976 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:49:40,977 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:49:40,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:49:40,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:49:40,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:49:40,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:49:40,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:49:40,979 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:49:40,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:40,979 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:49:40,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:49:40,980 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:49:40,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:49:40,980 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:40,980 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:49:40,981 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:40,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:40,981 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-05 10:49:40,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:40,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:49:40,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:42,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:42,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:42,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:49:42,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:49:42,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:49:42,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:49:42,309 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:49:42,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:42,377 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:49:42,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:49:42,378 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:49:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:42,379 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:49:42,379 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:49:42,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:49:42,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:49:42,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:49:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:49:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:49:42,381 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:49:42,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:42,381 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:49:42,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:49:42,381 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:49:42,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:49:42,382 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:42,382 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:49:42,382 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:42,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:42,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-05 10:49:42,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:42,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:49:42,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:43,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:43,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:43,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:49:43,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:49:43,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:49:43,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:49:43,633 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:49:43,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:43,706 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:49:43,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:49:43,706 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:49:43,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:43,707 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:49:43,707 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:49:43,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:49:43,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:49:43,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:49:43,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:49:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:49:43,710 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:49:43,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:43,710 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:49:43,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:49:43,710 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:49:43,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:49:43,711 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:43,711 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:49:43,711 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:43,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:43,711 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-05 10:49:43,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:43,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:49:43,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:45,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:45,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:45,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:49:45,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:49:45,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:49:45,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:49:45,342 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:49:45,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:45,414 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:49:45,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:49:45,415 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:49:45,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:45,415 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:49:45,415 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:49:45,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:49:45,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:49:45,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:49:45,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:49:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:49:45,418 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:49:45,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:45,418 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:49:45,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:49:45,418 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:49:45,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:49:45,418 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:45,419 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:49:45,419 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:45,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:45,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-05 10:49:45,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:45,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:49:45,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:46,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:46,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:46,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:49:46,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:49:46,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:49:46,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:49:46,596 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:49:46,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:46,667 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:49:46,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:49:46,668 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:49:46,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:46,669 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:49:46,669 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:49:46,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:49:46,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:49:46,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:49:46,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:49:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:49:46,671 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:49:46,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:46,672 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:49:46,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:49:46,672 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:49:46,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:49:46,672 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:46,673 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:49:46,673 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:46,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:46,673 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-05 10:49:46,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:46,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:49:46,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:48,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:48,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:49:48,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:49:48,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:49:48,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:49:48,255 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:49:48,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:48,323 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:49:48,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:49:48,323 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:49:48,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:48,324 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:49:48,324 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:49:48,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:49:48,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:49:48,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:49:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:49:48,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:49:48,327 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:49:48,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:48,327 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:49:48,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:49:48,327 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:49:48,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:49:48,328 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:48,328 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:49:48,328 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:48,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:48,328 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-05 10:49:48,329 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:48,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:49:48,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:49,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:49,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:49:49,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:49:49,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:49:49,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:49:49,740 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:49:49,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:49,805 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:49:49,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:49:49,806 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:49:49,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:49,806 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:49:49,807 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:49:49,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:49:49,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:49:49,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:49:49,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:49:49,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:49:49,809 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:49:49,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:49,809 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:49:49,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:49:49,809 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:49:49,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:49:49,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:49,810 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:49:49,810 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:49,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:49,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-05 10:49:49,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:49,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:49:49,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:51,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:51,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:51,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:49:51,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:49:51,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:49:51,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:49:51,220 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:49:51,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:51,310 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:49:51,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:49:51,310 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:49:51,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:51,311 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:49:51,311 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:49:51,312 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 10:49:51,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:49:51,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:49:51,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:49:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:49:51,314 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:49:51,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:51,314 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:49:51,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:49:51,314 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:49:51,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:49:51,315 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:51,315 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:49:51,315 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:51,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:51,315 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-05 10:49:51,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:51,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:49:51,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:53,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:53,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:49:53,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:49:53,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:49:53,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:49:53,101 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:49:53,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:53,189 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:49:53,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:49:53,189 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:49:53,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:53,190 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:49:53,190 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:49:53,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:49:53,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:49:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:49:53,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:49:53,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:49:53,192 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:49:53,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:53,192 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:49:53,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:49:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:49:53,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:49:53,192 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:53,193 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:49:53,193 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:53,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:53,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-05 10:49:53,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:53,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:49:53,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:54,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:54,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:49:54,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:49:54,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:49:54,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:49:54,592 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:49:54,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:54,692 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:49:54,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:49:54,693 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:49:54,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:54,693 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:49:54,693 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:49:54,694 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 10:49:54,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:49:54,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:49:54,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:49:54,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:49:54,695 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:49:54,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:54,695 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:49:54,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:49:54,695 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:49:54,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:49:54,696 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:54,696 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:49:54,696 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:54,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:54,696 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-05 10:49:54,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:54,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:49:54,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:56,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:56,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:56,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:49:56,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:49:56,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:49:56,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:49:56,137 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:49:56,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:56,226 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:49:56,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:49:56,226 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:49:56,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:56,227 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:49:56,227 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:49:56,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:49:56,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:49:56,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:49:56,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:49:56,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:49:56,230 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:49:56,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:56,231 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:49:56,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:49:56,231 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:49:56,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:49:56,231 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:56,231 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:49:56,232 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:56,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:56,232 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-05 10:49:56,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:56,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:49:56,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:57,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:57,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:49:57,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:49:57,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:49:57,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:49:57,877 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:49:57,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:57,973 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:49:57,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:49:57,975 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:49:57,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:57,975 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:49:57,975 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:49:57,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:49:57,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:49:57,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:49:57,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:49:57,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:49:57,978 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:49:57,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:57,978 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:49:57,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:49:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:49:57,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:49:57,978 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:57,979 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:49:57,979 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:57,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:57,979 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-05 10:49:57,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:57,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:49:57,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:59,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:59,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:59,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:49:59,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:49:59,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:49:59,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:49:59,633 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:49:59,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:59,708 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:49:59,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:49:59,709 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:49:59,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:59,709 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:49:59,710 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:49:59,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:49:59,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:49:59,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:49:59,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:49:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:49:59,712 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:49:59,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:59,713 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:49:59,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:49:59,713 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:49:59,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:49:59,713 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:59,713 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:49:59,713 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:59,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:59,714 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-05 10:49:59,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:59,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:49:59,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:01,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:01,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:50:01,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:50:01,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:50:01,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:50:01,334 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:50:01,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:01,413 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:50:01,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:50:01,413 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:50:01,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:01,414 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:50:01,414 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:50:01,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:50:01,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:50:01,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:50:01,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:50:01,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:50:01,417 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:50:01,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:01,417 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:50:01,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:50:01,417 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:50:01,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:50:01,417 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:01,417 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:50:01,418 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:01,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:01,418 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-05 10:50:01,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:01,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:50:01,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:03,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:03,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:50:03,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:50:03,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:50:03,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:50:03,227 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:50:03,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:03,312 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:50:03,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:50:03,313 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:50:03,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:03,314 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:50:03,314 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:50:03,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:50:03,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:50:03,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:50:03,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:50:03,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:50:03,316 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:50:03,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:03,317 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:50:03,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:50:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:50:03,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:50:03,318 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:03,318 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:50:03,318 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:03,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:03,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-05 10:50:03,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:03,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:50:03,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:04,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:04,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:04,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:50:04,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:50:04,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:50:04,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:50:04,911 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:50:05,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:05,002 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:50:05,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:50:05,003 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:50:05,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:05,004 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:50:05,004 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:50:05,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:50:05,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:50:05,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:50:05,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:50:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:50:05,007 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:50:05,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:05,007 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:50:05,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:50:05,007 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:50:05,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:50:05,008 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:05,008 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:50:05,008 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:05,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:05,008 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-05 10:50:05,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:05,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:50:05,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:06,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:06,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:06,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:50:06,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:50:06,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:50:06,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:50:06,805 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:50:06,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:06,886 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:50:06,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:50:06,886 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:50:06,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:06,887 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:50:06,887 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:50:06,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:50:06,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:50:06,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:50:06,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:50:06,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:50:06,889 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:50:06,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:06,890 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:50:06,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:50:06,890 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:50:06,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:50:06,890 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:06,890 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:50:06,891 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:06,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:06,891 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-05 10:50:06,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:06,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:50:06,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:09,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:09,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:50:09,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:50:09,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:50:09,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:50:09,115 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:50:09,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:09,210 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:50:09,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:50:09,211 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:50:09,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:09,212 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:50:09,212 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:50:09,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:50:09,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:50:09,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:50:09,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:50:09,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:50:09,215 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:50:09,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:09,216 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:50:09,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:50:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:50:09,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:50:09,216 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:09,216 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:50:09,217 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:09,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:09,217 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-05 10:50:09,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:09,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:50:09,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:11,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:11,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:11,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:50:11,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:50:11,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:50:11,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:50:11,046 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:50:11,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:11,172 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:50:11,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:50:11,172 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:50:11,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:11,173 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:50:11,173 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:50:11,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:50:11,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:50:11,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:50:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:50:11,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:50:11,176 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:50:11,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:11,177 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:50:11,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:50:11,177 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:50:11,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:50:11,178 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:11,178 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:50:11,178 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:11,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:11,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-05 10:50:11,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:11,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:50:11,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:13,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:13,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:13,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:50:13,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:50:13,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:50:13,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:50:13,717 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:50:13,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:13,805 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:50:13,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:50:13,806 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:50:13,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:13,806 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:50:13,807 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:50:13,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:50:13,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:50:13,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:50:13,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:50:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:50:13,810 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:50:13,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:13,810 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:50:13,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:50:13,810 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:50:13,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:50:13,811 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:13,811 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:50:13,811 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:13,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:13,811 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-05 10:50:13,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:13,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:50:13,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:15,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:15,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:15,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:50:15,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:50:15,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:50:15,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:50:15,785 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:50:15,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:15,888 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:50:15,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:50:15,892 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:50:15,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:15,893 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:50:15,893 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:50:15,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:50:15,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:50:15,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:50:15,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:50:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:50:15,895 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:50:15,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:15,896 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:50:15,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:50:15,896 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:50:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:50:15,897 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:15,897 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:50:15,897 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:15,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:15,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-05 10:50:15,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:15,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:50:15,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:18,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:18,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:18,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:50:18,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:50:18,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:50:18,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:50:18,157 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:50:18,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:18,282 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:50:18,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:50:18,282 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:50:18,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:18,283 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:50:18,283 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:50:18,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:50:18,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:50:18,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:50:18,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:50:18,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:50:18,285 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:50:18,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:18,285 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:50:18,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:50:18,286 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:50:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:50:18,286 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:18,286 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:50:18,286 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:18,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:18,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-05 10:50:18,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:18,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:50:18,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:21,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:21,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:21,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:50:21,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:50:21,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:50:21,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:50:21,737 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:50:21,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:21,830 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:50:21,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:50:21,830 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:50:21,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:21,831 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:50:21,831 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:50:21,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:50:21,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:50:21,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:50:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:50:21,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:50:21,834 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:50:21,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:21,835 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:50:21,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:50:21,835 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:50:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:50:21,835 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:21,835 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:50:21,836 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:21,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:21,836 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-05 10:50:21,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:21,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:50:21,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:24,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:24,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:24,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:50:24,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:50:24,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:50:24,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:50:24,726 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:50:24,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:24,823 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:50:24,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:50:24,823 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:50:24,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:24,824 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:50:24,824 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:50:24,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:50:24,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:50:24,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:50:24,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:50:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:50:24,827 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:50:24,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:24,827 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:50:24,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:50:24,827 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:50:24,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:50:24,827 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:24,828 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:50:24,828 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:24,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:24,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-05 10:50:24,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:24,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:50:24,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:26,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:26,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:50:26,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:50:26,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:50:26,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:50:26,886 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:50:26,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:26,989 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:50:26,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:50:26,989 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:50:26,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:26,990 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:50:26,990 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:50:26,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:50:26,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:50:26,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:50:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:50:26,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:50:26,993 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:50:26,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:26,994 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:50:26,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:50:26,994 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:50:26,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:50:26,994 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:26,994 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:50:26,995 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:26,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:26,995 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-05 10:50:26,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:27,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:50:27,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:29,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:29,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:29,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:50:29,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:50:29,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:50:29,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:50:29,393 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:50:29,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:29,728 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:50:29,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:50:29,728 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:50:29,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:29,729 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:50:29,729 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:50:29,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:50:29,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:50:29,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:50:29,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:50:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:50:29,732 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:50:29,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:29,733 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:50:29,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:50:29,733 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:50:29,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:50:29,734 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:29,734 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:50:29,734 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:29,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:29,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-08-05 10:50:29,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:29,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:50:29,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:31,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:31,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:31,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:50:31,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:50:31,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:50:31,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:50:31,930 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:50:32,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:32,094 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:50:32,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:50:32,095 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:50:32,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:32,096 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:50:32,096 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:50:32,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:50:32,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:50:32,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:50:32,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:50:32,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:50:32,098 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:50:32,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:32,098 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:50:32,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:50:32,099 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:50:32,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:50:32,099 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:32,099 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:50:32,099 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:32,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:32,100 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-08-05 10:50:32,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:32,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:50:32,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:34,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:34,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:34,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:50:34,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:50:34,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:50:34,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:50:34,777 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:50:34,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:34,907 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:50:34,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:50:34,908 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:50:34,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:34,909 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:50:34,909 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:50:34,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:50:34,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:50:34,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:50:34,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:50:34,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:50:34,910 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:50:34,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:34,911 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:50:34,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:50:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:50:34,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:50:34,911 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:34,911 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:50:34,911 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:34,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:34,912 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-08-05 10:50:34,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:34,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:50:34,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:37,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:37,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:37,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:50:37,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:50:37,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:50:37,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:50:37,164 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:50:37,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:37,272 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:50:37,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:50:37,272 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:50:37,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:37,273 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:50:37,273 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:50:37,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:50:37,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:50:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:50:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:50:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:50:37,276 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:50:37,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:37,276 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:50:37,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:50:37,276 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:50:37,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:50:37,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:37,277 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:50:37,277 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:37,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:37,277 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-08-05 10:50:37,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:37,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:50:37,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:40,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:40,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:40,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:50:40,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:50:40,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:50:40,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:50:40,086 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 10:50:40,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:40,347 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:50:40,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:50:40,348 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:50:40,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:40,349 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:50:40,349 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:50:40,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:50:40,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:50:40,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:50:40,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:50:40,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:50:40,351 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:50:40,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:40,352 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:50:40,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:50:40,352 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:50:40,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:50:40,352 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:40,353 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 10:50:40,353 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:40,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:40,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-08-05 10:50:40,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:40,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:50:40,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:42,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:42,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:50:42,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:50:42,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:50:42,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:50:42,876 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-08-05 10:50:42,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:42,985 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:50:42,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:50:42,985 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-05 10:50:42,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:42,986 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:50:42,986 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:50:42,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:50:42,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:50:42,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:50:42,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:50:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:50:42,988 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 10:50:42,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:42,989 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:50:42,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:50:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:50:42,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:50:42,991 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:42,991 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-05 10:50:42,991 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:42,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:42,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-08-05 10:50:42,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:43,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:50:43,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:45,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:45,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:45,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:50:45,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:50:45,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:50:45,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:50:45,691 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-08-05 10:50:45,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:45,907 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:50:45,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:50:45,908 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-05 10:50:45,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:45,908 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:50:45,908 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:50:45,909 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 10:50:45,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:50:45,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:50:45,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:50:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:50:45,911 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-05 10:50:45,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:45,911 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:50:45,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:50:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:50:45,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:50:45,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:45,912 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-05 10:50:45,912 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:45,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:45,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-08-05 10:50:45,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:45,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:50:45,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:48,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:48,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:48,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:50:48,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:50:48,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:50:48,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:50:48,606 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-08-05 10:50:48,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:48,721 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:50:48,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:50:48,721 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-05 10:50:48,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:48,722 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:50:48,722 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:50:48,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:50:48,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:50:48,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:50:48,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:50:48,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:50:48,725 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-05 10:50:48,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:48,725 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:50:48,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:50:48,726 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:50:48,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:50:48,726 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:48,727 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-05 10:50:48,727 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:48,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:48,727 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-08-05 10:50:48,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:48,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:50:48,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:51,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:51,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:51,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:50:51,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:50:51,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:50:51,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:50:51,286 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-08-05 10:50:51,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:51,492 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:50:51,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:50:51,493 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-05 10:50:51,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:51,494 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:50:51,494 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:50:51,495 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 10:50:51,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:50:51,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:50:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:50:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:50:51,497 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-05 10:50:51,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:51,497 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:50:51,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:50:51,498 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:50:51,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:50:51,498 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:51,498 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-05 10:50:51,498 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:51,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:51,498 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-08-05 10:50:51,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:51,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:50:51,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:54,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:54,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:54,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:50:54,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:50:54,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:50:54,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:50:54,420 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-08-05 10:50:54,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:54,545 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 10:50:54,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:50:54,545 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-08-05 10:50:54,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:54,546 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:50:54,546 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:50:54,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:50:54,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:50:54,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:50:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:50:54,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:50:54,548 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-05 10:50:54,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:54,548 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:50:54,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:50:54,548 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:50:54,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:50:54,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:54,549 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-08-05 10:50:54,549 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:54,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:54,549 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-08-05 10:50:54,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:54,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:50:54,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:57,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:50:57,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:57,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:50:57,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:50:57,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:50:57,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:50:57,226 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-08-05 10:50:57,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:57,332 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:50:57,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:50:57,332 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-08-05 10:50:57,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:57,333 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:50:57,333 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:50:57,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:50:57,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:50:57,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:50:57,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:50:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:50:57,336 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-05 10:50:57,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:57,336 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:50:57,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:50:57,336 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:50:57,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:50:57,337 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:57,337 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-05 10:50:57,337 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:57,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:57,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-08-05 10:50:57,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:57,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:50:57,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:00,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:00,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:00,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:51:00,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:51:00,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:51:00,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:51:00,391 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-08-05 10:51:00,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:00,508 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 10:51:00,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:51:00,509 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-05 10:51:00,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:00,509 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:51:00,510 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:51:00,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:51:00,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:51:00,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:51:00,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:51:00,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:51:00,512 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-05 10:51:00,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:00,512 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:51:00,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:51:00,513 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:51:00,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:51:00,513 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:00,514 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-08-05 10:51:00,514 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:00,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:00,514 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-08-05 10:51:00,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:00,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:51:00,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:03,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:03,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:03,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:51:03,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:51:03,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:51:03,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:51:03,396 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-08-05 10:51:04,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:04,049 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:51:04,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:51:04,050 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-05 10:51:04,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:04,051 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:51:04,051 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:51:04,051 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 10:51:04,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:51:04,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:51:04,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:51:04,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 10:51:04,053 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-05 10:51:04,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:04,054 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 10:51:04,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:51:04,054 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 10:51:04,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:51:04,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:04,055 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-08-05 10:51:04,055 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:04,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:04,055 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-08-05 10:51:04,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:04,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:51:04,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:06,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:06,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:06,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:51:06,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:51:06,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:51:06,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:51:06,928 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-08-05 10:51:07,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:07,194 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 10:51:07,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:51:07,194 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-08-05 10:51:07,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:07,195 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:51:07,198 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:51:07,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:51:07,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:51:07,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:51:07,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:51:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:51:07,200 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-05 10:51:07,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:07,201 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:51:07,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:51:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:51:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:51:07,201 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:07,202 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-08-05 10:51:07,202 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:07,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:07,202 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-08-05 10:51:07,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:07,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:51:07,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:10,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:10,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:10,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:51:10,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:51:10,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:51:10,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:51:10,442 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-08-05 10:51:10,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:10,569 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:51:10,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:51:10,569 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-08-05 10:51:10,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:10,570 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:51:10,570 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:51:10,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:51:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:51:10,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 10:51:10,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:51:10,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 10:51:10,573 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-05 10:51:10,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:10,573 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 10:51:10,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:51:10,574 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 10:51:10,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:51:10,574 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:10,574 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-08-05 10:51:10,575 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:10,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:10,575 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-08-05 10:51:10,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:10,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:51:10,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:51:13,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:13,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:51:13,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:51:13,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:51:13,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:51:13,619 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-08-05 10:51:13,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:13,753 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 10:51:13,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:51:13,754 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-08-05 10:51:13,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:13,754 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:51:13,755 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:51:13,755 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 10:51:13,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:51:13,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:51:13,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:51:13,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:51:13,757 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-08-05 10:51:13,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:13,757 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:51:13,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:51:13,757 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:51:13,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:51:13,758 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:13,758 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-08-05 10:51:13,758 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:13,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:13,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-08-05 10:51:13,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:13,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:51:13,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:17,120 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 10:51:17,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:17,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:51:17,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:51:17,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:51:17,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:51:17,122 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-08-05 10:51:17,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:17,246 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:51:17,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:51:17,247 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-08-05 10:51:17,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:17,247 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:51:17,247 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:51:17,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:51:17,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:51:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:51:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:51:17,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 10:51:17,251 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-08-05 10:51:17,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:17,251 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 10:51:17,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:51:17,251 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 10:51:17,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:51:17,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:17,252 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-08-05 10:51:17,252 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:17,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:17,252 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-08-05 10:51:17,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:17,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:51:17,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:21,094 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 10:51:21,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:21,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:51:21,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:51:21,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:51:21,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:51:21,096 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-08-05 10:51:21,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:21,227 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 10:51:21,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:51:21,227 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-08-05 10:51:21,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:21,228 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:51:21,228 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:51:21,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:51:21,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:51:21,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:51:21,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:51:21,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 10:51:21,231 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-08-05 10:51:21,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:21,231 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 10:51:21,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:51:21,232 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 10:51:21,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:51:21,232 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:21,232 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-08-05 10:51:21,232 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:21,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:21,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-08-05 10:51:21,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:21,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:51:21,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:24,776 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 10:51:24,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:24,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:51:24,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:51:24,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:51:24,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:51:24,778 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-08-05 10:51:24,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:24,899 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:51:24,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:51:24,900 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-08-05 10:51:24,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:24,900 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:51:24,901 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:51:24,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:51:24,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:51:24,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:51:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:51:24,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:51:24,903 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-08-05 10:51:24,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:24,904 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:51:24,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:51:24,904 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:51:24,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:51:24,905 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:24,905 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 10:51:24,905 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:24,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:24,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-08-05 10:51:24,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:24,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:51:24,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:28,179 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 10:51:28,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:28,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:51:28,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:51:28,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:51:28,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:51:28,181 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-05 10:51:28,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:28,320 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 10:51:28,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:51:28,320 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 10:51:28,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:28,321 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:51:28,321 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:51:28,322 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 10:51:28,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:51:28,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:51:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:51:28,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:51:28,323 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-08-05 10:51:28,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:28,324 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:51:28,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:51:28,324 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:51:28,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:51:28,325 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:28,325 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-08-05 10:51:28,325 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:28,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:28,325 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-08-05 10:51:28,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:28,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:51:28,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:32,155 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 10:51:32,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:32,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:51:32,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:51:32,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:51:32,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:51:32,156 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-08-05 10:51:32,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:32,312 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:51:32,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:51:32,312 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-08-05 10:51:32,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:32,313 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:51:32,313 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:51:32,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:51:32,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:51:32,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 10:51:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:51:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 10:51:32,315 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-08-05 10:51:32,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:32,315 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 10:51:32,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:51:32,315 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 10:51:32,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:51:32,315 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:32,315 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-08-05 10:51:32,316 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:32,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:32,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-08-05 10:51:32,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:32,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:51:32,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:35,939 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 10:51:35,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:35,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:51:35,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:51:35,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:51:35,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:51:35,940 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-08-05 10:51:36,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:36,071 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 10:51:36,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:51:36,072 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-08-05 10:51:36,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:36,073 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:51:36,073 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:51:36,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:51:36,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:51:36,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:51:36,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:51:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 10:51:36,076 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-08-05 10:51:36,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:36,076 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 10:51:36,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:51:36,077 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 10:51:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:51:36,077 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:36,078 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-08-05 10:51:36,078 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:36,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:36,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-08-05 10:51:36,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:36,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:51:36,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:39,550 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 10:51:39,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:39,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:51:39,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:51:39,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:51:39,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:51:39,551 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-08-05 10:51:39,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:39,792 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:51:39,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:51:39,792 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-08-05 10:51:39,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:39,793 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:51:39,793 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:51:39,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:51:39,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:51:39,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 10:51:39,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:51:39,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 10:51:39,796 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-08-05 10:51:39,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:39,796 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 10:51:39,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:51:39,796 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 10:51:39,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:51:39,797 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:39,797 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-08-05 10:51:39,797 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:39,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:39,798 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-08-05 10:51:39,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:39,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:51:39,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:43,328 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 10:51:43,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:43,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 10:51:43,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 10:51:43,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 10:51:43,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:51:43,330 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-08-05 10:51:43,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:43,474 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 10:51:43,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:51:43,474 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-08-05 10:51:43,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:43,475 INFO L225 Difference]: With dead ends: 105 [2019-08-05 10:51:43,475 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:51:43,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:51:43,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:51:43,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 10:51:43,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:51:43,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 10:51:43,479 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-08-05 10:51:43,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:43,479 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 10:51:43,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 10:51:43,479 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 10:51:43,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:51:43,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:43,480 INFO L399 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-08-05 10:51:43,480 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:43,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:43,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-08-05 10:51:43,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:43,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:51:43,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:47,298 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 10:51:47,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:47,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 10:51:47,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 10:51:47,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 10:51:47,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:51:47,300 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-08-05 10:51:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:47,473 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 10:51:47,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 10:51:47,474 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-08-05 10:51:47,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:47,475 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:51:47,475 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:51:47,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:51:47,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:51:47,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 10:51:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:51:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 10:51:47,477 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-08-05 10:51:47,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:47,478 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 10:51:47,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 10:51:47,478 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 10:51:47,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:51:47,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:47,479 INFO L399 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-08-05 10:51:47,479 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:47,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:47,479 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-08-05 10:51:47,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:47,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:51:47,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:51,574 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 10:51:51,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:51,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 10:51:51,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 10:51:51,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 10:51:51,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:51:51,576 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-08-05 10:51:51,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:51,784 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 10:51:51,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 10:51:51,785 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-08-05 10:51:51,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:51,785 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:51:51,786 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:51:51,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:51:51,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:51:51,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:51:51,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:51:51,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 10:51:51,788 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-08-05 10:51:51,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:51,788 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 10:51:51,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 10:51:51,788 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 10:51:51,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:51:51,789 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:51,789 INFO L399 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-08-05 10:51:51,789 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:51,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:51,789 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-08-05 10:51:51,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:51,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:51:51,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:55,848 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 10:51:55,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:55,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 10:51:55,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 10:51:55,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 10:51:55,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:51:55,850 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-08-05 10:51:56,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:56,007 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 10:51:56,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 10:51:56,007 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-08-05 10:51:56,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:56,008 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:51:56,008 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:51:56,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:51:56,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:51:56,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 10:51:56,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:51:56,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 10:51:56,011 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-08-05 10:51:56,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:56,011 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 10:51:56,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 10:51:56,012 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 10:51:56,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:51:56,012 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:56,012 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-08-05 10:51:56,013 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:56,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:56,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-08-05 10:51:56,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:56,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:51:56,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:00,512 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 10:52:00,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:00,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 10:52:00,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 10:52:00,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 10:52:00,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:52:00,514 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-08-05 10:52:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:00,699 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 10:52:00,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 10:52:00,699 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-08-05 10:52:00,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:00,700 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:52:00,700 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:52:00,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:52:00,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:52:00,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:52:00,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:52:00,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 10:52:00,702 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-08-05 10:52:00,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:00,703 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 10:52:00,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 10:52:00,703 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 10:52:00,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:52:00,703 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:00,704 INFO L399 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-08-05 10:52:00,704 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:00,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:00,704 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-08-05 10:52:00,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:00,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:52:00,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:04,664 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 10:52:04,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:04,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 10:52:04,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 10:52:04,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 10:52:04,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:52:04,666 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-08-05 10:52:04,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:04,837 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 10:52:04,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 10:52:04,838 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-08-05 10:52:04,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:04,839 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:52:04,839 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:52:04,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:52:04,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:52:04,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 10:52:04,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:52:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 10:52:04,841 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-08-05 10:52:04,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:04,842 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 10:52:04,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 10:52:04,842 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 10:52:04,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 10:52:04,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:04,843 INFO L399 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-08-05 10:52:04,843 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:04,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:04,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-08-05 10:52:04,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:04,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:52:04,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:09,135 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 10:52:09,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:09,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 10:52:09,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 10:52:09,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 10:52:09,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:52:09,137 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-08-05 10:52:09,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:09,320 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 10:52:09,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 10:52:09,320 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-08-05 10:52:09,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:09,321 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:52:09,321 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:52:09,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:52:09,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:52:09,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 10:52:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:52:09,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 10:52:09,323 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-08-05 10:52:09,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:09,323 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 10:52:09,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 10:52:09,324 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 10:52:09,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:52:09,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:09,324 INFO L399 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-08-05 10:52:09,325 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:09,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:09,325 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-08-05 10:52:09,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:09,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:52:09,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:13,538 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 10:52:13,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:13,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 10:52:13,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 10:52:13,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 10:52:13,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:52:13,541 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-08-05 10:52:13,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:13,726 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 10:52:13,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 10:52:13,727 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-08-05 10:52:13,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:13,727 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:52:13,727 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:52:13,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:52:13,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:52:13,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 10:52:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:52:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 10:52:13,730 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-08-05 10:52:13,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:13,730 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 10:52:13,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 10:52:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 10:52:13,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:52:13,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:13,731 INFO L399 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-08-05 10:52:13,731 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:13,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:13,732 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-08-05 10:52:13,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:13,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:52:13,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:18,029 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 10:52:18,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:18,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 10:52:18,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 10:52:18,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 10:52:18,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:52:18,031 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-08-05 10:52:18,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:18,193 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 10:52:18,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 10:52:18,194 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-08-05 10:52:18,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:18,195 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:52:18,195 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:52:18,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:52:18,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:52:18,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 10:52:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:52:18,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 10:52:18,198 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-08-05 10:52:18,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:18,198 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 10:52:18,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 10:52:18,198 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 10:52:18,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:52:18,199 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:18,199 INFO L399 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-08-05 10:52:18,199 INFO L418 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:18,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:18,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-08-05 10:52:18,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:18,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:52:18,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:22,637 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 10:52:22,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:22,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 10:52:22,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 10:52:22,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 10:52:22,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:52:22,639 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-08-05 10:52:22,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:22,855 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 10:52:22,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 10:52:22,855 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-08-05 10:52:22,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:22,855 INFO L225 Difference]: With dead ends: 114 [2019-08-05 10:52:22,855 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:52:22,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:52:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:52:22,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 10:52:22,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 10:52:22,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 10:52:22,857 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-08-05 10:52:22,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:22,858 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 10:52:22,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 10:52:22,858 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 10:52:22,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 10:52:22,858 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:22,859 INFO L399 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-08-05 10:52:22,859 INFO L418 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:22,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:22,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-08-05 10:52:22,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:22,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:52:22,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:27,397 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 10:52:27,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:27,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 10:52:27,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 10:52:27,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 10:52:27,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:52:27,399 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-08-05 10:52:27,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:27,597 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 10:52:27,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 10:52:27,597 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-08-05 10:52:27,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:27,598 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:52:27,598 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:52:27,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:52:27,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:52:27,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 10:52:27,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:52:27,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 10:52:27,601 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-08-05 10:52:27,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:27,601 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 10:52:27,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 10:52:27,602 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 10:52:27,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:52:27,602 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:27,602 INFO L399 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-08-05 10:52:27,603 INFO L418 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:27,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:27,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1736874868, now seen corresponding path program 111 times [2019-08-05 10:52:27,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:27,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:52:27,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:32,110 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 10:52:32,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:32,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 10:52:32,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 10:52:32,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 10:52:32,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:52:32,112 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2019-08-05 10:52:32,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:32,296 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:52:32,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 10:52:32,297 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2019-08-05 10:52:32,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:32,297 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:52:32,298 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:52:32,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:52:32,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:52:32,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 10:52:32,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:52:32,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 10:52:32,300 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2019-08-05 10:52:32,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:32,301 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 10:52:32,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 10:52:32,301 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 10:52:32,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 10:52:32,302 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:32,302 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2019-08-05 10:52:32,302 INFO L418 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:32,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:32,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1991455747, now seen corresponding path program 112 times [2019-08-05 10:52:32,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:32,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:52:32,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:37,058 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 10:52:37,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:37,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 10:52:37,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 10:52:37,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 10:52:37,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:52:37,060 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2019-08-05 10:52:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:37,281 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 10:52:37,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 10:52:37,281 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2019-08-05 10:52:37,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:37,282 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:52:37,282 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:52:37,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:52:37,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:52:37,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 10:52:37,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:52:37,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 10:52:37,284 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2019-08-05 10:52:37,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:37,284 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 10:52:37,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 10:52:37,284 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 10:52:37,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:52:37,284 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:37,284 INFO L399 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2019-08-05 10:52:37,285 INFO L418 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:37,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:37,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1605587820, now seen corresponding path program 113 times [2019-08-05 10:52:37,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:37,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 10:52:37,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:42,006 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 10:52:42,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:42,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 10:52:42,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 10:52:42,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 10:52:42,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:52:42,008 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2019-08-05 10:52:42,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:42,177 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 10:52:42,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 10:52:42,177 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2019-08-05 10:52:42,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:42,178 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:52:42,178 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:52:42,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:52:42,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:52:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 10:52:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:52:42,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 10:52:42,180 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2019-08-05 10:52:42,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:42,180 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 10:52:42,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 10:52:42,180 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 10:52:42,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 10:52:42,181 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:42,181 INFO L399 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2019-08-05 10:52:42,181 INFO L418 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:42,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:42,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1766383325, now seen corresponding path program 114 times [2019-08-05 10:52:42,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:42,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:52:42,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:47,170 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 10:52:47,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:47,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-05 10:52:47,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-05 10:52:47,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-05 10:52:47,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:52:47,172 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 117 states. [2019-08-05 10:52:47,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:47,358 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 10:52:47,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-05 10:52:47,358 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 117 [2019-08-05 10:52:47,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:47,359 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:52:47,359 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:52:47,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:52:47,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:52:47,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 10:52:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:52:47,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 10:52:47,362 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2019-08-05 10:52:47,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:47,362 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 10:52:47,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-05 10:52:47,363 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 10:52:47,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 10:52:47,363 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:47,363 INFO L399 BasicCegarLoop]: trace histogram [115, 1, 1, 1] [2019-08-05 10:52:47,363 INFO L418 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:47,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:47,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1076693580, now seen corresponding path program 115 times [2019-08-05 10:52:47,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:47,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:52:47,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:52,262 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 10:52:52,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:52,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-08-05 10:52:52,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-08-05 10:52:52,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-08-05 10:52:52,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:52:52,264 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 118 states. [2019-08-05 10:52:52,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:52,485 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 10:52:52,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-08-05 10:52:52,485 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 118 [2019-08-05 10:52:52,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:52,486 INFO L225 Difference]: With dead ends: 120 [2019-08-05 10:52:52,486 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 10:52:52,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:52:52,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 10:52:52,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-08-05 10:52:52,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 10:52:52,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 10:52:52,489 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2019-08-05 10:52:52,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:52,490 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 10:52:52,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-08-05 10:52:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 10:52:52,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 10:52:52,490 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:52,490 INFO L399 BasicCegarLoop]: trace histogram [116, 1, 1, 1] [2019-08-05 10:52:52,490 INFO L418 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:52,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:52,491 INFO L82 PathProgramCache]: Analyzing trace with hash -982235581, now seen corresponding path program 116 times [2019-08-05 10:52:52,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:52,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:52:52,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:57,364 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 10:52:57,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:57,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2019-08-05 10:52:57,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-08-05 10:52:57,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-08-05 10:52:57,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:52:57,366 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 119 states. [2019-08-05 10:52:57,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:57,604 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-05 10:52:57,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-08-05 10:52:57,605 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 119 [2019-08-05 10:52:57,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:57,605 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:52:57,605 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:52:57,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:52:57,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:52:57,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-05 10:52:57,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:52:57,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-05 10:52:57,607 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2019-08-05 10:52:57,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:57,608 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-05 10:52:57,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-08-05 10:52:57,608 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-05 10:52:57,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 10:52:57,608 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:57,609 INFO L399 BasicCegarLoop]: trace histogram [117, 1, 1, 1] [2019-08-05 10:52:57,609 INFO L418 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:57,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:57,609 INFO L82 PathProgramCache]: Analyzing trace with hash -384530132, now seen corresponding path program 117 times [2019-08-05 10:52:57,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:57,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 10:52:57,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:02,529 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 10:53:02,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:02,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2019-08-05 10:53:02,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-08-05 10:53:02,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-08-05 10:53:02,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 10:53:02,531 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 120 states. [2019-08-05 10:53:02,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:02,729 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-05 10:53:02,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-08-05 10:53:02,729 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 120 [2019-08-05 10:53:02,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:02,730 INFO L225 Difference]: With dead ends: 122 [2019-08-05 10:53:02,730 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 10:53:02,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-08-05 10:53:02,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 10:53:02,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-08-05 10:53:02,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-08-05 10:53:02,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-08-05 10:53:02,732 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2019-08-05 10:53:02,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:02,732 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-08-05 10:53:02,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-08-05 10:53:02,732 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-08-05 10:53:02,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-08-05 10:53:02,732 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:02,732 INFO L399 BasicCegarLoop]: trace histogram [118, 1, 1, 1] [2019-08-05 10:53:02,732 INFO L418 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:02,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:02,733 INFO L82 PathProgramCache]: Analyzing trace with hash 964469603, now seen corresponding path program 118 times [2019-08-05 10:53:02,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:02,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 120 conjunts are in the unsatisfiable core [2019-08-05 10:53:02,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:53:05,528 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:53:05,528 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:53:05,532 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:53:05,532 INFO L202 PluginConnector]: Adding new model const1.i_3.bplTransformedIcfg_BEv2_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:53:05 BoogieIcfgContainer [2019-08-05 10:53:05,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:53:05,535 INFO L168 Benchmark]: Toolchain (without parser) took 241294.41 ms. Allocated memory was 134.2 MB in the beginning and 910.7 MB in the end (delta: 776.5 MB). Free memory was 111.7 MB in the beginning and 554.9 MB in the end (delta: -443.2 MB). Peak memory consumption was 333.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:53:05,536 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:53:05,536 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.96 ms. Allocated memory is still 134.2 MB. Free memory was 111.5 MB in the beginning and 110.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:53:05,537 INFO L168 Benchmark]: Boogie Preprocessor took 21.98 ms. Allocated memory is still 134.2 MB. Free memory was 110.0 MB in the beginning and 108.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:53:05,537 INFO L168 Benchmark]: RCFGBuilder took 265.02 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 99.6 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:53:05,538 INFO L168 Benchmark]: TraceAbstraction took 240966.09 ms. Allocated memory was 134.2 MB in the beginning and 910.7 MB in the end (delta: 776.5 MB). Free memory was 99.2 MB in the beginning and 554.9 MB in the end (delta: -455.8 MB). Peak memory consumption was 320.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:53:05,541 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 134.2 MB. Free memory was 112.9 MB in the beginning and 112.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.96 ms. Allocated memory is still 134.2 MB. Free memory was 111.5 MB in the beginning and 110.0 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.98 ms. Allocated memory is still 134.2 MB. Free memory was 110.0 MB in the beginning and 108.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 265.02 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 99.6 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 240966.09 ms. Allocated memory was 134.2 MB in the beginning and 910.7 MB in the end (delta: 776.5 MB). Free memory was 99.2 MB in the beginning and 554.9 MB in the end (delta: -455.8 MB). Peak memory consumption was 320.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 37). 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 93 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 240.9s OverallTime, 119 OverallIterations, 118 TraceHistogramMax, 13.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 355 SDtfs, 0 SDslu, 1956 SDs, 0 SdLazy, 9094 SolverSat, 223 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7139 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7021 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 219.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred 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.4s SatisfiabilityAnalysisTime, 222.1s InterpolantComputationTime, 7257 NumberOfCodeBlocks, 7257 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 7139 ConstructedInterpolants, 0 QuantifiedInterpolants, 1692179 SizeOfPredicates, 117 NumberOfNonLiveVariables, 43542 ConjunctsInSsa, 7140 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