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/functions1.i_3.bplTransformedIcfg_BEv2_8.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:47:08,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:47:08,076 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:47:08,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:47:08,089 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:47:08,090 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:47:08,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:47:08,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:47:08,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:47:08,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:47:08,097 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:47:08,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:47:08,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:47:08,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:47:08,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:47:08,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:47:08,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:47:08,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:47:08,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:47:08,106 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:47:08,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:47:08,109 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:47:08,110 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:47:08,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:47:08,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:47:08,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:47:08,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:47:08,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:47:08,115 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:47:08,118 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:47:08,118 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:47:08,120 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:47:08,121 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:47:08,122 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:47:08,123 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:47:08,124 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:47:08,124 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:47:08,125 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:47:08,125 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:47:08,126 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:47:08,126 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:47:08,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:47:08,173 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:47:08,176 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:47:08,178 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:47:08,178 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:47:08,179 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/functions1.i_3.bplTransformedIcfg_BEv2_8.bpl [2019-08-05 10:47:08,179 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/functions1.i_3.bplTransformedIcfg_BEv2_8.bpl' [2019-08-05 10:47:08,220 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:47:08,221 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:47:08,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:47:08,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:47:08,222 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:47:08,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "functions1.i_3.bplTransformedIcfg_BEv2_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:08" (1/1) ... [2019-08-05 10:47:08,247 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "functions1.i_3.bplTransformedIcfg_BEv2_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:08" (1/1) ... [2019-08-05 10:47:08,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:47:08,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:47:08,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:47:08,258 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:47:08,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "functions1.i_3.bplTransformedIcfg_BEv2_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:08" (1/1) ... [2019-08-05 10:47:08,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "functions1.i_3.bplTransformedIcfg_BEv2_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:08" (1/1) ... [2019-08-05 10:47:08,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "functions1.i_3.bplTransformedIcfg_BEv2_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:08" (1/1) ... [2019-08-05 10:47:08,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "functions1.i_3.bplTransformedIcfg_BEv2_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:08" (1/1) ... [2019-08-05 10:47:08,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "functions1.i_3.bplTransformedIcfg_BEv2_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:08" (1/1) ... [2019-08-05 10:47:08,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "functions1.i_3.bplTransformedIcfg_BEv2_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:08" (1/1) ... [2019-08-05 10:47:08,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "functions1.i_3.bplTransformedIcfg_BEv2_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:08" (1/1) ... [2019-08-05 10:47:08,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:47:08,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:47:08,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:47:08,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:47:08,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "functions1.i_3.bplTransformedIcfg_BEv2_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:08" (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:47:08,347 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:47:08,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:47:08,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:47:08,610 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:47:08,610 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:47:08,612 INFO L202 PluginConnector]: Adding new model functions1.i_3.bplTransformedIcfg_BEv2_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:47:08 BoogieIcfgContainer [2019-08-05 10:47:08,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:47:08,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:47:08,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:47:08,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:47:08,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "functions1.i_3.bplTransformedIcfg_BEv2_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:47:08" (1/2) ... [2019-08-05 10:47:08,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f405b6 and model type functions1.i_3.bplTransformedIcfg_BEv2_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:47:08, skipping insertion in model container [2019-08-05 10:47:08,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "functions1.i_3.bplTransformedIcfg_BEv2_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:47:08" (2/2) ... [2019-08-05 10:47:08,624 INFO L109 eAbstractionObserver]: Analyzing ICFG functions1.i_3.bplTransformedIcfg_BEv2_8.bpl [2019-08-05 10:47:08,633 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:47:08,642 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:47:08,657 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:47:08,682 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:47:08,683 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:47:08,683 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:47:08,683 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:47:08,684 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:47:08,684 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:47:08,684 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:47:08,684 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:47:08,684 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:47:08,699 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:47:08,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:47:08,707 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:08,708 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:47:08,710 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:08,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:08,716 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:47:08,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:08,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:47:08,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:08,843 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:47:08,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:47:08,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:47:08,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:47:08,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:47:08,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:47:08,864 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:47:08,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:08,892 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:47:08,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:47:08,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:47:08,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:08,904 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:47:08,904 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:47:08,907 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:47:08,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:47:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:47:08,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:47:08,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:47:08,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:47:08,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:08,936 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:47:08,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:47:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:47:08,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:47:08,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:08,937 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:47:08,937 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:08,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:08,938 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:47:08,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:08,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:47:08,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:09,120 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:47:09,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:09,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:47:09,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:47:09,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:47:09,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:47:09,124 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:47:09,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:09,190 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:47:09,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:47:09,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:47:09,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:09,192 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:47:09,193 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:47:09,194 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:47:09,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:47:09,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:47:09,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:47:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:47:09,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:47:09,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:09,196 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:47:09,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:47:09,197 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:47:09,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:47:09,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:09,197 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:47:09,198 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:09,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:09,198 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:47:09,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:09,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:47:09,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:09,310 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:47:09,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:09,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:47:09,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:47:09,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:47:09,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:47:09,314 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:47:09,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:09,362 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:47:09,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:47:09,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:47:09,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:09,369 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:47:09,370 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:47:09,370 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:47:09,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:47:09,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:47:09,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:47:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:47:09,372 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:47:09,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:09,373 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:47:09,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:47:09,373 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:47:09,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:47:09,373 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:09,374 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:47:09,374 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:09,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:09,374 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:47:09,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:09,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:47:09,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:09,506 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:47:09,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:09,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:47:09,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:47:09,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:47:09,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:47:09,508 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:47:09,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:09,557 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:47:09,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:47:09,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:47:09,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:09,558 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:47:09,558 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:47:09,558 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:47:09,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:47:09,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:47:09,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:47:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:47:09,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:47:09,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:09,561 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:47:09,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:47:09,572 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:47:09,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:47:09,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:09,573 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:47:09,573 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:09,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:09,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:47:09,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:09,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:47:09,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:09,768 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:47:09,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:09,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:47:09,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:47:09,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:47:09,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:47:09,770 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:47:09,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:09,834 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:47:09,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:47:09,834 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:47:09,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:09,835 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:47:09,835 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:47:09,836 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:47:09,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:47:09,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:47:09,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:47:09,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:47:09,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:47:09,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:09,838 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:47:09,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:47:09,838 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:47:09,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:47:09,839 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:09,839 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:47:09,839 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:09,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:09,840 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:47:09,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:09,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:47:09,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:10,202 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:47:10,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:10,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:47:10,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:47:10,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:47:10,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:47:10,204 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:47:10,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:10,236 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:47:10,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:47:10,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:47:10,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:10,237 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:47:10,237 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:47:10,238 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:47:10,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:47:10,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:47:10,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:47:10,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:47:10,240 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:47:10,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:10,240 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:47:10,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:47:10,241 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:47:10,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:47:10,241 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:10,241 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:47:10,242 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:10,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:10,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:47:10,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:10,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:47:10,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:10,501 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:47:10,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:10,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:47:10,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:47:10,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:47:10,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:47:10,503 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:47:10,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:10,562 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:47:10,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:47:10,567 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:47:10,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:10,567 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:47:10,568 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:47:10,568 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:47:10,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:47:10,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:47:10,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:47:10,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:47:10,572 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:47:10,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:10,572 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:47:10,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:47:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:47:10,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:47:10,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:10,573 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:47:10,573 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:10,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:10,573 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:47:10,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:10,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:47:10,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:10,745 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:47:10,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:10,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:47:10,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:47:10,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:47:10,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:47:10,748 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:47:10,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:10,810 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:47:10,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:47:10,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:47:10,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:10,811 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:47:10,812 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:47:10,812 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:47:10,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:47:10,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:47:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:47:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:47:10,815 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:47:10,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:10,816 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:47:10,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:47:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:47:10,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:47:10,816 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:10,816 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:47:10,817 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:10,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:10,817 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:47:10,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:10,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:47:10,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:11,296 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:47:11,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:11,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:47:11,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:47:11,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:47:11,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:47:11,299 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:47:11,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:11,333 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:47:11,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:47:11,334 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:47:11,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:11,335 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:47:11,335 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:47:11,336 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:47:11,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:47:11,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:47:11,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:47:11,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:47:11,338 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:47:11,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:11,338 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:47:11,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:47:11,338 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:47:11,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:47:11,339 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:11,339 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:47:11,339 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:11,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:11,340 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 10:47:11,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:11,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:47:11,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:11,701 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:47:11,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:11,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:47:11,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:47:11,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:47:11,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:47:11,702 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:47:11,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:11,745 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:47:11,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:47:11,746 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:47:11,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:11,747 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:47:11,747 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:47:11,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:47:11,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:47:11,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:47:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:47:11,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:47:11,751 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:47:11,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:11,751 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:47:11,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:47:11,752 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:47:11,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:47:11,752 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:11,752 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:47:11,753 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:11,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:11,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 10:47:11,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:11,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:47:11,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:12,096 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:47:12,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:12,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:47:12,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:47:12,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:47:12,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:47:12,098 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:47:12,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:12,122 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:47:12,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:47:12,123 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:47:12,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:12,123 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:47:12,124 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:47:12,124 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:47:12,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:47:12,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:47:12,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:47:12,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:47:12,127 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:47:12,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:12,128 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:47:12,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:47:12,128 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:47:12,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:47:12,128 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:12,129 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:47:12,129 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:12,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:12,129 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 10:47:12,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:12,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:47:12,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:12,561 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:47:12,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:12,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:47:12,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:47:12,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:47:12,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:47:12,563 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:47:12,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:12,651 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:47:12,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:47:12,651 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:47:12,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:12,652 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:47:12,652 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:47:12,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:47:12,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:47:12,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:47:12,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:47:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:47:12,657 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:47:12,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:12,657 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:47:12,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:47:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:47:12,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:47:12,658 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:12,658 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:47:12,658 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:12,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:12,658 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 10:47:12,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:12,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:47:12,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:13,156 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:47:13,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:13,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:47:13,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:47:13,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:47:13,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:47:13,158 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:47:13,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:13,185 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:47:13,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:47:13,185 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:47:13,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:13,186 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:47:13,186 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:47:13,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:47:13,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:47:13,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:47:13,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:47:13,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:47:13,190 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:47:13,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:13,190 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:47:13,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:47:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:47:13,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:47:13,191 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:13,191 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:47:13,191 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:13,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:13,192 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 10:47:13,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:13,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:47:13,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:13,658 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:47:13,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:13,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:47:13,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:47:13,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:47:13,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:47:13,660 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:47:13,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:13,716 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:47:13,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:47:13,716 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:47:13,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:13,717 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:47:13,717 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:47:13,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:47:13,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:47:13,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:47:13,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:47:13,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:47:13,721 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:47:13,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:13,722 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:47:13,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:47:13,722 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:47:13,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:47:13,722 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:13,723 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:47:13,723 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:13,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:13,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 10:47:13,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:13,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:47:13,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:13,976 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:47:13,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:13,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:47:13,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:47:13,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:47:13,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:47:13,978 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:47:14,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:14,008 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:47:14,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:47:14,008 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:47:14,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:14,009 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:47:14,009 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:47:14,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:47:14,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:47:14,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:47:14,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:47:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:47:14,013 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:47:14,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:14,014 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:47:14,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:47:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:47:14,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:47:14,015 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:14,015 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:47:14,015 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:14,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:14,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 10:47:14,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:14,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:47:14,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:14,350 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:47:14,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:14,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:47:14,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:47:14,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:47:14,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:47:14,351 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:47:14,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:14,623 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:47:14,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:47:14,624 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:47:14,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:14,624 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:47:14,625 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:47:14,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:47:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:47:14,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:47:14,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:47:14,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:47:14,629 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:47:14,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:14,629 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:47:14,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:47:14,629 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:47:14,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:47:14,630 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:14,630 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:47:14,630 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:14,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:14,631 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 10:47:14,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:14,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:47:14,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:15,368 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:47:15,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:15,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:47:15,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:47:15,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:47:15,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:47:15,370 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:47:15,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:15,423 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:47:15,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:47:15,424 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:47:15,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:15,424 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:47:15,425 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:47:15,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:47:15,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:47:15,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:47:15,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:47:15,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:47:15,428 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:47:15,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:15,428 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:47:15,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:47:15,429 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:47:15,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:47:15,429 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:15,429 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:47:15,430 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:15,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:15,430 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 10:47:15,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:15,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:47:15,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:15,733 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:47:15,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:15,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:47:15,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:47:15,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:47:15,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:47:15,736 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:47:15,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:15,772 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:47:15,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:47:15,778 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:47:15,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:15,779 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:47:15,779 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:47:15,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:47:15,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:47:15,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:47:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:47:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:47:15,783 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:47:15,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:15,783 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:47:15,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:47:15,784 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:47:15,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:47:15,784 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:15,784 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:47:15,785 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:15,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:15,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 10:47:15,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:15,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:47:15,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:17,486 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:47:17,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:17,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:47:17,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:47:17,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:47:17,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:47:17,488 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:47:17,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:17,524 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:47:17,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:47:17,525 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:47:17,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:17,526 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:47:17,526 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:47:17,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:47:17,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:47:17,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:47:17,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:47:17,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:47:17,530 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:47:17,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:17,531 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:47:17,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:47:17,531 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:47:17,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:47:17,531 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:17,532 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:47:17,532 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:17,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:17,532 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 10:47:17,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:17,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:47:17,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:18,284 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:47:18,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:18,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:47:18,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:47:18,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:47:18,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:47:18,286 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:47:18,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:18,315 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:47:18,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:47:18,315 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:47:18,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:18,316 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:47:18,316 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:47:18,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:47:18,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:47:18,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:47:18,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:47:18,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:47:18,321 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:47:18,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:18,321 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:47:18,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:47:18,321 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:47:18,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:47:18,322 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:18,322 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:47:18,322 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:18,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:18,323 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 10:47:18,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:18,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:47:18,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:18,805 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:47:18,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:18,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:47:18,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:47:18,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:47:18,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:47:18,806 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:47:18,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:18,877 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:47:18,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:47:18,877 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:47:18,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:18,878 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:47:18,878 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:47:18,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:47:18,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:47:18,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:47:18,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:47:18,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:47:18,881 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:47:18,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:18,881 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:47:18,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:47:18,882 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:47:18,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:47:18,882 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:18,882 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:47:18,883 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:18,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:18,883 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-08-05 10:47:18,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:18,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:47:18,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:19,267 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:47:19,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:19,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:47:19,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:47:19,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:47:19,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:47:19,268 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:47:19,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:19,329 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:47:19,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:47:19,329 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:47:19,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:19,330 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:47:19,330 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:47:19,331 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:47:19,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:47:19,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:47:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:47:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:47:19,333 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:47:19,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:19,333 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:47:19,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:47:19,334 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:47:19,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:19,334 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:19,335 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:47:19,335 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:19,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:19,335 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-08-05 10:47:19,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:19,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:47:19,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:19,847 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:47:19,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:19,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:19,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:47:19,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:47:19,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:47:19,849 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:47:19,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:19,884 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:47:19,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:47:19,885 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:47:19,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:19,886 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:47:19,886 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:47:19,887 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:47:19,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:47:19,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:47:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:47:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:47:19,890 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:47:19,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:19,891 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:47:19,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:47:19,891 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:47:19,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:19,892 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:19,892 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:47:19,892 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:19,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:19,892 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-08-05 10:47:19,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:19,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:47:19,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:20,407 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:47:20,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:20,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:47:20,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:20,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:20,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:20,409 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:47:20,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:20,477 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:47:20,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:20,481 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:20,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:20,482 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:47:20,482 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:47:20,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:20,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:47:20,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:47:20,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:47:20,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:47:20,485 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:47:20,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:20,485 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:47:20,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:20,486 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:47:20,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:47:20,486 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:20,487 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:47:20,487 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:20,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:20,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-08-05 10:47:20,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:20,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:47:20,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:21,884 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:47:21,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:21,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:47:21,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:47:21,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:47:21,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:21,886 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:47:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:21,940 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:47:21,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:47:21,941 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:47:21,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:21,942 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:47:21,942 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:47:21,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:47:21,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:47:21,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:47:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:47:21,946 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:47:21,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:21,946 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:47:21,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:47:21,946 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:47:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:47:21,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:21,948 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:47:21,948 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:21,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:21,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-08-05 10:47:21,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:21,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:47:21,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:22,601 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:47:22,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:22,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:47:22,602 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:47:22,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:47:22,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:22,603 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:47:22,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:22,664 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:47:22,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:47:22,665 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:47:22,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:22,666 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:47:22,666 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:47:22,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:22,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:47:22,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:47:22,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:47:22,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:47:22,669 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:47:22,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:22,670 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:47:22,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:47:22,670 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:47:22,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:47:22,670 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:22,670 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:47:22,671 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:22,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:22,671 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-08-05 10:47:22,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:22,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:47:22,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:23,516 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:47:23,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:23,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:47:23,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:47:23,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:47:23,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:47:23,518 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:47:23,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:23,600 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:47:23,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:47:23,601 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:47:23,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:23,601 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:47:23,602 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:47:23,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:47:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:47:23,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:47:23,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:47:23,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:47:23,606 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:47:23,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:23,606 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:47:23,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:47:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:47:23,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:47:23,608 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:23,608 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:47:23,609 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:23,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:23,609 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-08-05 10:47:23,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:23,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:47:23,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:24,110 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:47:24,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:24,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:47:24,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:47:24,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:47:24,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:47:24,112 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:47:24,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:24,199 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:47:24,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:47:24,199 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:47:24,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:24,200 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:47:24,200 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:47:24,201 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:47:24,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:47:24,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:47:24,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:47:24,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:47:24,208 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:47:24,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:24,209 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:47:24,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:47:24,209 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:47:24,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:47:24,209 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:24,209 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:47:24,210 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:24,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:24,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-08-05 10:47:24,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:24,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:47:24,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:24,656 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:47:24,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:24,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:47:24,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:47:24,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:47:24,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:47:24,658 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:47:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:24,711 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:47:24,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:47:24,712 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:47:24,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:24,712 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:47:24,713 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:47:24,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:47:24,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:47:24,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:47:24,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:47:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:47:24,717 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:47:24,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:24,717 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:47:24,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:47:24,717 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:47:24,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:47:24,718 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:24,718 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:47:24,718 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:24,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:24,718 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-08-05 10:47:24,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:24,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:47:24,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:25,293 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:47:25,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:25,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:47:25,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:47:25,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:47:25,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:47:25,294 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:47:25,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:25,375 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:47:25,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:47:25,375 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:47:25,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:25,376 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:47:25,376 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:47:25,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:47:25,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:47:25,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:47:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:47:25,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:47:25,380 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:47:25,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:25,380 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:47:25,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:47:25,380 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:47:25,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:47:25,381 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:25,381 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:47:25,381 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:25,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:25,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-08-05 10:47:25,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:25,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 122 conjunts are in the unsatisfiable core [2019-08-05 10:47:25,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:25,832 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:47:25,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:25,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:47:25,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:47:25,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:47:25,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:47:25,834 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:47:25,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:25,881 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:47:25,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:47:25,882 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:47:25,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:25,883 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:47:25,883 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:47:25,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:47:25,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:47:25,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:47:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:47:25,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:47:25,886 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:47:25,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:25,886 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:47:25,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:47:25,887 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:47:25,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:47:25,887 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:25,887 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:47:25,887 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:25,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:25,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-08-05 10:47:25,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:25,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 126 conjunts are in the unsatisfiable core [2019-08-05 10:47:25,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:26,647 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:47:26,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:26,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:47:26,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:47:26,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:47:26,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:47:26,650 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:47:26,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:26,713 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:47:26,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:47:26,714 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:47:26,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:26,714 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:47:26,714 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:47:26,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:47:26,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:47:26,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:47:26,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:47:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:47:26,717 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:47:26,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:26,717 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:47:26,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:47:26,718 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:47:26,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:47:26,718 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:26,718 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:47:26,718 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:26,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:26,719 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-08-05 10:47:26,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:26,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 130 conjunts are in the unsatisfiable core [2019-08-05 10:47:26,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:27,443 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:47:27,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:27,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:47:27,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:47:27,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:47:27,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:47:27,445 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:47:27,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:27,490 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:47:27,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:47:27,490 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:47:27,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:27,491 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:47:27,491 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:47:27,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:47:27,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:47:27,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:47:27,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:47:27,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:47:27,496 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:47:27,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:27,496 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:47:27,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:47:27,496 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:47:27,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:47:27,497 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:27,497 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:47:27,497 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:27,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:27,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-08-05 10:47:27,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:27,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 134 conjunts are in the unsatisfiable core [2019-08-05 10:47:27,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:28,273 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:47:28,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:28,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:47:28,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:47:28,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:47:28,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:47:28,275 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:47:28,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:28,325 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:47:28,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:47:28,325 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:47:28,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:28,326 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:47:28,326 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:47:28,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:47:28,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:47:28,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:47:28,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:47:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:47:28,329 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:47:28,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:28,329 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:47:28,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:47:28,329 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:47:28,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:47:28,330 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:28,330 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:47:28,330 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:28,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:28,331 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-08-05 10:47:28,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:28,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 10:47:28,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:29,366 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:47:29,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:29,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:47:29,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:47:29,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:47:29,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:47:29,367 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:47:29,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:29,408 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:47:29,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:47:29,408 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:47:29,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:29,409 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:47:29,409 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:47:29,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:47:29,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:47:29,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:47:29,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:47:29,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:47:29,412 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:47:29,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:29,412 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:47:29,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:47:29,413 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:47:29,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:47:29,413 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:29,413 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:47:29,413 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:29,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:29,414 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-08-05 10:47:29,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:29,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 142 conjunts are in the unsatisfiable core [2019-08-05 10:47:29,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:30,280 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:47:30,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:30,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:47:30,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:47:30,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:47:30,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:47:30,282 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:47:30,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:30,350 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:47:30,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:47:30,351 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:47:30,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:30,352 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:47:30,352 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:47:30,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:47:30,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:47:30,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:47:30,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:47:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:47:30,355 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:47:30,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:30,355 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:47:30,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:47:30,355 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:47:30,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:47:30,356 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:30,356 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:47:30,356 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:30,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:30,356 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-08-05 10:47:30,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:30,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 146 conjunts are in the unsatisfiable core [2019-08-05 10:47:30,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:31,042 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:47:31,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:31,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:47:31,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:47:31,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:47:31,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:47:31,044 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:47:31,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:31,094 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:47:31,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:47:31,094 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:47:31,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:31,095 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:47:31,095 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:47:31,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:47:31,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:47:31,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:47:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:47:31,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:47:31,099 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:47:31,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:31,099 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:47:31,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:47:31,099 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:47:31,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:47:31,100 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:31,100 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:47:31,100 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:31,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:31,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-08-05 10:47:31,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:31,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 150 conjunts are in the unsatisfiable core [2019-08-05 10:47:31,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:31,724 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:47:31,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:31,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:47:31,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:47:31,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:47:31,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:47:31,726 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:47:31,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:31,804 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:47:31,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:47:31,805 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:47:31,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:31,805 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:47:31,805 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:47:31,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:47:31,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:47:31,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:47:31,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:47:31,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:47:31,809 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:47:31,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:31,809 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:47:31,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:47:31,809 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:47:31,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:47:31,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:31,810 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:47:31,810 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:31,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:31,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-08-05 10:47:31,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:31,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 154 conjunts are in the unsatisfiable core [2019-08-05 10:47:31,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:32,774 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:47:32,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:32,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:47:32,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:47:32,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:47:32,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:47:32,776 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:47:32,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:32,834 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:47:32,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:47:32,835 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:47:32,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:32,836 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:47:32,836 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:47:32,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:47:32,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:47:32,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:47:32,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:47:32,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:47:32,839 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:47:32,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:32,840 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:47:32,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:47:32,840 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:47:32,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:47:32,840 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:32,840 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:47:32,841 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:32,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:32,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-08-05 10:47:32,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:32,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 158 conjunts are in the unsatisfiable core [2019-08-05 10:47:32,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:33,816 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:47:33,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:33,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:47:33,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:47:33,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:47:33,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:47:33,818 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:47:33,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:33,886 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:47:33,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:47:33,886 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:47:33,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:33,887 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:47:33,887 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:47:33,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:47:33,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:47:33,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:47:33,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:47:33,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:47:33,889 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:47:33,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:33,889 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:47:33,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:47:33,889 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:47:33,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:47:33,889 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:33,889 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:47:33,890 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:33,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:33,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-08-05 10:47:33,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:33,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 162 conjunts are in the unsatisfiable core [2019-08-05 10:47:33,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:34,896 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:47:34,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:34,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:47:34,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:47:34,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:47:34,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:47:34,897 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:47:34,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:34,983 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:47:34,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:47:34,984 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:47:34,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:34,985 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:47:34,985 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:47:34,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:47:34,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:47:34,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:47:34,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:47:34,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:47:34,988 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:47:34,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:34,989 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:47:34,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:47:34,989 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:47:34,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:47:34,989 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:34,989 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:47:34,990 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:34,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:34,990 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-08-05 10:47:34,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:35,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 166 conjunts are in the unsatisfiable core [2019-08-05 10:47:35,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:35,755 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:47:35,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:35,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:47:35,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:47:35,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:47:35,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:47:35,757 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:47:35,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:35,840 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:47:35,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:47:35,840 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:47:35,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:35,841 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:47:35,841 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:47:35,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:47:35,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:47:35,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:47:35,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:47:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:47:35,844 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:47:35,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:35,845 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:47:35,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:47:35,845 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:47:35,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:47:35,845 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:35,845 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:47:35,845 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:35,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:35,846 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-08-05 10:47:35,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:35,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 170 conjunts are in the unsatisfiable core [2019-08-05 10:47:35,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:36,641 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:47:36,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:36,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:47:36,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:47:36,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:47:36,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:47:36,643 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:47:36,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:36,700 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:47:36,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:47:36,700 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:47:36,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:36,701 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:47:36,701 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:47:36,703 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:47:36,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:47:36,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:47:36,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:47:36,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:47:36,705 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:47:36,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:36,705 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:47:36,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:47:36,706 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:47:36,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:47:36,706 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:36,706 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:47:36,706 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:36,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:36,707 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-08-05 10:47:36,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:36,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 174 conjunts are in the unsatisfiable core [2019-08-05 10:47:36,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:38,054 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:47:38,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:38,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:47:38,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:47:38,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:47:38,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:47:38,056 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:47:38,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:38,142 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:47:38,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:47:38,143 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:47:38,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:38,144 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:47:38,144 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:47:38,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:47:38,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:47:38,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:47:38,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:38,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:47:38,147 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:47:38,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:38,147 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:47:38,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:47:38,147 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:47:38,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:47:38,148 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:38,148 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:47:38,148 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:38,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:38,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-08-05 10:47:38,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:38,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 178 conjunts are in the unsatisfiable core [2019-08-05 10:47:38,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:39,309 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:47:39,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:39,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:47:39,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:47:39,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:47:39,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:47:39,310 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:47:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:39,388 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:47:39,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:47:39,388 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:47:39,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:39,389 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:47:39,389 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:47:39,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:47:39,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:47:39,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:47:39,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:47:39,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:47:39,392 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:47:39,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:39,393 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:47:39,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:47:39,393 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:47:39,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:47:39,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:39,394 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:47:39,394 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:39,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:39,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-08-05 10:47:39,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:39,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 182 conjunts are in the unsatisfiable core [2019-08-05 10:47:39,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:40,884 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:47:40,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:40,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:47:40,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:47:40,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:47:40,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:47:40,886 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:47:41,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:41,199 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:47:41,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:47:41,204 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:47:41,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:41,205 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:47:41,205 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:47:41,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:47:41,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:47:41,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:47:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:41,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:47:41,207 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:47:41,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:41,207 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:47:41,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:47:41,207 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:47:41,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:47:41,208 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:41,208 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:47:41,208 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:41,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:41,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-08-05 10:47:41,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:41,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 186 conjunts are in the unsatisfiable core [2019-08-05 10:47:41,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:42,110 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:47:42,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:42,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:47:42,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:47:42,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:47:42,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:47:42,112 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:47:42,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:42,189 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:47:42,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:47:42,189 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:47:42,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:42,190 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:47:42,190 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:47:42,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:47:42,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:47:42,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:47:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:47:42,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:47:42,193 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:47:42,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:42,193 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:47:42,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:47:42,193 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:47:42,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:47:42,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:42,194 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:47:42,194 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:42,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:42,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-08-05 10:47:42,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:42,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 190 conjunts are in the unsatisfiable core [2019-08-05 10:47:42,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:43,215 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:47:43,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:43,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:47:43,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:47:43,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:47:43,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:47:43,216 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:47:43,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:43,277 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:47:43,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:47:43,278 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:47:43,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:43,279 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:47:43,279 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:47:43,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:47:43,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:47:43,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:47:43,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:47:43,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:47:43,282 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:47:43,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:43,283 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:47:43,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:47:43,283 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:47:43,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:47:43,283 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:43,283 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:47:43,284 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:43,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:43,284 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-08-05 10:47:43,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:43,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 194 conjunts are in the unsatisfiable core [2019-08-05 10:47:43,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:44,530 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:47:44,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:44,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:47:44,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:47:44,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:47:44,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:47:44,531 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:47:44,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:44,611 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:47:44,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:47:44,611 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:47:44,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:44,612 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:47:44,612 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:47:44,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:47:44,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:47:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:47:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:47:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:47:44,615 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:47:44,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:44,616 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:47:44,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:47:44,616 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:47:44,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:47:44,616 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:44,617 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:47:44,617 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:44,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:44,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-08-05 10:47:44,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:44,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 198 conjunts are in the unsatisfiable core [2019-08-05 10:47:44,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:45,580 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:47:45,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:45,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:47:45,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:47:45,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:47:45,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:47:45,582 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:47:45,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:45,649 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:47:45,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:47:45,650 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:47:45,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:45,650 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:47:45,650 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:47:45,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:47:45,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:47:45,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:47:45,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:47:45,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:47:45,653 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:47:45,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:45,653 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:47:45,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:47:45,654 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:47:45,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:47:45,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:45,654 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:47:45,654 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:45,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:45,655 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-08-05 10:47:45,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:45,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 202 conjunts are in the unsatisfiable core [2019-08-05 10:47:45,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:46,664 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:47:46,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:46,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:47:46,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:47:46,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:47:46,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:47:46,666 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:47:46,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:46,749 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:47:46,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:47:46,750 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:47:46,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:46,751 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:47:46,752 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:47:46,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:47:46,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:47:46,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:47:46,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:47:46,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:47:46,754 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:47:46,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:46,754 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:47:46,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:47:46,754 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:47:46,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:47:46,754 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:46,755 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:47:46,755 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:46,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:46,755 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-08-05 10:47:46,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:46,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 206 conjunts are in the unsatisfiable core [2019-08-05 10:47:46,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:47,973 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:47:47,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:47,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:47:47,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:47:47,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:47:47,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:47:47,974 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:47:48,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:48,070 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:47:48,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:47:48,071 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:47:48,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:48,072 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:47:48,072 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:47:48,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:47:48,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:47:48,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:47:48,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:47:48,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:47:48,075 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:47:48,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:48,075 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:47:48,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:47:48,075 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:47:48,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:47:48,076 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:48,076 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:47:48,076 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:48,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:48,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-08-05 10:47:48,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:48,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 210 conjunts are in the unsatisfiable core [2019-08-05 10:47:48,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:49,552 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:47:49,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:49,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:47:49,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:47:49,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:47:49,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:47:49,553 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:47:49,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:49,639 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:47:49,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:47:49,639 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:47:49,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:49,640 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:47:49,640 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:47:49,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:47:49,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:47:49,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:47:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:47:49,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:47:49,644 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:47:49,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:49,645 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:47:49,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:47:49,645 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:47:49,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:47:49,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:49,645 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:47:49,646 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:49,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:49,646 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-08-05 10:47:49,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:49,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 214 conjunts are in the unsatisfiable core [2019-08-05 10:47:49,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:50,770 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:47:50,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:50,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:47:50,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:47:50,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:47:50,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:47:50,772 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:47:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:50,844 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:47:50,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:47:50,844 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:47:50,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:50,845 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:47:50,845 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:47:50,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:47:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:47:50,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:47:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:47:50,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:47:50,848 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:47:50,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:50,848 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:47:50,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:47:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:47:50,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:47:50,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:50,849 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:47:50,849 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:50,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:50,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-08-05 10:47:50,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:50,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 218 conjunts are in the unsatisfiable core [2019-08-05 10:47:50,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:52,037 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:47:52,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:52,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:47:52,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:47:52,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:47:52,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:47:52,039 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:47:52,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:52,126 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:47:52,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:47:52,127 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:47:52,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:52,128 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:47:52,128 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:47:52,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:47:52,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:47:52,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:47:52,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:47:52,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:47:52,130 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:47:52,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:52,131 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:47:52,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:47:52,131 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:47:52,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:47:52,131 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:52,131 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:47:52,132 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:52,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:52,132 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-08-05 10:47:52,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:52,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 222 conjunts are in the unsatisfiable core [2019-08-05 10:47:52,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:53,338 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:47:53,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:53,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:47:53,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:47:53,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:47:53,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:47:53,339 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:47:53,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:53,424 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:47:53,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:47:53,425 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:47:53,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:53,425 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:47:53,426 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:47:53,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:47:53,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:47:53,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:47:53,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:47:53,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:47:53,429 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:47:53,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:53,429 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:47:53,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:47:53,429 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:47:53,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:47:53,430 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:53,430 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:47:53,430 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:53,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:53,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-08-05 10:47:53,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:53,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 226 conjunts are in the unsatisfiable core [2019-08-05 10:47:53,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:54,884 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:47:54,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:54,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:47:54,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:47:54,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:47:54,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:47:54,886 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:47:54,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:54,965 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:47:54,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:47:54,966 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:47:54,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:54,967 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:47:54,967 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:47:54,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:47:54,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:47:54,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:47:54,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:47:54,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:47:54,970 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:47:54,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:54,970 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:47:54,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:47:54,971 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:47:54,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:47:54,971 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:54,971 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:47:54,971 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:54,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:54,972 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-08-05 10:47:54,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:55,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 230 conjunts are in the unsatisfiable core [2019-08-05 10:47:55,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:56,248 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:47:56,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:56,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:47:56,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:47:56,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:47:56,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:47:56,249 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:47:56,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:56,326 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:47:56,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:47:56,327 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:47:56,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:56,327 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:47:56,328 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:47:56,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:47:56,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:47:56,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:47:56,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:47:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:47:56,331 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:47:56,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:56,331 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:47:56,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:47:56,331 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:47:56,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:47:56,332 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:56,332 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:47:56,332 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:56,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:56,332 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-08-05 10:47:56,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:56,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 234 conjunts are in the unsatisfiable core [2019-08-05 10:47:56,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:57,766 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:47:57,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:57,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:47:57,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:47:57,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:47:57,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:47:57,767 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:47:57,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:57,845 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:47:57,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:47:57,845 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:47:57,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:57,846 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:47:57,846 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:47:57,847 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:47:57,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:47:57,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:47:57,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:47:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:47:57,849 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:47:57,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:57,849 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:47:57,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:47:57,850 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:47:57,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:47:57,850 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:57,850 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:47:57,850 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:57,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:57,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-08-05 10:47:57,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:57,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 238 conjunts are in the unsatisfiable core [2019-08-05 10:47:57,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:59,256 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:47:59,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:59,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:47:59,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:47:59,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:47:59,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:47:59,257 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:47:59,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:59,376 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:47:59,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:47:59,376 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:47:59,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:59,377 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:47:59,377 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:47:59,377 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:47:59,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:47:59,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:47:59,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:47:59,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:47:59,380 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:47:59,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:59,380 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:47:59,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:47:59,380 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:47:59,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:47:59,381 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:59,381 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:47:59,381 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:59,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:59,381 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-08-05 10:47:59,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:59,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 242 conjunts are in the unsatisfiable core [2019-08-05 10:47:59,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:00,986 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:48:00,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:00,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:48:00,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:48:00,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:48:00,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:48:00,987 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:48:01,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:01,084 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:48:01,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:48:01,085 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:48:01,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:01,086 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:48:01,086 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:48:01,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:48:01,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:48:01,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:48:01,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:48:01,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:48:01,088 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:48:01,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:01,088 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:48:01,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:48:01,088 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:48:01,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:48:01,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:01,089 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:48:01,089 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:01,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:01,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-08-05 10:48:01,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:01,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 246 conjunts are in the unsatisfiable core [2019-08-05 10:48:01,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:02,556 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:48:02,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:02,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:48:02,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:48:02,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:48:02,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:48:02,557 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:48:02,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:02,660 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:48:02,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:48:02,661 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:48:02,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:02,661 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:48:02,661 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:48:02,662 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:48:02,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:48:02,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:48:02,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:48:02,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:48:02,663 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:48:02,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:02,663 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:48:02,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:48:02,663 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:48:02,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:48:02,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:02,664 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:48:02,664 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:02,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:02,664 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-08-05 10:48:02,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:02,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 250 conjunts are in the unsatisfiable core [2019-08-05 10:48:02,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:04,119 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:48:04,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:04,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:48:04,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:48:04,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:48:04,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:48:04,121 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:48:04,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:04,225 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:48:04,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:48:04,225 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:48:04,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:04,226 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:48:04,226 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:48:04,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:48:04,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:48:04,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:48:04,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:48:04,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:48:04,229 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:48:04,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:04,229 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:48:04,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:48:04,229 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:48:04,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:48:04,230 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:04,230 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:48:04,230 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:04,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:04,231 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-08-05 10:48:04,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:04,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 254 conjunts are in the unsatisfiable core [2019-08-05 10:48:04,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:06,239 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:48:06,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:06,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:48:06,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:48:06,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:48:06,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:48:06,241 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:48:06,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:06,345 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:48:06,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:48:06,347 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:48:06,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:06,348 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:48:06,348 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:48:06,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:48:06,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:48:06,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:48:06,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:48:06,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:48:06,350 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:48:06,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:06,350 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:48:06,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:48:06,351 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:48:06,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:48:06,351 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:06,351 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:48:06,351 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:06,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:06,352 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-08-05 10:48:06,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:06,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 258 conjunts are in the unsatisfiable core [2019-08-05 10:48:06,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:08,013 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:48:08,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:08,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:48:08,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:48:08,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:48:08,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:48:08,014 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:48:08,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:08,125 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:48:08,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:48:08,125 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:48:08,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:08,126 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:48:08,126 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:48:08,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:48:08,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:48:08,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:48:08,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:48:08,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:48:08,130 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:48:08,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:08,130 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:48:08,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:48:08,131 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:48:08,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:48:08,131 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:08,131 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:48:08,132 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:08,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:08,132 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-08-05 10:48:08,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:08,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 262 conjunts are in the unsatisfiable core [2019-08-05 10:48:08,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:10,180 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:48:10,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:10,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:48:10,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:48:10,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:48:10,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:48:10,182 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:48:10,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:10,272 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:48:10,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:48:10,273 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:48:10,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:10,274 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:48:10,274 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:48:10,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:48:10,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:48:10,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:48:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:48:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:48:10,277 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:48:10,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:10,277 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:48:10,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:48:10,277 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:48:10,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:48:10,278 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:10,278 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:48:10,278 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:10,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:10,278 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-08-05 10:48:10,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:10,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 266 conjunts are in the unsatisfiable core [2019-08-05 10:48:10,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:13,488 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:48:13,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:13,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:48:13,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:48:13,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:48:13,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:48:13,490 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:48:13,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:13,589 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:48:13,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:48:13,590 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:48:13,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:13,590 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:48:13,591 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:48:13,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:48:13,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:48:13,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:48:13,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:48:13,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:48:13,593 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:48:13,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:13,593 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:48:13,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:48:13,594 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:48:13,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:48:13,594 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:13,594 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:48:13,594 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:13,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:13,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-08-05 10:48:13,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:13,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 270 conjunts are in the unsatisfiable core [2019-08-05 10:48:13,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:15,616 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:48:15,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:15,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:48:15,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:48:15,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:48:15,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:48:15,618 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:48:15,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:15,724 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:48:15,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:48:15,724 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:48:15,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:15,725 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:48:15,725 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:48:15,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:48:15,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:48:15,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:48:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:48:15,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:48:15,727 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:48:15,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:15,727 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:48:15,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:48:15,728 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:48:15,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:48:15,728 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:15,728 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:48:15,728 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:15,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:15,729 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-08-05 10:48:15,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:15,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 274 conjunts are in the unsatisfiable core [2019-08-05 10:48:15,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:17,538 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:48:17,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:17,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:48:17,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:48:17,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:48:17,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:48:17,539 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:48:17,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:17,653 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:48:17,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:48:17,653 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:48:17,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:17,654 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:48:17,654 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:48:17,655 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:48:17,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:48:17,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:48:17,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:48:17,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:48:17,657 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:48:17,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:17,658 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:48:17,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:48:17,658 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:48:17,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:48:17,658 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:17,658 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:48:17,659 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:17,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:17,659 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-08-05 10:48:17,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:17,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 278 conjunts are in the unsatisfiable core [2019-08-05 10:48:17,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:19,513 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:48:19,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:19,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:48:19,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:48:19,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:48:19,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:48:19,515 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:48:19,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:19,622 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:48:19,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:48:19,622 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:48:19,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:19,623 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:48:19,623 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:48:19,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:48:19,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:48:19,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:48:19,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:48:19,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:48:19,626 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:48:19,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:19,627 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:48:19,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:48:19,627 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:48:19,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:48:19,627 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:19,628 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:48:19,628 INFO L418 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:19,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:19,628 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-08-05 10:48:19,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:19,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 282 conjunts are in the unsatisfiable core [2019-08-05 10:48:19,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:21,815 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:48:21,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:21,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:48:21,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:48:21,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:48:21,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:48:21,817 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:48:21,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:21,949 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:48:21,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:48:21,949 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:48:21,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:21,950 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:48:21,951 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:48:21,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:48:21,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:48:21,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:48:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:48:21,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:48:21,953 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:48:21,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:21,954 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:48:21,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:48:21,954 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:48:21,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:48:21,954 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:21,954 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:48:21,955 INFO L418 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:21,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:21,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-08-05 10:48:21,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:22,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 286 conjunts are in the unsatisfiable core [2019-08-05 10:48:22,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:23,849 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:48:23,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:23,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:48:23,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:48:23,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:48:23,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:48:23,851 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:48:23,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:23,952 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:48:23,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:48:23,952 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:48:23,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:23,953 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:48:23,953 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:48:23,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:48:23,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:48:23,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:48:23,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:48:23,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:48:23,957 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:48:23,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:23,957 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:48:23,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:48:23,957 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:48:23,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:48:23,958 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:23,958 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:48:23,958 INFO L418 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:23,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:23,959 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-08-05 10:48:23,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:24,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 290 conjunts are in the unsatisfiable core [2019-08-05 10:48:24,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:26,284 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:48:26,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:26,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:48:26,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:48:26,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:48:26,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:48:26,286 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:48:26,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:26,404 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:48:26,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:48:26,404 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:48:26,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:26,405 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:48:26,405 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:48:26,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:48:26,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:48:26,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:48:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:48:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:48:26,407 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:48:26,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:26,408 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:48:26,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:48:26,408 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:48:26,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:48:26,409 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:26,409 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:48:26,409 INFO L418 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:26,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:26,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-08-05 10:48:26,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:26,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 294 conjunts are in the unsatisfiable core [2019-08-05 10:48:26,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:28,741 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:48:28,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:28,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:48:28,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:48:28,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:48:28,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:48:28,742 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:48:28,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:28,846 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:48:28,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:48:28,847 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:48:28,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:28,848 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:48:28,848 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:48:28,848 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:48:28,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:48:28,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:48:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:48:28,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:48:28,851 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:48:28,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:28,851 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:48:28,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:48:28,852 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:48:28,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:48:28,852 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:28,853 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:48:28,853 INFO L418 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:28,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:28,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-08-05 10:48:28,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:28,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 298 conjunts are in the unsatisfiable core [2019-08-05 10:48:28,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:31,443 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:48:31,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:31,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:48:31,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:48:31,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:48:31,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:48:31,445 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:48:31,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:31,543 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:48:31,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:48:31,544 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:48:31,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:31,545 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:48:31,545 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:48:31,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:48:31,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:48:31,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:48:31,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:48:31,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:48:31,548 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:48:31,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:31,548 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:48:31,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:48:31,549 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:48:31,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:48:31,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:31,549 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:48:31,549 INFO L418 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:31,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:31,550 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-08-05 10:48:31,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:31,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 302 conjunts are in the unsatisfiable core [2019-08-05 10:48:31,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:33,681 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:48:33,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:33,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:48:33,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:48:33,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:48:33,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:48:33,683 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:48:33,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:33,796 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:48:33,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:48:33,797 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:48:33,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:33,798 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:48:33,798 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:48:33,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:48:33,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:48:33,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:48:33,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:48:33,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:48:33,800 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:48:33,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:33,800 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:48:33,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:48:33,801 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:48:33,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:48:33,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:33,801 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:48:33,801 INFO L418 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:33,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:33,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-08-05 10:48:33,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:33,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 306 conjunts are in the unsatisfiable core [2019-08-05 10:48:33,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:36,201 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:48:36,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:36,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:48:36,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:48:36,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:48:36,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:48:36,202 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:48:36,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:36,315 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:48:36,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:48:36,315 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:48:36,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:36,316 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:48:36,316 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:48:36,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:48:36,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:48:36,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:48:36,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:48:36,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:48:36,319 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:48:36,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:36,319 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:48:36,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:48:36,319 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:48:36,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:48:36,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:36,320 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:48:36,320 INFO L418 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:36,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:36,321 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-08-05 10:48:36,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:36,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 310 conjunts are in the unsatisfiable core [2019-08-05 10:48:36,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:38,871 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:48:38,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:38,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:48:38,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:48:38,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:48:38,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:48:38,872 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:48:39,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:39,409 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:48:39,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:48:39,409 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:48:39,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:39,410 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:48:39,410 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:48:39,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:48:39,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:48:39,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:48:39,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:48:39,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:48:39,414 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:48:39,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:39,414 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:48:39,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:48:39,414 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:48:39,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:48:39,415 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:39,415 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:48:39,415 INFO L418 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:39,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:39,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-08-05 10:48:39,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:39,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 314 conjunts are in the unsatisfiable core [2019-08-05 10:48:39,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:41,842 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:48:41,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:41,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:48:41,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:48:41,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:48:41,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:48:41,844 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:48:42,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:42,023 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:48:42,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:48:42,023 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:48:42,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:42,024 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:48:42,024 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:48:42,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:48:42,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:48:42,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:48:42,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:48:42,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:48:42,028 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:48:42,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:42,028 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:48:42,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:48:42,029 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:48:42,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:48:42,029 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:42,030 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:48:42,030 INFO L418 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:42,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:42,030 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-08-05 10:48:42,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:42,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 318 conjunts are in the unsatisfiable core [2019-08-05 10:48:42,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:44,316 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:48:44,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:44,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:48:44,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:48:44,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:48:44,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:48:44,318 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:48:44,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:44,439 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:48:44,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:48:44,440 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:48:44,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:44,441 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:48:44,441 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:48:44,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:48:44,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:48:44,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:48:44,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:48:44,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:48:44,443 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:48:44,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:44,443 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:48:44,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:48:44,443 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:48:44,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:48:44,444 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:44,444 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:48:44,444 INFO L418 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:44,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:44,444 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-08-05 10:48:44,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:44,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 322 conjunts are in the unsatisfiable core [2019-08-05 10:48:44,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:47,060 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:48:47,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:47,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:48:47,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:48:47,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:48:47,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:48:47,062 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:48:47,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:47,183 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:48:47,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:48:47,183 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:48:47,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:47,184 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:48:47,184 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:48:47,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:48:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:48:47,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:48:47,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:48:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:48:47,186 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:48:47,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:47,186 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:48:47,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:48:47,187 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:48:47,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:48:47,187 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:47,187 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:48:47,187 INFO L418 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:47,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:47,188 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-08-05 10:48:47,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:47,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 326 conjunts are in the unsatisfiable core [2019-08-05 10:48:47,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:49,577 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:48:49,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:49,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:48:49,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:48:49,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:48:49,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:48:49,578 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 10:48:49,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:49,866 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:48:49,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:48:49,867 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:48:49,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:49,868 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:48:49,868 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:48:49,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:48:49,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:48:49,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:48:49,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:48:49,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:48:49,871 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:48:49,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:49,871 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:48:49,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:48:49,873 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:48:49,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:48:49,874 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:49,874 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 10:48:49,874 INFO L418 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:49,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:49,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-08-05 10:48:49,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:49,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 330 conjunts are in the unsatisfiable core [2019-08-05 10:48:49,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:52,747 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:48:52,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:52,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:48:52,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:48:52,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:48:52,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:48:52,749 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-08-05 10:48:52,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:52,871 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:48:52,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:48:52,871 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-05 10:48:52,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:52,872 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:48:52,872 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:48:52,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:48:52,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:48:52,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:48:52,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:48:52,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:48:52,875 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 10:48:52,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:52,876 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:48:52,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:48:52,876 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:48:52,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:48:52,877 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:52,877 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-05 10:48:52,877 INFO L418 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:52,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:52,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-08-05 10:48:52,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:52,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 334 conjunts are in the unsatisfiable core [2019-08-05 10:48:52,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:55,397 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:48:55,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:55,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:48:55,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:48:55,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:48:55,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:48:55,399 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-08-05 10:48:55,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:55,650 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:48:55,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:48:55,650 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-05 10:48:55,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:55,651 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:48:55,651 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:48:55,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:48:55,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:48:55,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:48:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:48:55,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:48:55,652 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-05 10:48:55,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:55,653 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:48:55,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:48:55,653 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:48:55,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:48:55,653 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:55,653 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-05 10:48:55,653 INFO L418 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:55,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:55,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-08-05 10:48:55,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:55,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 338 conjunts are in the unsatisfiable core [2019-08-05 10:48:55,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:58,674 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:48:58,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:58,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:48:58,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:48:58,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:48:58,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:48:58,676 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-08-05 10:48:58,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:58,804 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:48:58,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:48:58,804 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-05 10:48:58,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:58,805 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:48:58,805 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:48:58,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:48:58,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:48:58,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:48:58,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:48:58,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:48:58,808 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-05 10:48:58,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:58,808 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:48:58,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:48:58,809 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:48:58,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:48:58,809 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:58,809 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-05 10:48:58,810 INFO L418 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:58,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:58,810 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-08-05 10:48:58,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:58,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 342 conjunts are in the unsatisfiable core [2019-08-05 10:48:58,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:02,386 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:49:02,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:02,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:49:02,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:49:02,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:49:02,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:49:02,388 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-08-05 10:49:02,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:02,602 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:49:02,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:49:02,603 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-05 10:49:02,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:02,604 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:49:02,604 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:49:02,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:49:02,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:49:02,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:49:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:49:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:49:02,607 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-05 10:49:02,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:02,607 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:49:02,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:49:02,608 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:49:02,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:49:02,609 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:02,609 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-05 10:49:02,609 INFO L418 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:02,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:02,609 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-08-05 10:49:02,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:02,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 346 conjunts are in the unsatisfiable core [2019-08-05 10:49:02,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:05,272 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:49:05,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:05,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:49:05,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:49:05,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:49:05,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:49:05,274 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-08-05 10:49:05,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:05,416 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 10:49:05,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:49:05,417 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-08-05 10:49:05,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:05,417 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:49:05,417 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:49:05,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:49:05,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:49:05,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:49:05,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:49:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:49:05,419 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-05 10:49:05,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:05,419 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:49:05,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:49:05,419 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:49:05,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:49:05,420 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:05,420 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-08-05 10:49:05,420 INFO L418 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:05,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:05,420 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-08-05 10:49:05,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:05,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 350 conjunts are in the unsatisfiable core [2019-08-05 10:49:05,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:08,515 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:49:08,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:08,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:49:08,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:49:08,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:49:08,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:49:08,517 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-08-05 10:49:08,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:08,642 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:49:08,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:49:08,643 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-08-05 10:49:08,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:08,644 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:49:08,644 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:49:08,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:49:08,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:49:08,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:49:08,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:49:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:49:08,646 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-05 10:49:08,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:08,646 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:49:08,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:49:08,646 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:49:08,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:49:08,647 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:08,647 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-05 10:49:08,647 INFO L418 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:08,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:08,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-08-05 10:49:08,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:08,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 354 conjunts are in the unsatisfiable core [2019-08-05 10:49:08,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:11,745 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:49:11,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:11,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:49:11,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:49:11,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:49:11,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:49:11,747 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-08-05 10:49:11,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:11,881 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 10:49:11,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:49:11,881 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-05 10:49:11,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:11,882 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:49:11,882 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:49:11,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:49:11,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:49:11,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:49:11,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:49:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:49:11,884 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-05 10:49:11,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:11,884 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:49:11,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:49:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:49:11,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:49:11,884 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:11,884 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-08-05 10:49:11,885 INFO L418 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:11,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:11,885 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-08-05 10:49:11,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:12,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 358 conjunts are in the unsatisfiable core [2019-08-05 10:49:12,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:14,784 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:49:14,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:14,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:49:14,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:49:14,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:49:14,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:49:14,785 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-08-05 10:49:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:15,407 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:49:15,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:49:15,408 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-05 10:49:15,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:15,408 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:49:15,408 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:49:15,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:49:15,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:49:15,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:49:15,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:49:15,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 10:49:15,410 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-05 10:49:15,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:15,410 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 10:49:15,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:49:15,410 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 10:49:15,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:49:15,411 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:15,411 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-08-05 10:49:15,411 INFO L418 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:15,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:15,411 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-08-05 10:49:15,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:15,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 362 conjunts are in the unsatisfiable core [2019-08-05 10:49:15,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:18,604 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:49:18,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:18,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:49:18,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:49:18,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:49:18,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:49:18,605 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-08-05 10:49:18,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:18,730 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 10:49:18,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:49:18,730 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-08-05 10:49:18,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:18,731 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:49:18,732 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:49:18,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:49:18,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:49:18,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:49:18,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:49:18,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:49:18,735 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-05 10:49:18,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:18,735 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:49:18,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:49:18,735 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:49:18,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:49:18,736 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:18,736 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-08-05 10:49:18,736 INFO L418 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:18,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:18,736 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-08-05 10:49:18,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:18,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 926 conjuncts, 366 conjunts are in the unsatisfiable core [2019-08-05 10:49:18,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:21,940 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:49:21,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:21,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:49:21,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:49:21,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:49:21,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:49:21,942 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-08-05 10:49:22,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:22,076 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:49:22,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:49:22,076 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-08-05 10:49:22,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:22,077 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:49:22,077 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:49:22,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:49:22,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:49:22,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 10:49:22,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:49:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 10:49:22,080 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-05 10:49:22,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:22,080 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 10:49:22,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:49:22,080 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 10:49:22,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:49:22,081 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:22,081 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-08-05 10:49:22,081 INFO L418 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:22,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:22,082 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-08-05 10:49:22,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:22,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 370 conjunts are in the unsatisfiable core [2019-08-05 10:49:22,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:25,121 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:49:25,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:25,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:49:25,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:49:25,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:49:25,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:49:25,123 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-08-05 10:49:25,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:25,283 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 10:49:25,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:49:25,284 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-08-05 10:49:25,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:25,284 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:49:25,285 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:49:25,285 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:49:25,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:49:25,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:49:25,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:49:25,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:49:25,287 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-08-05 10:49:25,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:25,288 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:49:25,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:49:25,288 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:49:25,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:49:25,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:25,289 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-08-05 10:49:25,289 INFO L418 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:25,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:25,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-08-05 10:49:25,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:25,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 946 conjuncts, 374 conjunts are in the unsatisfiable core [2019-08-05 10:49:25,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:28,587 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:49:28,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:28,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:49:28,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:49:28,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:49:28,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:49:28,588 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-08-05 10:49:28,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:28,722 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:49:28,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:49:28,723 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-08-05 10:49:28,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:28,723 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:49:28,724 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:49:28,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:49:28,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:49:28,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:49:28,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:49:28,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 10:49:28,726 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-08-05 10:49:28,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:28,727 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 10:49:28,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:49:28,727 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 10:49:28,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:49:28,728 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:28,728 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-08-05 10:49:28,728 INFO L418 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:28,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:28,728 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-08-05 10:49:28,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:28,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 956 conjuncts, 378 conjunts are in the unsatisfiable core [2019-08-05 10:49:28,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:32,652 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:49:32,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:32,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:49:32,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:49:32,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:49:32,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:49:32,654 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-08-05 10:49:32,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:32,802 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 10:49:32,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:49:32,803 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-08-05 10:49:32,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:32,804 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:49:32,804 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:49:32,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:49:32,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:49:32,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:49:32,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:49:32,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 10:49:32,805 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-08-05 10:49:32,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:32,806 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 10:49:32,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:49:32,806 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 10:49:32,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:49:32,807 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:32,807 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-08-05 10:49:32,807 INFO L418 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:32,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:32,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-08-05 10:49:32,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:32,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 382 conjunts are in the unsatisfiable core [2019-08-05 10:49:32,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:36,028 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:49:36,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:36,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:49:36,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:49:36,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:49:36,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:49:36,030 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-08-05 10:49:36,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:36,173 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:49:36,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:49:36,173 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-08-05 10:49:36,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:36,174 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:49:36,174 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:49:36,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:49:36,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:49:36,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:49:36,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:49:36,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:49:36,176 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-08-05 10:49:36,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:36,176 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:49:36,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:49:36,176 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:49:36,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:49:36,177 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:36,177 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 10:49:36,177 INFO L418 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:36,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:36,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-08-05 10:49:36,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:36,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 976 conjuncts, 386 conjunts are in the unsatisfiable core [2019-08-05 10:49:36,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:39,669 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:49:39,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:39,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:49:39,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:49:39,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:49:39,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:49:39,671 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-05 10:49:39,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:39,841 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 10:49:39,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:49:39,842 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 10:49:39,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:39,843 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:49:39,843 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:49:39,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:49:39,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:49:39,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:49:39,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:49:39,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:49:39,845 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-08-05 10:49:39,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:39,845 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:49:39,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:49:39,845 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:49:39,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:49:39,846 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:39,846 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-08-05 10:49:39,846 INFO L418 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:39,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:39,846 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-08-05 10:49:39,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:39,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 390 conjunts are in the unsatisfiable core [2019-08-05 10:49:39,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:43,508 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:49:43,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:43,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:49:43,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:49:43,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:49:43,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:49:43,510 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-08-05 10:49:43,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:43,832 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:49:43,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:49:43,833 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-08-05 10:49:43,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:43,833 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:49:43,833 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:49:43,834 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:49:43,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:49:43,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 10:49:43,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:49:43,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 10:49:43,835 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-08-05 10:49:43,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:43,836 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 10:49:43,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:49:43,836 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 10:49:43,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:49:43,836 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:43,836 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-08-05 10:49:43,836 INFO L418 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:43,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:43,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-08-05 10:49:43,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:43,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 394 conjunts are in the unsatisfiable core [2019-08-05 10:49:43,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:47,481 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:49:47,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:47,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:49:47,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:49:47,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:49:47,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:49:47,483 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-08-05 10:49:47,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:47,634 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 10:49:47,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:49:47,635 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-08-05 10:49:47,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:47,635 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:49:47,636 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:49:47,636 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:49:47,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:49:47,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:49:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:49:47,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 10:49:47,638 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-08-05 10:49:47,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:47,638 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 10:49:47,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:49:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 10:49:47,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:49:47,639 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:47,639 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-08-05 10:49:47,640 INFO L418 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:47,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:47,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-08-05 10:49:47,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:47,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 1006 conjuncts, 398 conjunts are in the unsatisfiable core [2019-08-05 10:49:47,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:51,172 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:49:51,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:51,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:49:51,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:49:51,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:49:51,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:49:51,174 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-08-05 10:49:51,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:51,350 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:49:51,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:49:51,350 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-08-05 10:49:51,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:51,351 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:49:51,351 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:49:51,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:49:51,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:49:51,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 10:49:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:49:51,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 10:49:51,353 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-08-05 10:49:51,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:51,354 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 10:49:51,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:49:51,354 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 10:49:51,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:49:51,354 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:51,354 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-08-05 10:49:51,354 INFO L418 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:51,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:51,355 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-08-05 10:49:51,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:51,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 402 conjunts are in the unsatisfiable core [2019-08-05 10:49:51,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:55,109 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:49:55,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:55,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 10:49:55,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 10:49:55,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 10:49:55,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:49:55,112 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-08-05 10:49:55,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:55,280 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 10:49:55,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:49:55,281 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-08-05 10:49:55,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:55,282 INFO L225 Difference]: With dead ends: 105 [2019-08-05 10:49:55,282 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:49:55,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:49:55,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:49:55,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 10:49:55,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:49:55,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 10:49:55,286 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-08-05 10:49:55,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:55,286 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 10:49:55,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 10:49:55,286 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 10:49:55,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:49:55,287 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:55,287 INFO L399 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-08-05 10:49:55,287 INFO L418 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:55,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:55,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-08-05 10:49:55,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:55,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 406 conjunts are in the unsatisfiable core [2019-08-05 10:49:55,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:59,185 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:49:59,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:49:59,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 10:49:59,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 10:49:59,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 10:49:59,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:49:59,188 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-08-05 10:49:59,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:59,366 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 10:49:59,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 10:49:59,367 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-08-05 10:49:59,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:59,368 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:49:59,368 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:49:59,369 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:49:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:49:59,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 10:49:59,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:49:59,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 10:49:59,370 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-08-05 10:49:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:59,371 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 10:49:59,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 10:49:59,371 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 10:49:59,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:49:59,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:59,372 INFO L399 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-08-05 10:49:59,372 INFO L418 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:59,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:59,372 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-08-05 10:49:59,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:59,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 410 conjunts are in the unsatisfiable core [2019-08-05 10:49:59,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:03,471 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:50:03,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:03,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 10:50:03,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 10:50:03,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 10:50:03,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:50:03,474 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-08-05 10:50:03,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:03,717 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 10:50:03,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 10:50:03,718 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-08-05 10:50:03,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:03,718 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:50:03,719 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:50:03,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:50:03,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:50:03,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:50:03,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:50:03,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 10:50:03,721 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-08-05 10:50:03,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:03,722 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 10:50:03,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 10:50:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 10:50:03,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:50:03,722 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:03,723 INFO L399 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-08-05 10:50:03,723 INFO L418 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:03,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:03,723 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-08-05 10:50:03,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:03,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 1046 conjuncts, 414 conjunts are in the unsatisfiable core [2019-08-05 10:50:03,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:07,741 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:50:07,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:07,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 10:50:07,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 10:50:07,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 10:50:07,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:50:07,743 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-08-05 10:50:07,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:07,942 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 10:50:07,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 10:50:07,943 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-08-05 10:50:07,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:07,944 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:50:07,944 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:50:07,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:50:07,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:50:07,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 10:50:07,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:50:07,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 10:50:07,947 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-08-05 10:50:07,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:07,947 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 10:50:07,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 10:50:07,947 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 10:50:07,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:50:07,948 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:07,948 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-08-05 10:50:07,948 INFO L418 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:07,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:07,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-08-05 10:50:07,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:08,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 1056 conjuncts, 418 conjunts are in the unsatisfiable core [2019-08-05 10:50:08,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:11,886 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:50:11,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:11,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 10:50:11,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 10:50:11,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 10:50:11,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:50:11,888 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-08-05 10:50:12,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:12,100 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 10:50:12,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 10:50:12,100 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-08-05 10:50:12,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:12,100 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:50:12,101 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:50:12,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:50:12,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:50:12,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:50:12,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:50:12,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 10:50:12,102 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-08-05 10:50:12,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:12,103 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 10:50:12,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 10:50:12,103 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 10:50:12,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:50:12,103 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:12,103 INFO L399 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-08-05 10:50:12,104 INFO L418 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:12,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:12,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-08-05 10:50:12,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:12,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 422 conjunts are in the unsatisfiable core [2019-08-05 10:50:12,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:16,453 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:50:16,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:16,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 10:50:16,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 10:50:16,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 10:50:16,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:50:16,454 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-08-05 10:50:16,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:16,649 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 10:50:16,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 10:50:16,650 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-08-05 10:50:16,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:16,651 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:50:16,651 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:50:16,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:50:16,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:50:16,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 10:50:16,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:50:16,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 10:50:16,653 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-08-05 10:50:16,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:16,653 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 10:50:16,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 10:50:16,654 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 10:50:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 10:50:16,654 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:16,654 INFO L399 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-08-05 10:50:16,655 INFO L418 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:16,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:16,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-08-05 10:50:16,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:16,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 426 conjunts are in the unsatisfiable core [2019-08-05 10:50:16,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:20,944 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:50:20,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:20,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 10:50:20,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 10:50:20,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 10:50:20,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:50:20,947 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-08-05 10:50:21,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:21,137 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 10:50:21,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 10:50:21,138 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-08-05 10:50:21,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:21,138 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:50:21,138 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:50:21,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:50:21,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:50:21,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 10:50:21,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:50:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 10:50:21,142 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-08-05 10:50:21,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:21,142 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 10:50:21,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 10:50:21,143 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 10:50:21,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:50:21,143 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:21,144 INFO L399 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-08-05 10:50:21,144 INFO L418 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:21,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:21,144 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-08-05 10:50:21,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:21,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 1086 conjuncts, 430 conjunts are in the unsatisfiable core [2019-08-05 10:50:21,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:25,432 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:50:25,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:25,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 10:50:25,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 10:50:25,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 10:50:25,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:50:25,434 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-08-05 10:50:25,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:25,637 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 10:50:25,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 10:50:25,637 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-08-05 10:50:25,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:25,638 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:50:25,638 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:50:25,639 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:50:25,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:50:25,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 10:50:25,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:50:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 10:50:25,641 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-08-05 10:50:25,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:25,642 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 10:50:25,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 10:50:25,642 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 10:50:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:50:25,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:25,642 INFO L399 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-08-05 10:50:25,643 INFO L418 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:25,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:25,643 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-08-05 10:50:25,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:25,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 434 conjunts are in the unsatisfiable core [2019-08-05 10:50:25,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:29,843 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:50:29,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:29,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 10:50:29,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 10:50:29,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 10:50:29,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:50:29,846 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-08-05 10:50:30,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:30,022 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 10:50:30,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 10:50:30,022 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-08-05 10:50:30,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:30,023 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:50:30,023 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:50:30,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:50:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:50:30,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 10:50:30,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:50:30,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 10:50:30,026 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-08-05 10:50:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:30,026 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 10:50:30,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 10:50:30,027 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 10:50:30,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:50:30,027 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:30,027 INFO L399 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-08-05 10:50:30,028 INFO L418 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:30,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:30,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-08-05 10:50:30,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:30,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 1106 conjuncts, 438 conjunts are in the unsatisfiable core [2019-08-05 10:50:30,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:34,440 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:50:34,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:34,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 10:50:34,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 10:50:34,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 10:50:34,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:50:34,442 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-08-05 10:50:34,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:34,672 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 10:50:34,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 10:50:34,672 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-08-05 10:50:34,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:34,672 INFO L225 Difference]: With dead ends: 114 [2019-08-05 10:50:34,673 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:50:34,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:50:34,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:50:34,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 10:50:34,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 10:50:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 10:50:34,675 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-08-05 10:50:34,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:34,675 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 10:50:34,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 10:50:34,675 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 10:50:34,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 10:50:34,676 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:34,676 INFO L399 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-08-05 10:50:34,676 INFO L418 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:34,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:34,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-08-05 10:50:34,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:34,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 1116 conjuncts, 442 conjunts are in the unsatisfiable core [2019-08-05 10:50:34,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:39,203 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:50:39,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:39,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 10:50:39,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 10:50:39,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 10:50:39,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:50:39,205 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-08-05 10:50:39,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:39,392 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 10:50:39,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 10:50:39,392 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-08-05 10:50:39,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:39,392 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:50:39,392 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:50:39,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:50:39,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:50:39,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 10:50:39,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:50:39,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 10:50:39,395 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-08-05 10:50:39,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:39,395 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 10:50:39,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 10:50:39,395 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 10:50:39,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:50:39,396 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:39,396 INFO L399 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-08-05 10:50:39,396 INFO L418 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:39,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:39,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1736874868, now seen corresponding path program 111 times [2019-08-05 10:50:39,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:39,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 446 conjunts are in the unsatisfiable core [2019-08-05 10:50:39,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:44,253 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:50:44,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:44,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 10:50:44,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 10:50:44,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 10:50:44,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:50:44,256 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2019-08-05 10:50:44,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:44,446 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:50:44,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 10:50:44,447 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2019-08-05 10:50:44,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:44,447 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:50:44,447 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:50:44,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:50:44,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:50:44,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 10:50:44,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:50:44,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 10:50:44,451 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2019-08-05 10:50:44,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:44,451 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 10:50:44,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 10:50:44,451 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 10:50:44,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 10:50:44,452 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:44,452 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2019-08-05 10:50:44,452 INFO L418 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:44,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:44,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1991455747, now seen corresponding path program 112 times [2019-08-05 10:50:44,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:44,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 450 conjunts are in the unsatisfiable core [2019-08-05 10:50:44,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:49,292 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:50:49,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:49,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 10:50:49,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 10:50:49,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 10:50:49,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:50:49,294 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2019-08-05 10:50:49,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:49,525 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 10:50:49,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 10:50:49,526 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2019-08-05 10:50:49,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:49,526 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:50:49,526 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:50:49,527 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:50:49,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:50:49,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 10:50:49,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:50:49,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 10:50:49,528 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2019-08-05 10:50:49,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:49,528 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 10:50:49,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 10:50:49,528 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 10:50:49,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:50:49,529 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:49,529 INFO L399 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2019-08-05 10:50:49,529 INFO L418 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:49,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:49,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1605587820, now seen corresponding path program 113 times [2019-08-05 10:50:49,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:49,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 1146 conjuncts, 454 conjunts are in the unsatisfiable core [2019-08-05 10:50:49,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:54,352 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:50:54,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:54,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 10:50:54,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 10:50:54,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 10:50:54,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:50:54,354 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2019-08-05 10:50:54,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:54,556 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 10:50:54,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 10:50:54,557 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2019-08-05 10:50:54,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:54,557 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:50:54,557 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:50:54,558 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:50:54,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:50:54,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 10:50:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:50:54,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 10:50:54,560 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2019-08-05 10:50:54,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:54,560 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 10:50:54,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 10:50:54,561 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 10:50:54,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 10:50:54,561 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:54,562 INFO L399 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2019-08-05 10:50:54,562 INFO L418 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:54,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:54,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1766383325, now seen corresponding path program 114 times [2019-08-05 10:50:54,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:54,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 1156 conjuncts, 458 conjunts are in the unsatisfiable core [2019-08-05 10:50:54,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:50:59,416 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:50:59,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:50:59,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-05 10:50:59,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-05 10:50:59,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-05 10:50:59,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:50:59,418 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 117 states. [2019-08-05 10:50:59,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:50:59,617 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 10:50:59,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-05 10:50:59,618 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 117 [2019-08-05 10:50:59,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:50:59,618 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:50:59,618 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:50:59,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:50:59,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:50:59,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 10:50:59,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:50:59,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 10:50:59,621 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2019-08-05 10:50:59,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:50:59,622 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 10:50:59,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-05 10:50:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 10:50:59,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 10:50:59,622 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:50:59,622 INFO L399 BasicCegarLoop]: trace histogram [115, 1, 1, 1] [2019-08-05 10:50:59,623 INFO L418 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:50:59,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:50:59,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1076693580, now seen corresponding path program 115 times [2019-08-05 10:50:59,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:50:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:50:59,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 1166 conjuncts, 462 conjunts are in the unsatisfiable core [2019-08-05 10:50:59,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:51:04,583 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:51:04,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:51:04,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-08-05 10:51:04,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-08-05 10:51:04,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-08-05 10:51:04,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:51:04,585 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 118 states. [2019-08-05 10:51:04,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:51:04,815 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 10:51:04,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-08-05 10:51:04,815 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 118 [2019-08-05 10:51:04,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:51:04,816 INFO L225 Difference]: With dead ends: 120 [2019-08-05 10:51:04,816 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 10:51:04,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:51:04,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 10:51:04,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-08-05 10:51:04,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 10:51:04,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 10:51:04,819 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2019-08-05 10:51:04,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:51:04,820 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 10:51:04,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-08-05 10:51:04,820 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 10:51:04,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 10:51:04,820 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:51:04,820 INFO L399 BasicCegarLoop]: trace histogram [116, 1, 1, 1] [2019-08-05 10:51:04,820 INFO L418 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:51:04,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:51:04,821 INFO L82 PathProgramCache]: Analyzing trace with hash -982235581, now seen corresponding path program 116 times [2019-08-05 10:51:04,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:51:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:51:04,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 466 conjunts are in the unsatisfiable core [2019-08-05 10:51:04,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:51:07,473 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:51:07,473 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:51:07,477 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:51:07,477 INFO L202 PluginConnector]: Adding new model functions1.i_3.bplTransformedIcfg_BEv2_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:51:07 BoogieIcfgContainer [2019-08-05 10:51:07,478 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:51:07,480 INFO L168 Benchmark]: Toolchain (without parser) took 239258.30 ms. Allocated memory was 134.7 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 112.2 MB in the beginning and 464.4 MB in the end (delta: -352.2 MB). Peak memory consumption was 648.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:51:07,480 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 134.7 MB. Free memory was 113.4 MB in the beginning and 113.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:51:07,481 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.46 ms. Allocated memory is still 134.7 MB. Free memory was 112.0 MB in the beginning and 110.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:51:07,481 INFO L168 Benchmark]: Boogie Preprocessor took 18.84 ms. Allocated memory is still 134.7 MB. Free memory was 110.4 MB in the beginning and 109.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:51:07,482 INFO L168 Benchmark]: RCFGBuilder took 333.91 ms. Allocated memory is still 134.7 MB. Free memory was 109.2 MB in the beginning and 99.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:51:07,482 INFO L168 Benchmark]: TraceAbstraction took 238864.21 ms. Allocated memory was 134.7 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 99.6 MB in the beginning and 464.4 MB in the end (delta: -364.8 MB). Peak memory consumption was 635.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:51:07,485 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.21 ms. Allocated memory is still 134.7 MB. Free memory was 113.4 MB in the beginning and 113.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.46 ms. Allocated memory is still 134.7 MB. Free memory was 112.0 MB in the beginning and 110.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 18.84 ms. Allocated memory is still 134.7 MB. Free memory was 110.4 MB in the beginning and 109.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 333.91 ms. Allocated memory is still 134.7 MB. Free memory was 109.2 MB in the beginning and 99.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 238864.21 ms. Allocated memory was 134.7 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 99.6 MB in the beginning and 464.4 MB in the end (delta: -364.8 MB). Peak memory consumption was 635.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 120 with TraceHistMax 116,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 87 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 238.8s OverallTime, 117 OverallIterations, 116 TraceHistogramMax, 14.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 348 SDtfs, 0 SDslu, 1862 SDs, 0 SdLazy, 8764 SolverSat, 220 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6902 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6786 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 210.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=116, 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, 116 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 5.5s SatisfiabilityAnalysisTime, 215.3s InterpolantComputationTime, 7018 NumberOfCodeBlocks, 7018 NumberOfCodeBlocksAsserted, 116 NumberOfCheckSat, 6902 ConstructedInterpolants, 0 QuantifiedInterpolants, 1608398 SizeOfPredicates, 20126 NumberOfNonLiveVariables, 68556 ConjunctsInSsa, 26912 ConjunctsInUnsatCore, 116 InterpolantComputations, 1 PerfectInterpolantSequences, 0/260130 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown