java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:16:13,281 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:16:13,283 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:16:13,295 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:16:13,296 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:16:13,297 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:16:13,298 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:16:13,300 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:16:13,301 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:16:13,302 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:16:13,304 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:16:13,304 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:16:13,305 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:16:13,306 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:16:13,307 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:16:13,308 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:16:13,309 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:16:13,310 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:16:13,312 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:16:13,314 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:16:13,315 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:16:13,316 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:16:13,319 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:16:13,319 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:16:13,319 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:16:13,320 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:16:13,321 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:16:13,322 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:16:13,323 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:16:13,325 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:16:13,325 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:16:13,326 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:16:13,326 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:16:13,326 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:16:13,327 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:16:13,328 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:16:13,330 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:16:13,341 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:16:13,341 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:16:13,343 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:16:13,343 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:16:13,343 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:16:13,343 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:16:13,343 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:16:13,344 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:16:13,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:16:13,412 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:16:13,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:16:13,419 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:16:13,420 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:16:13,421 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl [2018-09-26 08:16:13,421 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl' [2018-09-26 08:16:13,472 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:16:13,476 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:16:13,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:16:13,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:16:13,477 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:16:13,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:13" (1/1) ... [2018-09-26 08:16:13,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:13" (1/1) ... [2018-09-26 08:16:13,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:16:13,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:16:13,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:16:13,520 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:16:13,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:13" (1/1) ... [2018-09-26 08:16:13,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:13" (1/1) ... [2018-09-26 08:16:13,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:13" (1/1) ... [2018-09-26 08:16:13,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:13" (1/1) ... [2018-09-26 08:16:13,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:13" (1/1) ... [2018-09-26 08:16:13,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:13" (1/1) ... [2018-09-26 08:16:13,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:13" (1/1) ... [2018-09-26 08:16:13,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:16:13,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:16:13,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:16:13,544 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:16:13,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:13" (1/1) ... [2018-09-26 08:16:13,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:16:13,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:16:13,811 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:16:13,812 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:16:13 BoogieIcfgContainer [2018-09-26 08:16:13,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:16:13,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:16:13,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:16:13,820 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:16:13,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:13" (1/2) ... [2018-09-26 08:16:13,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b498116 and model type invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:16:13, skipping insertion in model container [2018-09-26 08:16:13,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:16:13" (2/2) ... [2018-09-26 08:16:13,825 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string.i_4.bpl [2018-09-26 08:16:13,836 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:16:13,846 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:16:13,898 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:16:13,899 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:16:13,900 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:16:13,900 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:16:13,900 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:16:13,900 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:16:13,901 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:16:13,901 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:16:13,901 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:16:13,917 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-09-26 08:16:13,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:16:13,926 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:13,927 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-26 08:16:13,928 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:13,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:13,935 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2018-09-26 08:16:13,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:14,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:14,041 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:16:14,042 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:16:14,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:16:14,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:16:14,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:16:14,061 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2018-09-26 08:16:14,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:14,136 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-09-26 08:16:14,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:16:14,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-09-26 08:16:14,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:14,155 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:16:14,155 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:16:14,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:16:14,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:16:14,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:16:14,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:16:14,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-09-26 08:16:14,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-09-26 08:16:14,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:14,196 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-09-26 08:16:14,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:16:14,197 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-09-26 08:16:14,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:16:14,197 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:14,198 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:16:14,198 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:14,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:14,199 INFO L82 PathProgramCache]: Analyzing trace with hash 198621957, now seen corresponding path program 1 times [2018-09-26 08:16:14,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:14,257 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:14,257 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:16:14,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:16:14,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:16:14,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:16:14,260 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-09-26 08:16:14,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:14,309 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-09-26 08:16:14,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:16:14,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-09-26 08:16:14,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:14,311 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:16:14,311 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:16:14,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:16:14,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:16:14,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:16:14,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:16:14,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-09-26 08:16:14,317 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-09-26 08:16:14,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:14,318 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-09-26 08:16:14,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:16:14,318 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-09-26 08:16:14,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:16:14,319 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:14,319 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:16:14,319 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:14,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:14,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2018-09-26 08:16:14,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:14,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:14,432 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:14,433 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:16:14,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:16:14,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:16:14,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:16:14,435 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2018-09-26 08:16:14,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:14,670 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-09-26 08:16:14,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:16:14,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-09-26 08:16:14,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:14,675 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:16:14,675 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:16:14,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:16:14,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:16:14,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:16:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:16:14,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-09-26 08:16:14,691 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-09-26 08:16:14,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:14,692 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-09-26 08:16:14,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:16:14,692 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-09-26 08:16:14,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:16:14,692 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:14,692 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 08:16:14,693 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:14,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:14,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1765270407, now seen corresponding path program 2 times [2018-09-26 08:16:14,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:14,723 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:14,723 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:14,724 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:16:14,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:16:14,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:16:14,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:16:14,725 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 6 states. [2018-09-26 08:16:14,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:14,783 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-09-26 08:16:14,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:16:14,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-09-26 08:16:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:14,787 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:16:14,788 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:16:14,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:16:14,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:16:14,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:16:14,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:16:14,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-09-26 08:16:14,808 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-09-26 08:16:14,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:14,808 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-09-26 08:16:14,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:16:14,809 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-09-26 08:16:14,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:16:14,812 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:14,813 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-09-26 08:16:14,813 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:14,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:14,814 INFO L82 PathProgramCache]: Analyzing trace with hash 87273139, now seen corresponding path program 3 times [2018-09-26 08:16:14,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:14,880 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:14,884 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:14,884 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:16:14,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:16:14,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:16:14,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:16:14,888 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2018-09-26 08:16:15,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:15,006 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-09-26 08:16:15,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:16:15,009 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-09-26 08:16:15,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:15,009 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:16:15,010 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:16:15,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:16:15,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:16:15,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:16:15,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:16:15,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-09-26 08:16:15,027 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-09-26 08:16:15,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:15,028 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-09-26 08:16:15,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:16:15,028 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-09-26 08:16:15,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:16:15,029 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:15,030 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1] [2018-09-26 08:16:15,031 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:15,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:15,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1096334355, now seen corresponding path program 4 times [2018-09-26 08:16:15,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:15,079 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:15,079 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:15,080 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:16:15,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:16:15,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:16:15,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:16:15,081 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2018-09-26 08:16:15,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:15,143 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-09-26 08:16:15,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:16:15,144 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-09-26 08:16:15,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:15,145 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:16:15,145 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:16:15,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:16:15,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:16:15,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:16:15,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:16:15,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-09-26 08:16:15,164 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-09-26 08:16:15,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:15,165 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-09-26 08:16:15,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:16:15,165 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-09-26 08:16:15,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:16:15,167 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:15,168 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-09-26 08:16:15,168 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:15,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:15,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1310275289, now seen corresponding path program 5 times [2018-09-26 08:16:15,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:15,287 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:15,287 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:15,287 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:16:15,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:16:15,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:16:15,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:16:15,289 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2018-09-26 08:16:15,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:15,419 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-09-26 08:16:15,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:16:15,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-09-26 08:16:15,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:15,421 INFO L225 Difference]: With dead ends: 31 [2018-09-26 08:16:15,421 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:16:15,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:16:15,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:16:15,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-26 08:16:15,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:16:15,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-09-26 08:16:15,435 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-09-26 08:16:15,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:15,436 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-09-26 08:16:15,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:16:15,436 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-09-26 08:16:15,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:16:15,437 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:15,438 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1] [2018-09-26 08:16:15,439 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:15,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:15,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1330040479, now seen corresponding path program 6 times [2018-09-26 08:16:15,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:15,485 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:15,486 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:15,486 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:16:15,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:16:15,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:16:15,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:16:15,488 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 8 states. [2018-09-26 08:16:15,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:15,539 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-09-26 08:16:15,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:16:15,540 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-09-26 08:16:15,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:15,541 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:16:15,541 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:16:15,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:16:15,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:16:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 08:16:15,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:16:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-09-26 08:16:15,552 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-09-26 08:16:15,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:15,552 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-09-26 08:16:15,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:16:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-09-26 08:16:15,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:16:15,553 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:15,554 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-09-26 08:16:15,554 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:15,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:15,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1731406235, now seen corresponding path program 7 times [2018-09-26 08:16:15,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:15,637 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:15,637 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:15,638 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:16:15,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:16:15,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:16:15,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:16:15,639 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2018-09-26 08:16:15,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:15,806 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-09-26 08:16:15,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:16:15,806 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-09-26 08:16:15,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:15,807 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:16:15,807 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:16:15,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:16:15,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:16:15,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:16:15,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:16:15,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-09-26 08:16:15,820 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-09-26 08:16:15,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:15,820 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-09-26 08:16:15,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:16:15,821 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-09-26 08:16:15,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:16:15,822 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:15,822 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1] [2018-09-26 08:16:15,822 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:15,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:15,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1774380245, now seen corresponding path program 8 times [2018-09-26 08:16:15,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:15,858 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:15,859 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:16:15,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:16:15,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:16:15,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:16:15,860 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 9 states. [2018-09-26 08:16:15,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:15,906 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-09-26 08:16:15,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:16:15,907 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-09-26 08:16:15,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:15,908 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:16:15,908 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:16:15,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:16:15,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:16:15,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 08:16:15,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:16:15,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-09-26 08:16:15,920 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-09-26 08:16:15,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:15,920 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-09-26 08:16:15,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:16:15,921 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-09-26 08:16:15,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:16:15,922 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:15,922 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-09-26 08:16:15,922 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:15,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:15,923 INFO L82 PathProgramCache]: Analyzing trace with hash 77451279, now seen corresponding path program 9 times [2018-09-26 08:16:15,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:16,025 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:16,025 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:16:16,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:16:16,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:16:16,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:16:16,027 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2018-09-26 08:16:16,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:16,234 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-09-26 08:16:16,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:16:16,235 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-09-26 08:16:16,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:16,236 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:16:16,236 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:16:16,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:16:16,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:16:16,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:16:16,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:16:16,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-09-26 08:16:16,253 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-09-26 08:16:16,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:16,254 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-09-26 08:16:16,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:16:16,254 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-09-26 08:16:16,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:16:16,255 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:16,255 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1] [2018-09-26 08:16:16,255 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:16,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:16,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1980325449, now seen corresponding path program 10 times [2018-09-26 08:16:16,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:16,293 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:16,293 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:16,294 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:16:16,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:16:16,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:16:16,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:16:16,295 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 10 states. [2018-09-26 08:16:16,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:16,345 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-09-26 08:16:16,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:16:16,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-09-26 08:16:16,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:16,348 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:16:16,348 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:16:16,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:16:16,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:16:16,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:16:16,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:16:16,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-09-26 08:16:16,363 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-09-26 08:16:16,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:16,364 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-09-26 08:16:16,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:16:16,364 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-09-26 08:16:16,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:16:16,367 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:16,370 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1] [2018-09-26 08:16:16,370 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:16,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:16,371 INFO L82 PathProgramCache]: Analyzing trace with hash 422296707, now seen corresponding path program 11 times [2018-09-26 08:16:16,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:16,471 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:16,472 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:16,473 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:16:16,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:16:16,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:16:16,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:16:16,474 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2018-09-26 08:16:16,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:16,697 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-09-26 08:16:16,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:16:16,698 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-09-26 08:16:16,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:16,699 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:16:16,699 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:16:16,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:16:16,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:16:16,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 08:16:16,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:16:16,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-09-26 08:16:16,723 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-09-26 08:16:16,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:16,724 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-09-26 08:16:16,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:16:16,725 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-09-26 08:16:16,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:16:16,726 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:16,726 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 1, 1, 1, 1] [2018-09-26 08:16:16,726 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:16,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:16,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1320051267, now seen corresponding path program 12 times [2018-09-26 08:16:16,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:16,780 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:16,781 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:16:16,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:16:16,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:16:16,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:16:16,782 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2018-09-26 08:16:16,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:16,852 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-09-26 08:16:16,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:16:16,853 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-09-26 08:16:16,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:16,854 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:16:16,854 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:16:16,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:16:16,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:16:16,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:16:16,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:16:16,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-09-26 08:16:16,879 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-09-26 08:16:16,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:16,880 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-09-26 08:16:16,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:16:16,880 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-09-26 08:16:16,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:16:16,881 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:16,882 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2018-09-26 08:16:16,882 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:16,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:16,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1553862921, now seen corresponding path program 13 times [2018-09-26 08:16:16,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:17,013 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:17,013 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:17,013 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:16:17,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:16:17,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:16:17,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:16:17,015 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2018-09-26 08:16:17,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:17,325 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-09-26 08:16:17,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:16:17,325 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-09-26 08:16:17,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:17,326 INFO L225 Difference]: With dead ends: 55 [2018-09-26 08:16:17,326 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:16:17,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:16:17,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:16:17,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 08:16:17,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:16:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-09-26 08:16:17,352 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-09-26 08:16:17,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:17,352 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-09-26 08:16:17,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:16:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-09-26 08:16:17,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:16:17,354 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:17,354 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 1, 1, 1, 1] [2018-09-26 08:16:17,354 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:17,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:17,355 INFO L82 PathProgramCache]: Analyzing trace with hash 115385137, now seen corresponding path program 14 times [2018-09-26 08:16:17,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:17,410 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 56 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:17,410 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:17,410 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:16:17,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:16:17,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:16:17,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:16:17,416 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 12 states. [2018-09-26 08:16:17,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:17,489 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-09-26 08:16:17,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:16:17,490 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-09-26 08:16:17,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:17,491 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:16:17,491 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:16:17,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:16:17,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:16:17,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 08:16:17,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:16:17,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-09-26 08:16:17,522 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-09-26 08:16:17,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:17,523 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-09-26 08:16:17,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:16:17,523 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-09-26 08:16:17,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:16:17,526 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:17,527 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1] [2018-09-26 08:16:17,527 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:17,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:17,527 INFO L82 PathProgramCache]: Analyzing trace with hash -783980693, now seen corresponding path program 15 times [2018-09-26 08:16:17,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:17,686 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:17,687 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:17,687 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:16:17,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:16:17,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:16:17,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:16:17,689 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2018-09-26 08:16:18,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:18,023 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-09-26 08:16:18,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:16:18,024 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-09-26 08:16:18,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:18,024 INFO L225 Difference]: With dead ends: 61 [2018-09-26 08:16:18,025 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:16:18,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=830, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:16:18,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:16:18,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:16:18,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:16:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-09-26 08:16:18,053 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-09-26 08:16:18,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:18,054 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-09-26 08:16:18,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:16:18,054 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-09-26 08:16:18,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:16:18,063 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:18,063 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1] [2018-09-26 08:16:18,063 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:18,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:18,064 INFO L82 PathProgramCache]: Analyzing trace with hash 830172837, now seen corresponding path program 16 times [2018-09-26 08:16:18,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 72 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:18,118 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:18,118 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:16:18,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:16:18,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:16:18,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:16:18,119 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 13 states. [2018-09-26 08:16:18,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:18,190 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-09-26 08:16:18,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:16:18,190 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-09-26 08:16:18,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:18,191 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:16:18,191 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:16:18,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:16:18,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:16:18,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:16:18,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:16:18,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-09-26 08:16:18,262 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-09-26 08:16:18,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:18,262 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-09-26 08:16:18,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:16:18,262 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-09-26 08:16:18,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:16:18,263 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:18,263 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2018-09-26 08:16:18,264 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:18,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:18,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1067768353, now seen corresponding path program 17 times [2018-09-26 08:16:18,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:18,392 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:18,392 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:16:18,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:16:18,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:16:18,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:16:18,393 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2018-09-26 08:16:18,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:18,717 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-09-26 08:16:18,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:16:18,717 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-09-26 08:16:18,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:18,718 INFO L225 Difference]: With dead ends: 67 [2018-09-26 08:16:18,718 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:16:18,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=1012, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:16:18,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:16:18,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 08:16:18,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:16:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-09-26 08:16:18,746 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-09-26 08:16:18,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:18,746 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-09-26 08:16:18,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:16:18,746 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-09-26 08:16:18,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:16:18,747 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:18,747 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 1, 1, 1, 1] [2018-09-26 08:16:18,747 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:18,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:18,748 INFO L82 PathProgramCache]: Analyzing trace with hash 2070347801, now seen corresponding path program 18 times [2018-09-26 08:16:18,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 90 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:18,799 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:18,800 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:16:18,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:16:18,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:16:18,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:16:18,801 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 14 states. [2018-09-26 08:16:18,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:18,875 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-09-26 08:16:18,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:16:18,876 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-09-26 08:16:18,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:18,876 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:16:18,877 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:16:18,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:16:18,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:16:18,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 08:16:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:16:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-09-26 08:16:18,914 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-09-26 08:16:18,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:18,914 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-09-26 08:16:18,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:16:18,915 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-09-26 08:16:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:16:18,917 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:18,918 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1] [2018-09-26 08:16:18,918 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:18,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:18,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431059, now seen corresponding path program 19 times [2018-09-26 08:16:18,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:19,079 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:19,079 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:19,079 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:16:19,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:16:19,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:16:19,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:16:19,082 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2018-09-26 08:16:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:19,475 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-09-26 08:16:19,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:16:19,475 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-09-26 08:16:19,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:19,476 INFO L225 Difference]: With dead ends: 73 [2018-09-26 08:16:19,476 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:16:19,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=1212, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:16:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:16:19,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-26 08:16:19,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:16:19,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-09-26 08:16:19,507 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2018-09-26 08:16:19,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:19,508 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-09-26 08:16:19,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:16:19,508 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-09-26 08:16:19,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:16:19,513 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:19,513 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 1, 1, 1, 1] [2018-09-26 08:16:19,513 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:19,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:19,514 INFO L82 PathProgramCache]: Analyzing trace with hash 2120767373, now seen corresponding path program 20 times [2018-09-26 08:16:19,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 110 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:19,576 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:19,576 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:16:19,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:16:19,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:16:19,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:16:19,577 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 15 states. [2018-09-26 08:16:19,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:19,669 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-09-26 08:16:19,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:16:19,669 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-09-26 08:16:19,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:19,671 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:16:19,672 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:16:19,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:16:19,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:16:19,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 08:16:19,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:16:19,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-09-26 08:16:19,709 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-09-26 08:16:19,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:19,709 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-09-26 08:16:19,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:16:19,709 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-09-26 08:16:19,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:16:19,710 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:19,710 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1] [2018-09-26 08:16:19,710 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:19,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:19,711 INFO L82 PathProgramCache]: Analyzing trace with hash -2051967801, now seen corresponding path program 21 times [2018-09-26 08:16:19,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:19,884 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:19,885 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:19,885 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:16:19,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:16:19,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:16:19,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:16:19,886 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2018-09-26 08:16:20,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:20,313 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-09-26 08:16:20,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:16:20,313 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-09-26 08:16:20,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:20,314 INFO L225 Difference]: With dead ends: 79 [2018-09-26 08:16:20,314 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:16:20,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=1430, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:16:20,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:16:20,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 08:16:20,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:16:20,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-09-26 08:16:20,348 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2018-09-26 08:16:20,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:20,348 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-09-26 08:16:20,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:16:20,349 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-09-26 08:16:20,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:16:20,349 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:20,349 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 1, 1, 1, 1] [2018-09-26 08:16:20,350 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:20,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:20,350 INFO L82 PathProgramCache]: Analyzing trace with hash -473664255, now seen corresponding path program 22 times [2018-09-26 08:16:20,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:20,412 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 132 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:20,413 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:20,413 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:16:20,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:16:20,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:16:20,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:16:20,414 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 16 states. [2018-09-26 08:16:20,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:20,508 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-09-26 08:16:20,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:16:20,508 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-09-26 08:16:20,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:20,509 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:16:20,509 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:16:20,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:16:20,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:16:20,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-26 08:16:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:16:20,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-09-26 08:16:20,543 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2018-09-26 08:16:20,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:20,544 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-09-26 08:16:20,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:16:20,544 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-09-26 08:16:20,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:16:20,544 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:20,545 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1] [2018-09-26 08:16:20,545 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:20,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:20,545 INFO L82 PathProgramCache]: Analyzing trace with hash 75236667, now seen corresponding path program 23 times [2018-09-26 08:16:20,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:20,729 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:20,730 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:20,730 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:16:20,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:16:20,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:16:20,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:16:20,731 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2018-09-26 08:16:21,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:21,260 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2018-09-26 08:16:21,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:16:21,261 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-09-26 08:16:21,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:21,262 INFO L225 Difference]: With dead ends: 85 [2018-09-26 08:16:21,262 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 08:16:21,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=1666, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:16:21,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 08:16:21,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-26 08:16:21,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:16:21,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-09-26 08:16:21,304 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2018-09-26 08:16:21,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:21,304 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-09-26 08:16:21,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:16:21,305 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-09-26 08:16:21,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:16:21,305 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:21,306 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 1, 1, 1, 1] [2018-09-26 08:16:21,306 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:21,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:21,306 INFO L82 PathProgramCache]: Analyzing trace with hash 608196725, now seen corresponding path program 24 times [2018-09-26 08:16:21,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:21,378 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 156 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:21,379 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:21,379 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:16:21,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:16:21,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:16:21,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=149, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:16:21,381 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 17 states. [2018-09-26 08:16:21,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:21,514 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-09-26 08:16:21,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:16:21,514 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-09-26 08:16:21,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:21,515 INFO L225 Difference]: With dead ends: 61 [2018-09-26 08:16:21,515 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:16:21,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:16:21,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:16:21,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 08:16:21,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:16:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-09-26 08:16:21,561 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2018-09-26 08:16:21,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:21,561 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-09-26 08:16:21,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:16:21,561 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-09-26 08:16:21,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:16:21,562 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:21,562 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1] [2018-09-26 08:16:21,562 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:21,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:21,563 INFO L82 PathProgramCache]: Analyzing trace with hash 361552815, now seen corresponding path program 25 times [2018-09-26 08:16:21,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:21,775 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:21,776 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:21,776 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:16:21,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:16:21,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:16:21,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:16:21,777 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2018-09-26 08:16:22,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:22,275 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-09-26 08:16:22,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:16:22,276 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-09-26 08:16:22,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:22,276 INFO L225 Difference]: With dead ends: 91 [2018-09-26 08:16:22,277 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 08:16:22,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=1920, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:16:22,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 08:16:22,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-26 08:16:22,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:16:22,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-09-26 08:16:22,320 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2018-09-26 08:16:22,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:22,320 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-09-26 08:16:22,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:16:22,320 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-09-26 08:16:22,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:16:22,321 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:22,321 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 1, 1, 1, 1] [2018-09-26 08:16:22,321 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:22,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:22,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1210122729, now seen corresponding path program 26 times [2018-09-26 08:16:22,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:22,390 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 182 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:22,390 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:22,390 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:16:22,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:16:22,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:16:22,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:16:22,392 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 18 states. [2018-09-26 08:16:22,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:22,498 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-09-26 08:16:22,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:16:22,498 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2018-09-26 08:16:22,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:22,499 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:16:22,499 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:16:22,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:16:22,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:16:22,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-26 08:16:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:16:22,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-09-26 08:16:22,546 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-09-26 08:16:22,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:22,547 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-09-26 08:16:22,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:16:22,547 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-09-26 08:16:22,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:16:22,547 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:22,548 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1] [2018-09-26 08:16:22,548 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:22,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:22,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1008142301, now seen corresponding path program 27 times [2018-09-26 08:16:22,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:22,759 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:22,759 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:16:22,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:16:22,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:16:22,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:16:22,761 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2018-09-26 08:16:23,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:23,352 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2018-09-26 08:16:23,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:16:23,352 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-09-26 08:16:23,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:23,353 INFO L225 Difference]: With dead ends: 97 [2018-09-26 08:16:23,353 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:16:23,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=2192, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:16:23,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:16:23,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-09-26 08:16:23,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:16:23,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-09-26 08:16:23,401 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2018-09-26 08:16:23,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:23,402 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-09-26 08:16:23,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:16:23,402 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-09-26 08:16:23,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:16:23,403 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:23,403 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 14, 1, 1, 1, 1] [2018-09-26 08:16:23,403 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:23,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:23,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1490325155, now seen corresponding path program 28 times [2018-09-26 08:16:23,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:23,483 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 210 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:23,483 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:23,483 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:16:23,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:16:23,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:16:23,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=186, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:16:23,485 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 19 states. [2018-09-26 08:16:23,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:23,597 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-09-26 08:16:23,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:16:23,598 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 64 [2018-09-26 08:16:23,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:23,598 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:16:23,599 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:16:23,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:16:23,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:16:23,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-26 08:16:23,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:16:23,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-09-26 08:16:23,648 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2018-09-26 08:16:23,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:23,648 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-09-26 08:16:23,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:16:23,649 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-09-26 08:16:23,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:16:23,649 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:23,649 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1] [2018-09-26 08:16:23,649 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:23,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:23,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1978312041, now seen corresponding path program 29 times [2018-09-26 08:16:23,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:23,874 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:23,874 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:23,874 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:16:23,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:16:23,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:16:23,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:16:23,876 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2018-09-26 08:16:24,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:24,516 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2018-09-26 08:16:24,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:16:24,516 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-09-26 08:16:24,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:24,517 INFO L225 Difference]: With dead ends: 103 [2018-09-26 08:16:24,517 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 08:16:24,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=2482, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:16:24,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 08:16:24,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-26 08:16:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:16:24,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-09-26 08:16:24,579 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2018-09-26 08:16:24,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:24,579 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-09-26 08:16:24,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:16:24,579 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-09-26 08:16:24,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:16:24,580 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:24,580 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 15, 1, 1, 1, 1] [2018-09-26 08:16:24,580 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:24,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:24,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1465604399, now seen corresponding path program 30 times [2018-09-26 08:16:24,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:24,670 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 240 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:24,670 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:24,670 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:16:24,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:16:24,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:16:24,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:16:24,672 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 20 states. [2018-09-26 08:16:24,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:24,807 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-09-26 08:16:24,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:16:24,808 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2018-09-26 08:16:24,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:24,809 INFO L225 Difference]: With dead ends: 73 [2018-09-26 08:16:24,809 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:16:24,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:16:24,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:16:24,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-26 08:16:24,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:16:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-09-26 08:16:24,885 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2018-09-26 08:16:24,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:24,886 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-09-26 08:16:24,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:16:24,886 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-09-26 08:16:24,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:16:24,886 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:24,886 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1] [2018-09-26 08:16:24,887 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:24,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:24,888 INFO L82 PathProgramCache]: Analyzing trace with hash 303497995, now seen corresponding path program 31 times [2018-09-26 08:16:24,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:25,139 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:25,139 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:16:25,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:16:25,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:16:25,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:16:25,141 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2018-09-26 08:16:25,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:25,817 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2018-09-26 08:16:25,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:16:25,817 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-09-26 08:16:25,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:25,818 INFO L225 Difference]: With dead ends: 109 [2018-09-26 08:16:25,818 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 08:16:25,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=2790, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:16:25,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 08:16:25,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-26 08:16:25,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:16:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-09-26 08:16:25,877 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2018-09-26 08:16:25,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:25,877 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-09-26 08:16:25,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:16:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-09-26 08:16:25,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:16:25,880 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:25,880 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 16, 1, 1, 1, 1] [2018-09-26 08:16:25,880 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:25,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:25,881 INFO L82 PathProgramCache]: Analyzing trace with hash -2091802043, now seen corresponding path program 32 times [2018-09-26 08:16:25,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:25,980 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 272 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:25,981 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:25,981 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:16:25,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:16:25,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:16:25,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=227, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:16:25,982 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 21 states. [2018-09-26 08:16:26,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:26,119 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-09-26 08:16:26,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:16:26,120 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 72 [2018-09-26 08:16:26,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:26,121 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:16:26,121 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:16:26,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:16:26,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:16:26,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-26 08:16:26,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:16:26,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-09-26 08:16:26,181 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-09-26 08:16:26,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:26,181 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-09-26 08:16:26,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:16:26,182 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-09-26 08:16:26,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:16:26,182 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:26,182 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1] [2018-09-26 08:16:26,183 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:26,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:26,183 INFO L82 PathProgramCache]: Analyzing trace with hash -177016449, now seen corresponding path program 33 times [2018-09-26 08:16:26,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:26,452 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:26,452 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:16:26,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:16:26,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:16:26,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:16:26,454 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2018-09-26 08:16:27,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:27,214 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-09-26 08:16:27,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:16:27,215 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-09-26 08:16:27,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:27,216 INFO L225 Difference]: With dead ends: 115 [2018-09-26 08:16:27,216 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:16:27,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=3116, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:16:27,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:16:27,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-26 08:16:27,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:16:27,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-09-26 08:16:27,273 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2018-09-26 08:16:27,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:27,273 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-09-26 08:16:27,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:16:27,274 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-09-26 08:16:27,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:16:27,274 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:27,275 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 1, 1, 1, 1] [2018-09-26 08:16:27,275 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:27,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:27,275 INFO L82 PathProgramCache]: Analyzing trace with hash -42507335, now seen corresponding path program 34 times [2018-09-26 08:16:27,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 306 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:27,353 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:27,354 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:16:27,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:16:27,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:16:27,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:16:27,355 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 22 states. [2018-09-26 08:16:27,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:27,488 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-09-26 08:16:27,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:16:27,488 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 76 [2018-09-26 08:16:27,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:27,489 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:16:27,489 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:16:27,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:16:27,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:16:27,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-26 08:16:27,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:16:27,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-09-26 08:16:27,549 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2018-09-26 08:16:27,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:27,550 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-09-26 08:16:27,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:16:27,550 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-09-26 08:16:27,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:16:27,551 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:27,551 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1] [2018-09-26 08:16:27,551 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:27,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:27,551 INFO L82 PathProgramCache]: Analyzing trace with hash 2100176371, now seen corresponding path program 35 times [2018-09-26 08:16:27,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:27,816 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 684 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:27,816 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:27,817 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:16:27,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:16:27,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:16:27,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:16:27,818 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2018-09-26 08:16:28,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:28,622 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2018-09-26 08:16:28,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:16:28,623 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-09-26 08:16:28,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:28,624 INFO L225 Difference]: With dead ends: 121 [2018-09-26 08:16:28,624 INFO L226 Difference]: Without dead ends: 81 [2018-09-26 08:16:28,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=3460, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:16:28,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-26 08:16:28,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-26 08:16:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:16:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-09-26 08:16:28,698 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-09-26 08:16:28,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:28,699 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-09-26 08:16:28,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:16:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-09-26 08:16:28,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:16:28,700 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:28,700 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 18, 1, 1, 1, 1] [2018-09-26 08:16:28,700 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:28,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:28,701 INFO L82 PathProgramCache]: Analyzing trace with hash 752544557, now seen corresponding path program 36 times [2018-09-26 08:16:28,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:28,818 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 342 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:28,818 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:28,818 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:16:28,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:16:28,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:16:28,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=272, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:16:28,820 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 23 states. [2018-09-26 08:16:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:28,959 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-09-26 08:16:28,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:16:28,959 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 80 [2018-09-26 08:16:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:28,960 INFO L225 Difference]: With dead ends: 85 [2018-09-26 08:16:28,960 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:16:28,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:16:28,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:16:29,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-26 08:16:29,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:16:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-09-26 08:16:29,027 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-09-26 08:16:29,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:29,027 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-09-26 08:16:29,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:16:29,028 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-09-26 08:16:29,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:16:29,028 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:29,028 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1] [2018-09-26 08:16:29,029 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:29,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:29,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1640865895, now seen corresponding path program 37 times [2018-09-26 08:16:29,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:29,303 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:29,303 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:29,304 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:16:29,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:16:29,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:16:29,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:16:29,305 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2018-09-26 08:16:30,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:30,104 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-09-26 08:16:30,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:16:30,105 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-09-26 08:16:30,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:30,105 INFO L225 Difference]: With dead ends: 127 [2018-09-26 08:16:30,106 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 08:16:30,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=3822, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:16:30,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 08:16:30,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 08:16:30,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:16:30,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-09-26 08:16:30,166 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2018-09-26 08:16:30,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:30,167 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-09-26 08:16:30,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:16:30,167 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-09-26 08:16:30,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:16:30,168 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:30,168 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 19, 1, 1, 1, 1] [2018-09-26 08:16:30,168 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:30,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:30,168 INFO L82 PathProgramCache]: Analyzing trace with hash 918632609, now seen corresponding path program 38 times [2018-09-26 08:16:30,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:30,248 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 380 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:30,248 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:30,248 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:16:30,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:16:30,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:16:30,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:16:30,250 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 24 states. [2018-09-26 08:16:30,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:30,384 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2018-09-26 08:16:30,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:16:30,384 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 84 [2018-09-26 08:16:30,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:30,385 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:16:30,385 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:16:30,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:16:30,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:16:30,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-26 08:16:30,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:16:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-09-26 08:16:30,447 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2018-09-26 08:16:30,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:30,447 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-09-26 08:16:30,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:16:30,447 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-09-26 08:16:30,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:16:30,448 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:30,448 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1] [2018-09-26 08:16:30,448 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:30,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:30,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1957273381, now seen corresponding path program 39 times [2018-09-26 08:16:30,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:30,738 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:30,739 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:30,739 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:16:30,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:16:30,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:16:30,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:16:30,740 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2018-09-26 08:16:31,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:31,546 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2018-09-26 08:16:31,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:16:31,546 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-09-26 08:16:31,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:31,547 INFO L225 Difference]: With dead ends: 133 [2018-09-26 08:16:31,547 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:16:31,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=4202, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:16:31,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:16:31,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-26 08:16:31,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:16:31,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-09-26 08:16:31,617 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2018-09-26 08:16:31,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:31,618 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-09-26 08:16:31,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:16:31,618 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-09-26 08:16:31,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:16:31,619 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:31,619 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 20, 1, 1, 1, 1] [2018-09-26 08:16:31,619 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:31,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:31,619 INFO L82 PathProgramCache]: Analyzing trace with hash 267340821, now seen corresponding path program 40 times [2018-09-26 08:16:31,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:31,705 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 420 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:31,705 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:31,705 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:16:31,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:16:31,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:16:31,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=321, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:16:31,707 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 25 states. [2018-09-26 08:16:31,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:31,858 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2018-09-26 08:16:31,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:16:31,858 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 88 [2018-09-26 08:16:31,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:31,859 INFO L225 Difference]: With dead ends: 93 [2018-09-26 08:16:31,859 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:16:31,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:16:31,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:16:31,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-26 08:16:31,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:16:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-09-26 08:16:31,929 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2018-09-26 08:16:31,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:31,929 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-09-26 08:16:31,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:16:31,929 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-09-26 08:16:31,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:16:31,930 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:31,930 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1] [2018-09-26 08:16:31,931 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:31,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:31,931 INFO L82 PathProgramCache]: Analyzing trace with hash -783456433, now seen corresponding path program 41 times [2018-09-26 08:16:31,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:32,229 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:32,229 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:32,230 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:16:32,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:16:32,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:16:32,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:16:32,231 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2018-09-26 08:16:33,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:33,049 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2018-09-26 08:16:33,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:16:33,049 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-09-26 08:16:33,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:33,050 INFO L225 Difference]: With dead ends: 139 [2018-09-26 08:16:33,050 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 08:16:33,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=4600, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:16:33,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 08:16:33,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-26 08:16:33,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:16:33,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-09-26 08:16:33,135 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-09-26 08:16:33,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:33,135 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-09-26 08:16:33,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:16:33,135 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-09-26 08:16:33,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 08:16:33,136 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:33,137 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 21, 1, 1, 1, 1] [2018-09-26 08:16:33,137 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:33,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:33,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1017783689, now seen corresponding path program 42 times [2018-09-26 08:16:33,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:33,224 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 462 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:33,224 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:33,224 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:16:33,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:16:33,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:16:33,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:16:33,226 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 26 states. [2018-09-26 08:16:33,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:33,382 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-09-26 08:16:33,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:16:33,383 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 92 [2018-09-26 08:16:33,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:33,383 INFO L225 Difference]: With dead ends: 97 [2018-09-26 08:16:33,384 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 08:16:33,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:16:33,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 08:16:33,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-26 08:16:33,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:16:33,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-09-26 08:16:33,461 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2018-09-26 08:16:33,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:33,461 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-09-26 08:16:33,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:16:33,462 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-09-26 08:16:33,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:16:33,463 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:33,463 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1] [2018-09-26 08:16:33,463 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:33,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:33,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1162366013, now seen corresponding path program 43 times [2018-09-26 08:16:33,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:33,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:33,750 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:33,750 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:16:33,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:16:33,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:16:33,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:16:33,752 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2018-09-26 08:16:34,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:34,625 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2018-09-26 08:16:34,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:16:34,626 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-09-26 08:16:34,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:34,627 INFO L225 Difference]: With dead ends: 145 [2018-09-26 08:16:34,627 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 08:16:34,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=240, Invalid=5016, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:16:34,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 08:16:34,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-26 08:16:34,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 08:16:34,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-09-26 08:16:34,711 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2018-09-26 08:16:34,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:34,711 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-09-26 08:16:34,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:16:34,712 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-09-26 08:16:34,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:16:34,712 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:34,713 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 22, 1, 1, 1, 1] [2018-09-26 08:16:34,713 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:34,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:34,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1867070211, now seen corresponding path program 44 times [2018-09-26 08:16:34,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 506 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:34,798 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:34,798 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:16:34,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:16:34,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:16:34,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=374, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:16:34,799 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 27 states. [2018-09-26 08:16:34,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:34,953 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-09-26 08:16:34,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:16:34,954 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 96 [2018-09-26 08:16:34,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:34,955 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:16:34,955 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:16:34,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:16:34,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:16:35,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-26 08:16:35,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:16:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-09-26 08:16:35,048 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-09-26 08:16:35,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:35,049 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-09-26 08:16:35,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:16:35,049 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-09-26 08:16:35,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:16:35,050 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:35,050 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1] [2018-09-26 08:16:35,050 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:35,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:35,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1041909303, now seen corresponding path program 45 times [2018-09-26 08:16:35,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:35,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 1104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:35,415 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:35,415 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:16:35,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:16:35,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:16:35,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:16:35,417 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2018-09-26 08:16:36,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:36,352 INFO L93 Difference]: Finished difference Result 151 states and 153 transitions. [2018-09-26 08:16:36,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:16:36,353 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-09-26 08:16:36,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:36,354 INFO L225 Difference]: With dead ends: 151 [2018-09-26 08:16:36,354 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 08:16:36,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=5450, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:16:36,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 08:16:36,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-09-26 08:16:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:16:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-09-26 08:16:36,434 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2018-09-26 08:16:36,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:36,434 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-09-26 08:16:36,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:16:36,434 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-09-26 08:16:36,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:16:36,435 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:36,435 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 23, 1, 1, 1, 1] [2018-09-26 08:16:36,435 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:36,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:36,436 INFO L82 PathProgramCache]: Analyzing trace with hash -279303567, now seen corresponding path program 46 times [2018-09-26 08:16:36,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:36,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 552 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:36,533 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:36,534 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:16:36,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:16:36,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:16:36,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:16:36,535 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 28 states. [2018-09-26 08:16:36,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:36,693 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2018-09-26 08:16:36,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:16:36,693 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 100 [2018-09-26 08:16:36,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:36,694 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:16:36,694 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:16:36,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:16:36,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:16:36,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-26 08:16:36,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 08:16:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-09-26 08:16:36,780 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2018-09-26 08:16:36,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:36,780 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-09-26 08:16:36,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:16:36,780 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-09-26 08:16:36,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:16:36,781 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:36,781 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1] [2018-09-26 08:16:36,782 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:36,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:36,782 INFO L82 PathProgramCache]: Analyzing trace with hash -2122703189, now seen corresponding path program 47 times [2018-09-26 08:16:36,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:37,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 1200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:37,093 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:37,093 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:16:37,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:16:37,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:16:37,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:16:37,095 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2018-09-26 08:16:38,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:38,069 INFO L93 Difference]: Finished difference Result 157 states and 159 transitions. [2018-09-26 08:16:38,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:16:38,069 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-09-26 08:16:38,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:38,070 INFO L225 Difference]: With dead ends: 157 [2018-09-26 08:16:38,070 INFO L226 Difference]: Without dead ends: 105 [2018-09-26 08:16:38,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=260, Invalid=5902, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:16:38,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-26 08:16:38,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-09-26 08:16:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 08:16:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-09-26 08:16:38,160 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2018-09-26 08:16:38,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:38,161 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-09-26 08:16:38,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:16:38,161 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-09-26 08:16:38,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 08:16:38,162 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:38,162 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 24, 1, 1, 1, 1] [2018-09-26 08:16:38,162 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:38,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:38,165 INFO L82 PathProgramCache]: Analyzing trace with hash 190404069, now seen corresponding path program 48 times [2018-09-26 08:16:38,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:38,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 600 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:38,255 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:38,255 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:16:38,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:16:38,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:16:38,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=431, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:16:38,256 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 29 states. [2018-09-26 08:16:38,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:38,440 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2018-09-26 08:16:38,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:16:38,440 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 104 [2018-09-26 08:16:38,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:38,441 INFO L225 Difference]: With dead ends: 109 [2018-09-26 08:16:38,441 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 08:16:38,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:16:38,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 08:16:38,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-26 08:16:38,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 08:16:38,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-09-26 08:16:38,541 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2018-09-26 08:16:38,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:38,541 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-09-26 08:16:38,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:16:38,542 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-09-26 08:16:38,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:16:38,542 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:38,543 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1] [2018-09-26 08:16:38,543 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:38,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:38,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1705231073, now seen corresponding path program 49 times [2018-09-26 08:16:38,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:38,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 1300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:38,881 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:38,881 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:16:38,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:16:38,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:16:38,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:16:38,884 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2018-09-26 08:16:39,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:39,861 INFO L93 Difference]: Finished difference Result 163 states and 165 transitions. [2018-09-26 08:16:39,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:16:39,861 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-09-26 08:16:39,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:39,862 INFO L225 Difference]: With dead ends: 163 [2018-09-26 08:16:39,862 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 08:16:39,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=270, Invalid=6372, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:16:39,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 08:16:39,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-26 08:16:39,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 08:16:39,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-09-26 08:16:39,960 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2018-09-26 08:16:39,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:39,960 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-09-26 08:16:39,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:16:39,960 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-09-26 08:16:39,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 08:16:39,961 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:39,962 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 25, 1, 1, 1, 1] [2018-09-26 08:16:39,962 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:39,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:39,962 INFO L82 PathProgramCache]: Analyzing trace with hash 653870937, now seen corresponding path program 50 times [2018-09-26 08:16:39,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:40,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 650 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:40,055 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:40,055 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:16:40,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:16:40,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:16:40,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:16:40,057 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 30 states. [2018-09-26 08:16:40,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:40,253 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2018-09-26 08:16:40,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:16:40,253 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 108 [2018-09-26 08:16:40,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:40,254 INFO L225 Difference]: With dead ends: 113 [2018-09-26 08:16:40,254 INFO L226 Difference]: Without dead ends: 111 [2018-09-26 08:16:40,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:16:40,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-26 08:16:40,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-09-26 08:16:40,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 08:16:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-09-26 08:16:40,359 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-09-26 08:16:40,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:40,359 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-09-26 08:16:40,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:16:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-09-26 08:16:40,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 08:16:40,360 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:40,361 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1] [2018-09-26 08:16:40,361 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:40,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:40,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1304797587, now seen corresponding path program 51 times [2018-09-26 08:16:40,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:40,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:40,681 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:40,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:16:40,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:16:40,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:16:40,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:16:40,683 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2018-09-26 08:16:41,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:41,697 INFO L93 Difference]: Finished difference Result 169 states and 171 transitions. [2018-09-26 08:16:41,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:16:41,698 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-09-26 08:16:41,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:41,699 INFO L225 Difference]: With dead ends: 169 [2018-09-26 08:16:41,699 INFO L226 Difference]: Without dead ends: 113 [2018-09-26 08:16:41,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=280, Invalid=6860, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:16:41,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-26 08:16:41,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-26 08:16:41,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 08:16:41,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-09-26 08:16:41,797 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2018-09-26 08:16:41,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:41,797 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-09-26 08:16:41,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:16:41,798 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-09-26 08:16:41,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 08:16:41,799 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:41,799 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 26, 1, 1, 1, 1] [2018-09-26 08:16:41,799 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:41,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:41,799 INFO L82 PathProgramCache]: Analyzing trace with hash -738263347, now seen corresponding path program 52 times [2018-09-26 08:16:41,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:41,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 702 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:41,889 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:41,890 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:16:41,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:16:41,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:16:41,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=492, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:16:41,891 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 31 states. [2018-09-26 08:16:42,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:42,134 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-09-26 08:16:42,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:16:42,135 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 112 [2018-09-26 08:16:42,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:42,136 INFO L225 Difference]: With dead ends: 117 [2018-09-26 08:16:42,136 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 08:16:42,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:16:42,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 08:16:42,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-26 08:16:42,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 08:16:42,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-09-26 08:16:42,281 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2018-09-26 08:16:42,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:42,281 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-09-26 08:16:42,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:16:42,282 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-09-26 08:16:42,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-26 08:16:42,283 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:42,283 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1] [2018-09-26 08:16:42,283 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:42,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:42,284 INFO L82 PathProgramCache]: Analyzing trace with hash -801420281, now seen corresponding path program 53 times [2018-09-26 08:16:42,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:42,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 1512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:42,708 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:42,708 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:16:42,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:16:42,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:16:42,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:16:42,709 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2018-09-26 08:16:43,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:43,780 INFO L93 Difference]: Finished difference Result 175 states and 177 transitions. [2018-09-26 08:16:43,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:16:43,780 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-09-26 08:16:43,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:43,781 INFO L225 Difference]: With dead ends: 175 [2018-09-26 08:16:43,781 INFO L226 Difference]: Without dead ends: 117 [2018-09-26 08:16:43,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=290, Invalid=7366, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:16:43,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-26 08:16:43,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-09-26 08:16:43,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-26 08:16:43,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-09-26 08:16:43,891 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2018-09-26 08:16:43,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:43,891 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-09-26 08:16:43,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:16:43,892 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-09-26 08:16:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-26 08:16:43,893 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:43,893 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 27, 1, 1, 1, 1] [2018-09-26 08:16:43,893 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:43,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:43,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1280345023, now seen corresponding path program 54 times [2018-09-26 08:16:43,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 756 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:43,988 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:43,988 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:16:43,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:16:43,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:16:43,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:16:43,989 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 32 states. [2018-09-26 08:16:44,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:44,194 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2018-09-26 08:16:44,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:16:44,194 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 116 [2018-09-26 08:16:44,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:44,195 INFO L225 Difference]: With dead ends: 121 [2018-09-26 08:16:44,195 INFO L226 Difference]: Without dead ends: 119 [2018-09-26 08:16:44,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:16:44,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-26 08:16:44,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-26 08:16:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-26 08:16:44,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-09-26 08:16:44,323 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2018-09-26 08:16:44,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:44,324 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-09-26 08:16:44,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:16:44,324 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-09-26 08:16:44,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-26 08:16:44,325 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:44,325 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1, 1, 1] [2018-09-26 08:16:44,326 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:44,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:44,326 INFO L82 PathProgramCache]: Analyzing trace with hash -2050868101, now seen corresponding path program 55 times [2018-09-26 08:16:44,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 1624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:44,683 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:44,683 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:16:44,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:16:44,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:16:44,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:16:44,685 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2018-09-26 08:16:45,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:45,802 INFO L93 Difference]: Finished difference Result 181 states and 183 transitions. [2018-09-26 08:16:45,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:16:45,803 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-09-26 08:16:45,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:45,804 INFO L225 Difference]: With dead ends: 181 [2018-09-26 08:16:45,804 INFO L226 Difference]: Without dead ends: 121 [2018-09-26 08:16:45,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=7890, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:16:45,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-09-26 08:16:45,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-09-26 08:16:45,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 08:16:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-09-26 08:16:45,940 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2018-09-26 08:16:45,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:45,941 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-09-26 08:16:45,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:16:45,941 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-09-26 08:16:45,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-26 08:16:45,945 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:45,945 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 28, 1, 1, 1, 1] [2018-09-26 08:16:45,945 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:45,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:45,946 INFO L82 PathProgramCache]: Analyzing trace with hash 919584693, now seen corresponding path program 56 times [2018-09-26 08:16:45,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:46,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 812 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:46,053 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:46,053 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:16:46,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:16:46,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:16:46,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=557, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:16:46,054 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 33 states. [2018-09-26 08:16:46,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:46,311 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2018-09-26 08:16:46,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:16:46,311 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 120 [2018-09-26 08:16:46,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:46,312 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:16:46,313 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:16:46,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:16:46,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:16:46,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-09-26 08:16:46,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-26 08:16:46,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-09-26 08:16:46,428 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2018-09-26 08:16:46,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:46,428 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-09-26 08:16:46,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:16:46,428 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-09-26 08:16:46,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-26 08:16:46,429 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:46,430 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1] [2018-09-26 08:16:46,430 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:46,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:46,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1042320657, now seen corresponding path program 57 times [2018-09-26 08:16:46,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:46,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 1740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:46,785 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:46,785 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:16:46,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:16:46,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:16:46,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:16:46,786 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2018-09-26 08:16:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:47,971 INFO L93 Difference]: Finished difference Result 187 states and 189 transitions. [2018-09-26 08:16:47,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:16:47,971 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-09-26 08:16:47,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:47,972 INFO L225 Difference]: With dead ends: 187 [2018-09-26 08:16:47,972 INFO L226 Difference]: Without dead ends: 125 [2018-09-26 08:16:47,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=310, Invalid=8432, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:16:47,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-26 08:16:48,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-09-26 08:16:48,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-26 08:16:48,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-09-26 08:16:48,093 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2018-09-26 08:16:48,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:48,093 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-09-26 08:16:48,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:16:48,093 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-09-26 08:16:48,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 08:16:48,095 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:48,095 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 29, 1, 1, 1, 1] [2018-09-26 08:16:48,095 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:48,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:48,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1571080489, now seen corresponding path program 58 times [2018-09-26 08:16:48,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:48,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 870 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:48,195 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:48,195 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:16:48,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:16:48,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:16:48,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:16:48,196 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 34 states. [2018-09-26 08:16:48,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:48,421 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2018-09-26 08:16:48,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:16:48,421 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 124 [2018-09-26 08:16:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:48,422 INFO L225 Difference]: With dead ends: 129 [2018-09-26 08:16:48,422 INFO L226 Difference]: Without dead ends: 127 [2018-09-26 08:16:48,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:16:48,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-26 08:16:48,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-26 08:16:48,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-26 08:16:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-09-26 08:16:48,573 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2018-09-26 08:16:48,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:48,574 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-09-26 08:16:48,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:16:48,574 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-09-26 08:16:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-26 08:16:48,575 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:48,576 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1, 1, 1] [2018-09-26 08:16:48,576 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:48,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:48,576 INFO L82 PathProgramCache]: Analyzing trace with hash -2020085917, now seen corresponding path program 59 times [2018-09-26 08:16:48,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:48,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 1860 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:48,983 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:48,983 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:16:48,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:16:48,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:16:48,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:16:48,985 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2018-09-26 08:16:50,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:50,345 INFO L93 Difference]: Finished difference Result 193 states and 195 transitions. [2018-09-26 08:16:50,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:16:50,345 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-09-26 08:16:50,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:50,346 INFO L225 Difference]: With dead ends: 193 [2018-09-26 08:16:50,347 INFO L226 Difference]: Without dead ends: 129 [2018-09-26 08:16:50,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=320, Invalid=8992, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:16:50,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-26 08:16:50,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-09-26 08:16:50,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 08:16:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-09-26 08:16:50,482 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2018-09-26 08:16:50,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:50,482 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-09-26 08:16:50,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:16:50,482 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-09-26 08:16:50,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-26 08:16:50,483 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:50,483 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 30, 1, 1, 1, 1] [2018-09-26 08:16:50,484 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:50,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:50,484 INFO L82 PathProgramCache]: Analyzing trace with hash 2012453021, now seen corresponding path program 60 times [2018-09-26 08:16:50,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:50,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 930 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:50,584 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:50,584 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:16:50,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:16:50,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:16:50,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:16:50,586 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 35 states. [2018-09-26 08:16:50,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:50,806 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2018-09-26 08:16:50,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:16:50,806 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 128 [2018-09-26 08:16:50,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:50,807 INFO L225 Difference]: With dead ends: 133 [2018-09-26 08:16:50,807 INFO L226 Difference]: Without dead ends: 131 [2018-09-26 08:16:50,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:16:50,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-26 08:16:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-26 08:16:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 08:16:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-09-26 08:16:50,917 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2018-09-26 08:16:50,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:50,917 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-09-26 08:16:50,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:16:50,917 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-09-26 08:16:50,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 08:16:50,920 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:50,920 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1] [2018-09-26 08:16:50,920 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:50,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:50,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1232122327, now seen corresponding path program 61 times [2018-09-26 08:16:50,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 1984 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:51,311 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:51,311 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:16:51,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:16:51,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:16:51,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:16:51,313 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2018-09-26 08:16:52,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:52,504 INFO L93 Difference]: Finished difference Result 199 states and 201 transitions. [2018-09-26 08:16:52,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:16:52,504 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-09-26 08:16:52,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:52,505 INFO L225 Difference]: With dead ends: 199 [2018-09-26 08:16:52,505 INFO L226 Difference]: Without dead ends: 133 [2018-09-26 08:16:52,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=330, Invalid=9570, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:16:52,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-26 08:16:52,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-09-26 08:16:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-26 08:16:52,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-09-26 08:16:52,641 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2018-09-26 08:16:52,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:52,641 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-09-26 08:16:52,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:16:52,641 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-09-26 08:16:52,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-26 08:16:52,642 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:52,642 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 31, 1, 1, 1, 1] [2018-09-26 08:16:52,643 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:52,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:52,643 INFO L82 PathProgramCache]: Analyzing trace with hash -452907503, now seen corresponding path program 62 times [2018-09-26 08:16:52,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:52,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 992 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:52,755 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:52,755 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:16:52,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:16:52,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:16:52,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:16:52,756 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 36 states. [2018-09-26 08:16:53,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:53,021 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2018-09-26 08:16:53,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:16:53,021 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 132 [2018-09-26 08:16:53,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:53,022 INFO L225 Difference]: With dead ends: 137 [2018-09-26 08:16:53,022 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 08:16:53,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:16:53,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 08:16:53,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-09-26 08:16:53,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-26 08:16:53,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-09-26 08:16:53,173 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2018-09-26 08:16:53,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:53,173 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-09-26 08:16:53,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:16:53,173 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-09-26 08:16:53,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-26 08:16:53,174 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:53,174 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1, 1, 1] [2018-09-26 08:16:53,174 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:53,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:53,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1452361141, now seen corresponding path program 63 times [2018-09-26 08:16:53,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 2112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:53,642 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:53,642 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:16:53,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:16:53,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:16:53,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:16:53,643 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2018-09-26 08:16:54,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:54,857 INFO L93 Difference]: Finished difference Result 205 states and 207 transitions. [2018-09-26 08:16:54,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:16:54,857 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-09-26 08:16:54,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:54,859 INFO L225 Difference]: With dead ends: 205 [2018-09-26 08:16:54,859 INFO L226 Difference]: Without dead ends: 137 [2018-09-26 08:16:54,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=340, Invalid=10166, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:16:54,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-26 08:16:54,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-09-26 08:16:54,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 08:16:54,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-09-26 08:16:54,973 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2018-09-26 08:16:54,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:54,973 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-09-26 08:16:54,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:16:54,973 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-09-26 08:16:54,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 08:16:54,974 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:54,974 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 32, 1, 1, 1, 1] [2018-09-26 08:16:54,975 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:54,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:54,975 INFO L82 PathProgramCache]: Analyzing trace with hash -745371259, now seen corresponding path program 64 times [2018-09-26 08:16:54,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:55,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 1056 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:55,059 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:55,059 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:16:55,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:16:55,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:16:55,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=699, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:16:55,060 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 37 states. [2018-09-26 08:16:55,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:55,286 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2018-09-26 08:16:55,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:16:55,286 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 136 [2018-09-26 08:16:55,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:55,287 INFO L225 Difference]: With dead ends: 141 [2018-09-26 08:16:55,287 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 08:16:55,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:16:55,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 08:16:55,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-09-26 08:16:55,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-26 08:16:55,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-09-26 08:16:55,387 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2018-09-26 08:16:55,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:55,387 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-09-26 08:16:55,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:16:55,388 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-09-26 08:16:55,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-26 08:16:55,388 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:55,388 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1] [2018-09-26 08:16:55,389 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:55,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:55,389 INFO L82 PathProgramCache]: Analyzing trace with hash 957810879, now seen corresponding path program 65 times [2018-09-26 08:16:55,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:55,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 2244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:55,733 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:55,733 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:16:55,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:16:55,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:16:55,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:16:55,735 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2018-09-26 08:16:56,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:56,761 INFO L93 Difference]: Finished difference Result 211 states and 213 transitions. [2018-09-26 08:16:56,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:16:56,761 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-09-26 08:16:56,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:56,762 INFO L225 Difference]: With dead ends: 211 [2018-09-26 08:16:56,762 INFO L226 Difference]: Without dead ends: 141 [2018-09-26 08:16:56,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=350, Invalid=10780, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:16:56,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-26 08:16:56,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-09-26 08:16:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 08:16:56,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-09-26 08:16:56,886 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-09-26 08:16:56,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:56,887 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-09-26 08:16:56,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:16:56,887 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-09-26 08:16:56,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 08:16:56,887 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:56,888 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 33, 1, 1, 1, 1] [2018-09-26 08:16:56,888 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:56,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:56,888 INFO L82 PathProgramCache]: Analyzing trace with hash 32287481, now seen corresponding path program 66 times [2018-09-26 08:16:56,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:57,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1122 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:57,026 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:57,027 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:16:57,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:16:57,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:16:57,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:16:57,028 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 38 states. [2018-09-26 08:16:57,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:57,231 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2018-09-26 08:16:57,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:16:57,231 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 140 [2018-09-26 08:16:57,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:57,232 INFO L225 Difference]: With dead ends: 145 [2018-09-26 08:16:57,233 INFO L226 Difference]: Without dead ends: 143 [2018-09-26 08:16:57,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:16:57,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-26 08:16:57,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-26 08:16:57,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-26 08:16:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-09-26 08:16:57,343 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2018-09-26 08:16:57,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:57,343 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-09-26 08:16:57,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:16:57,343 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-09-26 08:16:57,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-26 08:16:57,344 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:57,344 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1, 1, 1] [2018-09-26 08:16:57,344 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:57,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:57,344 INFO L82 PathProgramCache]: Analyzing trace with hash 963550515, now seen corresponding path program 67 times [2018-09-26 08:16:57,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:57,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:57,730 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:57,730 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:16:57,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:16:57,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:16:57,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:16:57,732 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2018-09-26 08:16:58,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:58,712 INFO L93 Difference]: Finished difference Result 217 states and 219 transitions. [2018-09-26 08:16:58,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:16:58,712 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-09-26 08:16:58,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:58,713 INFO L225 Difference]: With dead ends: 217 [2018-09-26 08:16:58,713 INFO L226 Difference]: Without dead ends: 145 [2018-09-26 08:16:58,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=360, Invalid=11412, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:16:58,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-09-26 08:16:58,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-09-26 08:16:58,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-26 08:16:58,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-09-26 08:16:58,824 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2018-09-26 08:16:58,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:58,824 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-09-26 08:16:58,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:16:58,824 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-09-26 08:16:58,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-26 08:16:58,825 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:58,825 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 34, 1, 1, 1, 1] [2018-09-26 08:16:58,826 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:58,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:58,826 INFO L82 PathProgramCache]: Analyzing trace with hash 2111083117, now seen corresponding path program 68 times [2018-09-26 08:16:58,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:58,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 1190 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:58,927 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:58,927 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:16:58,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:16:58,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:16:58,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=776, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:16:58,928 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 39 states. [2018-09-26 08:16:59,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:59,172 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2018-09-26 08:16:59,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:16:59,172 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 144 [2018-09-26 08:16:59,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:59,173 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:16:59,173 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 08:16:59,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:16:59,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 08:16:59,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-09-26 08:16:59,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 08:16:59,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-09-26 08:16:59,277 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2018-09-26 08:16:59,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:59,277 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-09-26 08:16:59,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:16:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-09-26 08:16:59,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-26 08:16:59,278 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:59,278 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1, 1, 1] [2018-09-26 08:16:59,278 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:59,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:59,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1526364071, now seen corresponding path program 69 times [2018-09-26 08:16:59,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 2520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:59,754 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:59,754 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:16:59,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:16:59,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:16:59,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:16:59,755 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2018-09-26 08:17:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:00,941 INFO L93 Difference]: Finished difference Result 223 states and 225 transitions. [2018-09-26 08:17:00,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:17:00,942 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-09-26 08:17:00,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:00,943 INFO L225 Difference]: With dead ends: 223 [2018-09-26 08:17:00,943 INFO L226 Difference]: Without dead ends: 149 [2018-09-26 08:17:00,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=370, Invalid=12062, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:17:00,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-26 08:17:01,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-09-26 08:17:01,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-26 08:17:01,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-09-26 08:17:01,053 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2018-09-26 08:17:01,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:01,053 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-09-26 08:17:01,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:17:01,053 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-09-26 08:17:01,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 08:17:01,053 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:01,054 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 35, 1, 1, 1, 1] [2018-09-26 08:17:01,054 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:01,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:01,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1687109601, now seen corresponding path program 70 times [2018-09-26 08:17:01,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:01,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 1260 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:01,155 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:01,156 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:17:01,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:17:01,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:17:01,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:17:01,157 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 40 states. [2018-09-26 08:17:01,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:01,364 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2018-09-26 08:17:01,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:17:01,364 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 148 [2018-09-26 08:17:01,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:01,365 INFO L225 Difference]: With dead ends: 153 [2018-09-26 08:17:01,365 INFO L226 Difference]: Without dead ends: 151 [2018-09-26 08:17:01,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1295 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:17:01,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-09-26 08:17:01,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-09-26 08:17:01,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 08:17:01,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-09-26 08:17:01,475 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2018-09-26 08:17:01,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:01,475 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-09-26 08:17:01,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:17:01,475 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-09-26 08:17:01,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-26 08:17:01,476 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:01,476 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1, 1, 1] [2018-09-26 08:17:01,477 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:01,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:01,477 INFO L82 PathProgramCache]: Analyzing trace with hash 2109708315, now seen corresponding path program 71 times [2018-09-26 08:17:01,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:01,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 2664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:01,815 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:01,815 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:17:01,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:17:01,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:17:01,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:17:01,816 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2018-09-26 08:17:02,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:02,952 INFO L93 Difference]: Finished difference Result 229 states and 231 transitions. [2018-09-26 08:17:02,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:17:02,952 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-09-26 08:17:02,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:02,953 INFO L225 Difference]: With dead ends: 229 [2018-09-26 08:17:02,953 INFO L226 Difference]: Without dead ends: 153 [2018-09-26 08:17:02,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=380, Invalid=12730, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:17:02,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-09-26 08:17:03,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-09-26 08:17:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-26 08:17:03,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-09-26 08:17:03,096 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2018-09-26 08:17:03,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:03,096 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-09-26 08:17:03,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:17:03,097 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-09-26 08:17:03,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-26 08:17:03,098 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:03,098 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 36, 1, 1, 1, 1] [2018-09-26 08:17:03,098 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:03,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:03,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1562266795, now seen corresponding path program 72 times [2018-09-26 08:17:03,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:03,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 1332 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:03,228 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:03,228 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:17:03,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:17:03,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:17:03,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=857, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:17:03,229 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 41 states. [2018-09-26 08:17:03,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:03,441 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2018-09-26 08:17:03,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:17:03,442 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 152 [2018-09-26 08:17:03,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:03,443 INFO L225 Difference]: With dead ends: 157 [2018-09-26 08:17:03,443 INFO L226 Difference]: Without dead ends: 155 [2018-09-26 08:17:03,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:17:03,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-26 08:17:03,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-09-26 08:17:03,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-09-26 08:17:03,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-09-26 08:17:03,615 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2018-09-26 08:17:03,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:03,615 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-09-26 08:17:03,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:17:03,615 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-09-26 08:17:03,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-26 08:17:03,616 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:03,616 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1, 1, 1] [2018-09-26 08:17:03,616 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:03,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:03,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1900215951, now seen corresponding path program 73 times [2018-09-26 08:17:03,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:04,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 2812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:04,041 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:04,041 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:17:04,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:17:04,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:17:04,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:17:04,042 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2018-09-26 08:17:05,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:05,193 INFO L93 Difference]: Finished difference Result 235 states and 237 transitions. [2018-09-26 08:17:05,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:17:05,193 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-09-26 08:17:05,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:05,194 INFO L225 Difference]: With dead ends: 235 [2018-09-26 08:17:05,194 INFO L226 Difference]: Without dead ends: 157 [2018-09-26 08:17:05,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=390, Invalid=13416, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:17:05,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-09-26 08:17:05,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-09-26 08:17:05,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-26 08:17:05,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-09-26 08:17:05,334 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2018-09-26 08:17:05,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:05,334 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-09-26 08:17:05,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:17:05,335 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-09-26 08:17:05,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-26 08:17:05,336 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:05,336 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 37, 1, 1, 1, 1] [2018-09-26 08:17:05,336 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:05,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:05,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1257182007, now seen corresponding path program 74 times [2018-09-26 08:17:05,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:05,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 1406 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:05,434 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:05,434 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:17:05,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:17:05,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:17:05,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:17:05,435 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 42 states. [2018-09-26 08:17:05,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:05,677 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2018-09-26 08:17:05,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:17:05,678 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 156 [2018-09-26 08:17:05,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:05,679 INFO L225 Difference]: With dead ends: 161 [2018-09-26 08:17:05,679 INFO L226 Difference]: Without dead ends: 159 [2018-09-26 08:17:05,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1443 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:17:05,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-26 08:17:05,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-09-26 08:17:05,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-09-26 08:17:05,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-09-26 08:17:05,820 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2018-09-26 08:17:05,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:05,821 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-09-26 08:17:05,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:17:05,821 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-09-26 08:17:05,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-26 08:17:05,822 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:05,822 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1, 1, 1] [2018-09-26 08:17:05,822 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:05,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:05,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1266046205, now seen corresponding path program 75 times [2018-09-26 08:17:05,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:06,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 2964 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:06,221 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:06,221 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:17:06,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:17:06,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:17:06,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:17:06,223 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2018-09-26 08:17:07,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:07,549 INFO L93 Difference]: Finished difference Result 241 states and 243 transitions. [2018-09-26 08:17:07,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:17:07,549 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-09-26 08:17:07,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:07,550 INFO L225 Difference]: With dead ends: 241 [2018-09-26 08:17:07,550 INFO L226 Difference]: Without dead ends: 161 [2018-09-26 08:17:07,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=400, Invalid=14120, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:17:07,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-09-26 08:17:07,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-09-26 08:17:07,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 08:17:07,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-09-26 08:17:07,686 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2018-09-26 08:17:07,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:07,686 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-09-26 08:17:07,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:17:07,687 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-09-26 08:17:07,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 08:17:07,687 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:07,687 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 38, 1, 1, 1, 1] [2018-09-26 08:17:07,687 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:07,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:07,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1726082109, now seen corresponding path program 76 times [2018-09-26 08:17:07,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:07,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 1482 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:07,777 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:07,777 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:17:07,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:17:07,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:17:07,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=942, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:17:07,778 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 43 states. [2018-09-26 08:17:07,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:07,981 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2018-09-26 08:17:07,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:17:07,981 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 160 [2018-09-26 08:17:07,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:07,982 INFO L225 Difference]: With dead ends: 165 [2018-09-26 08:17:07,982 INFO L226 Difference]: Without dead ends: 163 [2018-09-26 08:17:07,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:17:07,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-26 08:17:08,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-09-26 08:17:08,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-09-26 08:17:08,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-09-26 08:17:08,111 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2018-09-26 08:17:08,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:08,111 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-09-26 08:17:08,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:17:08,111 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-09-26 08:17:08,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-26 08:17:08,112 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:08,112 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1, 1, 1] [2018-09-26 08:17:08,112 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:08,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:08,112 INFO L82 PathProgramCache]: Analyzing trace with hash 907582839, now seen corresponding path program 77 times [2018-09-26 08:17:08,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 3120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:08,510 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:08,510 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:17:08,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:17:08,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:17:08,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:17:08,512 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2018-09-26 08:17:09,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:09,924 INFO L93 Difference]: Finished difference Result 247 states and 249 transitions. [2018-09-26 08:17:09,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:17:09,924 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-09-26 08:17:09,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:09,925 INFO L225 Difference]: With dead ends: 247 [2018-09-26 08:17:09,925 INFO L226 Difference]: Without dead ends: 165 [2018-09-26 08:17:09,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=410, Invalid=14842, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:17:09,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-09-26 08:17:10,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-09-26 08:17:10,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-26 08:17:10,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-09-26 08:17:10,163 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2018-09-26 08:17:10,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:10,163 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-09-26 08:17:10,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:17:10,163 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-09-26 08:17:10,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-26 08:17:10,164 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:10,164 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 39, 1, 1, 1, 1] [2018-09-26 08:17:10,164 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:10,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:10,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1818644047, now seen corresponding path program 78 times [2018-09-26 08:17:10,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:10,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 1560 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:10,329 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:10,329 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:17:10,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:17:10,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:17:10,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:17:10,330 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 44 states. [2018-09-26 08:17:10,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:10,712 INFO L93 Difference]: Finished difference Result 169 states and 170 transitions. [2018-09-26 08:17:10,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:17:10,713 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 164 [2018-09-26 08:17:10,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:10,714 INFO L225 Difference]: With dead ends: 169 [2018-09-26 08:17:10,714 INFO L226 Difference]: Without dead ends: 167 [2018-09-26 08:17:10,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1599 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:17:10,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-26 08:17:10,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-09-26 08:17:10,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 08:17:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-09-26 08:17:10,849 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2018-09-26 08:17:10,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:10,849 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-09-26 08:17:10,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:17:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-09-26 08:17:10,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-26 08:17:10,851 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:10,851 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1, 1, 1] [2018-09-26 08:17:10,851 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:10,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:10,851 INFO L82 PathProgramCache]: Analyzing trace with hash 334812651, now seen corresponding path program 79 times [2018-09-26 08:17:10,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:11,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 3280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:11,233 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:11,233 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:17:11,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:17:11,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:17:11,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:17:11,234 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2018-09-26 08:17:12,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:12,612 INFO L93 Difference]: Finished difference Result 253 states and 255 transitions. [2018-09-26 08:17:12,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:17:12,612 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-09-26 08:17:12,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:12,613 INFO L225 Difference]: With dead ends: 253 [2018-09-26 08:17:12,613 INFO L226 Difference]: Without dead ends: 169 [2018-09-26 08:17:12,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=420, Invalid=15582, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:17:12,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-09-26 08:17:12,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-09-26 08:17:12,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-26 08:17:12,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-09-26 08:17:12,769 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2018-09-26 08:17:12,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:12,769 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-09-26 08:17:12,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:17:12,769 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-09-26 08:17:12,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-26 08:17:12,770 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:12,770 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 40, 1, 1, 1, 1] [2018-09-26 08:17:12,770 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:12,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:12,771 INFO L82 PathProgramCache]: Analyzing trace with hash -436388571, now seen corresponding path program 80 times [2018-09-26 08:17:12,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:12,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 1640 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:12,883 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:12,883 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:17:12,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:17:12,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:17:12,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1031, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:17:12,885 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 45 states. [2018-09-26 08:17:13,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:13,151 INFO L93 Difference]: Finished difference Result 173 states and 174 transitions. [2018-09-26 08:17:13,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:17:13,151 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 168 [2018-09-26 08:17:13,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:13,152 INFO L225 Difference]: With dead ends: 173 [2018-09-26 08:17:13,152 INFO L226 Difference]: Without dead ends: 171 [2018-09-26 08:17:13,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:17:13,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-09-26 08:17:13,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-09-26 08:17:13,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-26 08:17:13,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-09-26 08:17:13,311 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2018-09-26 08:17:13,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:13,311 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-09-26 08:17:13,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:17:13,311 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-09-26 08:17:13,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-26 08:17:13,312 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:13,312 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1, 1, 1] [2018-09-26 08:17:13,312 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:13,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:13,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1537430623, now seen corresponding path program 81 times [2018-09-26 08:17:13,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 3444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:13,749 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:13,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:17:13,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:17:13,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:17:13,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:17:13,750 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2018-09-26 08:17:15,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:15,200 INFO L93 Difference]: Finished difference Result 259 states and 261 transitions. [2018-09-26 08:17:15,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:17:15,200 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-09-26 08:17:15,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:15,201 INFO L225 Difference]: With dead ends: 259 [2018-09-26 08:17:15,201 INFO L226 Difference]: Without dead ends: 173 [2018-09-26 08:17:15,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=430, Invalid=16340, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:17:15,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-09-26 08:17:15,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-09-26 08:17:15,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 08:17:15,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2018-09-26 08:17:15,363 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2018-09-26 08:17:15,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:15,363 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2018-09-26 08:17:15,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:17:15,363 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2018-09-26 08:17:15,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-26 08:17:15,364 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:15,364 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 41, 1, 1, 1, 1] [2018-09-26 08:17:15,364 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:15,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:15,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1739485543, now seen corresponding path program 82 times [2018-09-26 08:17:15,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:15,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 1722 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:15,469 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:15,470 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:17:15,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:17:15,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:17:15,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1077, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:17:15,471 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 46 states. [2018-09-26 08:17:15,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:15,733 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2018-09-26 08:17:15,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:17:15,733 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 172 [2018-09-26 08:17:15,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:15,734 INFO L225 Difference]: With dead ends: 177 [2018-09-26 08:17:15,734 INFO L226 Difference]: Without dead ends: 175 [2018-09-26 08:17:15,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1763 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:17:15,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-09-26 08:17:15,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-09-26 08:17:15,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-26 08:17:15,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-09-26 08:17:15,897 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2018-09-26 08:17:15,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:15,897 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-09-26 08:17:15,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:17:15,897 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-09-26 08:17:15,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-26 08:17:15,898 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:15,898 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1, 1, 1] [2018-09-26 08:17:15,899 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:15,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:15,899 INFO L82 PathProgramCache]: Analyzing trace with hash -903276333, now seen corresponding path program 83 times [2018-09-26 08:17:15,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:16,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 3612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:16,357 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:16,357 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:17:16,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:17:16,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:17:16,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:17:16,358 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2018-09-26 08:17:17,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:17,912 INFO L93 Difference]: Finished difference Result 265 states and 267 transitions. [2018-09-26 08:17:17,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:17:17,913 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-09-26 08:17:17,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:17,913 INFO L225 Difference]: With dead ends: 265 [2018-09-26 08:17:17,914 INFO L226 Difference]: Without dead ends: 177 [2018-09-26 08:17:17,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=440, Invalid=17116, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:17:17,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-09-26 08:17:18,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-09-26 08:17:18,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-26 08:17:18,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-09-26 08:17:18,086 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2018-09-26 08:17:18,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:18,086 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-09-26 08:17:18,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:17:18,086 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-09-26 08:17:18,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-26 08:17:18,087 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:18,087 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 42, 1, 1, 1, 1] [2018-09-26 08:17:18,087 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:18,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:18,088 INFO L82 PathProgramCache]: Analyzing trace with hash 878421517, now seen corresponding path program 84 times [2018-09-26 08:17:18,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:18,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 1806 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:18,207 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:18,207 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:17:18,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:17:18,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:17:18,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=1124, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:17:18,208 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 47 states. [2018-09-26 08:17:18,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:18,481 INFO L93 Difference]: Finished difference Result 181 states and 182 transitions. [2018-09-26 08:17:18,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:17:18,482 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 176 [2018-09-26 08:17:18,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:18,483 INFO L225 Difference]: With dead ends: 181 [2018-09-26 08:17:18,483 INFO L226 Difference]: Without dead ends: 179 [2018-09-26 08:17:18,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1848 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:17:18,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-26 08:17:18,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-09-26 08:17:18,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-09-26 08:17:18,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-09-26 08:17:18,662 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2018-09-26 08:17:18,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:18,663 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-09-26 08:17:18,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:17:18,663 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-09-26 08:17:18,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-26 08:17:18,664 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:18,664 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1, 1, 1] [2018-09-26 08:17:18,664 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:18,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:18,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1945427129, now seen corresponding path program 85 times [2018-09-26 08:17:18,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:19,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 3784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:19,120 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:19,120 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:17:19,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:17:19,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:17:19,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:17:19,122 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2018-09-26 08:17:20,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:20,626 INFO L93 Difference]: Finished difference Result 271 states and 273 transitions. [2018-09-26 08:17:20,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:17:20,626 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-09-26 08:17:20,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:20,627 INFO L225 Difference]: With dead ends: 271 [2018-09-26 08:17:20,627 INFO L226 Difference]: Without dead ends: 181 [2018-09-26 08:17:20,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=450, Invalid=17910, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:17:20,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-09-26 08:17:20,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-09-26 08:17:20,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-26 08:17:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-09-26 08:17:20,811 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2018-09-26 08:17:20,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:20,811 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-09-26 08:17:20,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:17:20,812 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-09-26 08:17:20,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-26 08:17:20,812 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:20,812 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 43, 1, 1, 1, 1] [2018-09-26 08:17:20,813 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:20,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:20,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1398834049, now seen corresponding path program 86 times [2018-09-26 08:17:20,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3872 backedges. 1892 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:20,994 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:20,994 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:17:20,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:17:20,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:17:20,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1172, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:17:20,995 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 48 states. [2018-09-26 08:17:21,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:21,339 INFO L93 Difference]: Finished difference Result 185 states and 186 transitions. [2018-09-26 08:17:21,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:17:21,339 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2018-09-26 08:17:21,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:21,340 INFO L225 Difference]: With dead ends: 185 [2018-09-26 08:17:21,340 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 08:17:21,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1935 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:17:21,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 08:17:21,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-09-26 08:17:21,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-09-26 08:17:21,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-09-26 08:17:21,511 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2018-09-26 08:17:21,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:21,512 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-09-26 08:17:21,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:17:21,512 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-09-26 08:17:21,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-26 08:17:21,512 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:21,512 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1, 1, 1] [2018-09-26 08:17:21,513 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:21,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:21,513 INFO L82 PathProgramCache]: Analyzing trace with hash -45190213, now seen corresponding path program 87 times [2018-09-26 08:17:21,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:21,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 3960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:21,980 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:21,980 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:17:21,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:17:21,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:17:21,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:17:21,981 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2018-09-26 08:17:23,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:23,498 INFO L93 Difference]: Finished difference Result 277 states and 279 transitions. [2018-09-26 08:17:23,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:17:23,498 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-09-26 08:17:23,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:23,499 INFO L225 Difference]: With dead ends: 277 [2018-09-26 08:17:23,499 INFO L226 Difference]: Without dead ends: 185 [2018-09-26 08:17:23,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1039 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=460, Invalid=18722, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:17:23,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-09-26 08:17:23,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-09-26 08:17:23,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-26 08:17:23,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-09-26 08:17:23,663 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2018-09-26 08:17:23,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:23,663 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-09-26 08:17:23,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:17:23,663 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-09-26 08:17:23,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-26 08:17:23,664 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:23,664 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 44, 1, 1, 1, 1] [2018-09-26 08:17:23,665 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:23,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:23,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1579493109, now seen corresponding path program 88 times [2018-09-26 08:17:23,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 1980 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:23,780 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:23,780 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:17:23,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:17:23,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:17:23,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=1221, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:17:23,781 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 49 states. [2018-09-26 08:17:24,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:24,103 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2018-09-26 08:17:24,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:17:24,103 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-09-26 08:17:24,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:24,104 INFO L225 Difference]: With dead ends: 189 [2018-09-26 08:17:24,104 INFO L226 Difference]: Without dead ends: 187 [2018-09-26 08:17:24,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2024 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:17:24,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-09-26 08:17:24,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-09-26 08:17:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-09-26 08:17:24,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-09-26 08:17:24,385 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2018-09-26 08:17:24,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:24,385 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-09-26 08:17:24,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:17:24,385 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-09-26 08:17:24,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-26 08:17:24,386 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:24,386 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1, 1, 1] [2018-09-26 08:17:24,387 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:24,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:24,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1769474607, now seen corresponding path program 89 times [2018-09-26 08:17:24,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:25,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 4140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:25,005 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:25,005 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:17:25,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:17:25,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:17:25,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:17:25,006 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2018-09-26 08:17:26,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:26,607 INFO L93 Difference]: Finished difference Result 283 states and 285 transitions. [2018-09-26 08:17:26,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:17:26,607 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-09-26 08:17:26,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:26,608 INFO L225 Difference]: With dead ends: 283 [2018-09-26 08:17:26,608 INFO L226 Difference]: Without dead ends: 189 [2018-09-26 08:17:26,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=470, Invalid=19552, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:17:26,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-09-26 08:17:26,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-09-26 08:17:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-26 08:17:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-09-26 08:17:26,773 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2018-09-26 08:17:26,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:26,773 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-09-26 08:17:26,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:17:26,773 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-09-26 08:17:26,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-26 08:17:26,774 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:26,775 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 45, 1, 1, 1, 1] [2018-09-26 08:17:26,775 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:26,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:26,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1290702953, now seen corresponding path program 90 times [2018-09-26 08:17:26,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:26,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 2070 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:26,897 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:26,897 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:17:26,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:17:26,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:17:26,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:17:26,899 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 50 states. [2018-09-26 08:17:27,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:27,162 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2018-09-26 08:17:27,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:17:27,162 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 188 [2018-09-26 08:17:27,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:27,163 INFO L225 Difference]: With dead ends: 193 [2018-09-26 08:17:27,163 INFO L226 Difference]: Without dead ends: 191 [2018-09-26 08:17:27,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:17:27,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-09-26 08:17:27,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-09-26 08:17:27,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-26 08:17:27,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-09-26 08:17:27,331 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2018-09-26 08:17:27,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:27,331 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-09-26 08:17:27,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:17:27,332 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-09-26 08:17:27,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-26 08:17:27,332 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:27,332 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1, 1, 1] [2018-09-26 08:17:27,332 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:27,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:27,333 INFO L82 PathProgramCache]: Analyzing trace with hash -879958365, now seen corresponding path program 91 times [2018-09-26 08:17:27,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:27,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 4324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:27,805 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:27,805 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:17:27,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:17:27,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:17:27,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:17:27,807 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2018-09-26 08:17:29,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:29,453 INFO L93 Difference]: Finished difference Result 289 states and 291 transitions. [2018-09-26 08:17:29,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:17:29,453 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-09-26 08:17:29,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:29,454 INFO L225 Difference]: With dead ends: 289 [2018-09-26 08:17:29,454 INFO L226 Difference]: Without dead ends: 193 [2018-09-26 08:17:29,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1132 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=480, Invalid=20400, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:17:29,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-09-26 08:17:29,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-09-26 08:17:29,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-26 08:17:29,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-09-26 08:17:29,636 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2018-09-26 08:17:29,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:29,637 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-09-26 08:17:29,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:17:29,637 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-09-26 08:17:29,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-26 08:17:29,638 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:29,638 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 46, 1, 1, 1, 1] [2018-09-26 08:17:29,638 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:29,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:29,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1736556509, now seen corresponding path program 92 times [2018-09-26 08:17:29,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 2162 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:29,766 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:29,766 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:17:29,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:17:29,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:17:29,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=1322, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:17:29,767 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 51 states. [2018-09-26 08:17:30,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:30,033 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2018-09-26 08:17:30,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:17:30,033 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2018-09-26 08:17:30,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:30,034 INFO L225 Difference]: With dead ends: 197 [2018-09-26 08:17:30,035 INFO L226 Difference]: Without dead ends: 195 [2018-09-26 08:17:30,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2208 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:17:30,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-26 08:17:30,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-09-26 08:17:30,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-09-26 08:17:30,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-09-26 08:17:30,222 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2018-09-26 08:17:30,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:30,222 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-09-26 08:17:30,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:17:30,222 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-09-26 08:17:30,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-09-26 08:17:30,223 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:30,223 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1, 1, 1] [2018-09-26 08:17:30,223 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:30,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:30,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1911420649, now seen corresponding path program 93 times [2018-09-26 08:17:30,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:30,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 4512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:30,696 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:30,696 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:17:30,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:17:30,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:17:30,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:17:30,697 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2018-09-26 08:17:32,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:32,516 INFO L93 Difference]: Finished difference Result 295 states and 297 transitions. [2018-09-26 08:17:32,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:17:32,517 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-09-26 08:17:32,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:32,517 INFO L225 Difference]: With dead ends: 295 [2018-09-26 08:17:32,518 INFO L226 Difference]: Without dead ends: 197 [2018-09-26 08:17:32,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=490, Invalid=21266, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:17:32,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-09-26 08:17:32,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-09-26 08:17:32,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-26 08:17:32,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-09-26 08:17:32,701 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2018-09-26 08:17:32,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:32,701 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-09-26 08:17:32,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:17:32,702 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-09-26 08:17:32,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-26 08:17:32,702 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:32,703 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 47, 1, 1, 1, 1] [2018-09-26 08:17:32,703 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:32,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:32,703 INFO L82 PathProgramCache]: Analyzing trace with hash 86226257, now seen corresponding path program 94 times [2018-09-26 08:17:32,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:32,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4608 backedges. 2256 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:32,843 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:32,844 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:17:32,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:17:32,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:17:32,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1374, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:17:32,845 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 52 states. [2018-09-26 08:17:33,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:33,122 INFO L93 Difference]: Finished difference Result 201 states and 202 transitions. [2018-09-26 08:17:33,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:17:33,122 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 196 [2018-09-26 08:17:33,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:33,123 INFO L225 Difference]: With dead ends: 201 [2018-09-26 08:17:33,123 INFO L226 Difference]: Without dead ends: 199 [2018-09-26 08:17:33,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2303 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:17:33,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-26 08:17:33,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-09-26 08:17:33,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-09-26 08:17:33,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-09-26 08:17:33,302 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2018-09-26 08:17:33,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:33,302 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-09-26 08:17:33,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:17:33,302 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-09-26 08:17:33,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-09-26 08:17:33,303 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:33,303 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1, 1, 1] [2018-09-26 08:17:33,304 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:33,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:33,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1259106699, now seen corresponding path program 95 times [2018-09-26 08:17:33,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 4704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:33,807 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:33,807 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:17:33,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:17:33,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:17:33,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:17:33,809 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2018-09-26 08:17:35,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:35,665 INFO L93 Difference]: Finished difference Result 301 states and 303 transitions. [2018-09-26 08:17:35,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:17:35,665 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-09-26 08:17:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:35,666 INFO L225 Difference]: With dead ends: 301 [2018-09-26 08:17:35,666 INFO L226 Difference]: Without dead ends: 201 [2018-09-26 08:17:35,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=500, Invalid=22150, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:17:35,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-09-26 08:17:35,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-09-26 08:17:35,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-26 08:17:35,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-09-26 08:17:35,853 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2018-09-26 08:17:35,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:35,853 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-09-26 08:17:35,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:17:35,853 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-09-26 08:17:35,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-26 08:17:35,854 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:35,855 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 48, 1, 1, 1, 1] [2018-09-26 08:17:35,855 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:35,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:35,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1285124293, now seen corresponding path program 96 times [2018-09-26 08:17:35,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:36,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4802 backedges. 2352 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:36,026 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:36,026 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:17:36,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:17:36,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:17:36,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1329, Invalid=1427, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:17:36,027 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 53 states. [2018-09-26 08:17:36,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:36,330 INFO L93 Difference]: Finished difference Result 205 states and 206 transitions. [2018-09-26 08:17:36,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:17:36,331 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 200 [2018-09-26 08:17:36,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:36,332 INFO L225 Difference]: With dead ends: 205 [2018-09-26 08:17:36,332 INFO L226 Difference]: Without dead ends: 203 [2018-09-26 08:17:36,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2400 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:17:36,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-09-26 08:17:36,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-09-26 08:17:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 08:17:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-09-26 08:17:36,519 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2018-09-26 08:17:36,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:36,519 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-09-26 08:17:36,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:17:36,519 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-09-26 08:17:36,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-26 08:17:36,520 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:36,520 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1, 1, 1] [2018-09-26 08:17:36,520 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:36,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:36,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1946083329, now seen corresponding path program 97 times [2018-09-26 08:17:36,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:37,047 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:37,047 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:17:37,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:17:37,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:17:37,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:17:37,048 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2018-09-26 08:17:38,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:38,900 INFO L93 Difference]: Finished difference Result 307 states and 309 transitions. [2018-09-26 08:17:38,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:17:38,900 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-09-26 08:17:38,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:38,901 INFO L225 Difference]: With dead ends: 307 [2018-09-26 08:17:38,901 INFO L226 Difference]: Without dead ends: 205 [2018-09-26 08:17:38,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1279 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=510, Invalid=23052, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:17:38,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-09-26 08:17:39,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-09-26 08:17:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-26 08:17:39,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-09-26 08:17:39,094 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2018-09-26 08:17:39,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:39,095 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-09-26 08:17:39,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:17:39,095 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-09-26 08:17:39,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-26 08:17:39,095 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:39,096 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 49, 1, 1, 1, 1] [2018-09-26 08:17:39,096 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:39,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:39,096 INFO L82 PathProgramCache]: Analyzing trace with hash -198708679, now seen corresponding path program 98 times [2018-09-26 08:17:39,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:39,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5000 backedges. 2450 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:39,235 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:39,235 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:17:39,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:17:39,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:17:39,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:17:39,236 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 54 states. [2018-09-26 08:17:39,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:39,550 INFO L93 Difference]: Finished difference Result 209 states and 210 transitions. [2018-09-26 08:17:39,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:17:39,551 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 204 [2018-09-26 08:17:39,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:39,551 INFO L225 Difference]: With dead ends: 209 [2018-09-26 08:17:39,552 INFO L226 Difference]: Without dead ends: 207 [2018-09-26 08:17:39,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2499 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:17:39,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-09-26 08:17:39,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-09-26 08:17:39,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-26 08:17:39,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-09-26 08:17:39,775 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2018-09-26 08:17:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:39,776 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-09-26 08:17:39,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:17:39,776 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-09-26 08:17:39,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-26 08:17:39,777 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:39,777 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1, 1, 1] [2018-09-26 08:17:39,777 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:39,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:39,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1980427149, now seen corresponding path program 99 times [2018-09-26 08:17:39,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:40,397 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 5100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:40,397 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:40,397 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:17:40,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:17:40,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:17:40,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:17:40,398 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2018-09-26 08:17:42,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:42,395 INFO L93 Difference]: Finished difference Result 313 states and 315 transitions. [2018-09-26 08:17:42,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:17:42,396 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2018-09-26 08:17:42,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:42,397 INFO L225 Difference]: With dead ends: 313 [2018-09-26 08:17:42,397 INFO L226 Difference]: Without dead ends: 209 [2018-09-26 08:17:42,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=520, Invalid=23972, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:17:42,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-26 08:17:42,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-09-26 08:17:42,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-26 08:17:42,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-09-26 08:17:42,600 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2018-09-26 08:17:42,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:42,600 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-09-26 08:17:42,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:17:42,600 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-09-26 08:17:42,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-26 08:17:42,601 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:42,601 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 50, 1, 1, 1, 1] [2018-09-26 08:17:42,601 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:42,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:42,602 INFO L82 PathProgramCache]: Analyzing trace with hash 26491309, now seen corresponding path program 100 times [2018-09-26 08:17:42,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5202 backedges. 2550 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:42,744 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:42,744 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:17:42,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:17:42,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:17:42,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=1536, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:17:42,745 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 55 states. [2018-09-26 08:17:43,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:43,063 INFO L93 Difference]: Finished difference Result 213 states and 214 transitions. [2018-09-26 08:17:43,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:17:43,063 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 208 [2018-09-26 08:17:43,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:43,064 INFO L225 Difference]: With dead ends: 213 [2018-09-26 08:17:43,064 INFO L226 Difference]: Without dead ends: 211 [2018-09-26 08:17:43,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2600 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:17:43,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-26 08:17:43,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-09-26 08:17:43,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-26 08:17:43,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-09-26 08:17:43,272 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2018-09-26 08:17:43,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:43,272 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-09-26 08:17:43,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:17:43,273 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-09-26 08:17:43,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-26 08:17:43,274 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:43,274 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1, 1, 1] [2018-09-26 08:17:43,274 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:43,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:43,274 INFO L82 PathProgramCache]: Analyzing trace with hash -311603481, now seen corresponding path program 101 times [2018-09-26 08:17:43,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:43,928 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 5304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:43,929 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:43,929 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:17:43,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:17:43,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:17:43,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:17:43,930 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 106 states. [2018-09-26 08:17:45,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:45,921 INFO L93 Difference]: Finished difference Result 319 states and 321 transitions. [2018-09-26 08:17:45,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:17:45,922 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2018-09-26 08:17:45,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:45,923 INFO L225 Difference]: With dead ends: 319 [2018-09-26 08:17:45,923 INFO L226 Difference]: Without dead ends: 213 [2018-09-26 08:17:45,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1382 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=530, Invalid=24910, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:17:45,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-09-26 08:17:46,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-09-26 08:17:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-26 08:17:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2018-09-26 08:17:46,171 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2018-09-26 08:17:46,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:46,171 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2018-09-26 08:17:46,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:17:46,171 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2018-09-26 08:17:46,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-26 08:17:46,172 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:46,173 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 51, 1, 1, 1, 1] [2018-09-26 08:17:46,173 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:46,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:46,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1977399519, now seen corresponding path program 102 times [2018-09-26 08:17:46,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5408 backedges. 2652 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:46,354 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:46,354 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:17:46,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:17:46,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:17:46,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1592, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:17:46,356 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 56 states. [2018-09-26 08:17:46,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:46,696 INFO L93 Difference]: Finished difference Result 217 states and 218 transitions. [2018-09-26 08:17:46,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:17:46,696 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 212 [2018-09-26 08:17:46,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:46,697 INFO L225 Difference]: With dead ends: 217 [2018-09-26 08:17:46,697 INFO L226 Difference]: Without dead ends: 215 [2018-09-26 08:17:46,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2703 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:17:46,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-26 08:17:46,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-09-26 08:17:46,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-09-26 08:17:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-09-26 08:17:46,912 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 212 [2018-09-26 08:17:46,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:46,912 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-09-26 08:17:46,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:17:46,912 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-09-26 08:17:46,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-09-26 08:17:46,913 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:46,913 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1, 1, 1] [2018-09-26 08:17:46,913 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:46,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:46,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1905340581, now seen corresponding path program 103 times [2018-09-26 08:17:46,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:47,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 5512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:47,513 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:47,513 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:17:47,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:17:47,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:17:47,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:17:47,515 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 108 states. [2018-09-26 08:17:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:49,671 INFO L93 Difference]: Finished difference Result 325 states and 327 transitions. [2018-09-26 08:17:49,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:17:49,671 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 214 [2018-09-26 08:17:49,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:49,672 INFO L225 Difference]: With dead ends: 325 [2018-09-26 08:17:49,672 INFO L226 Difference]: Without dead ends: 217 [2018-09-26 08:17:49,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1435 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=540, Invalid=25866, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:17:49,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-09-26 08:17:49,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-09-26 08:17:49,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-26 08:17:49,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-09-26 08:17:49,893 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 214 [2018-09-26 08:17:49,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:49,894 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-09-26 08:17:49,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:17:49,894 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-09-26 08:17:49,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-26 08:17:49,894 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:49,894 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 52, 1, 1, 1, 1] [2018-09-26 08:17:49,895 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:49,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:49,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1922701973, now seen corresponding path program 104 times [2018-09-26 08:17:49,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:50,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5618 backedges. 2756 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:50,052 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:50,052 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:17:50,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:17:50,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:17:50,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1543, Invalid=1649, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:17:50,053 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 57 states. [2018-09-26 08:17:50,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:50,398 INFO L93 Difference]: Finished difference Result 221 states and 222 transitions. [2018-09-26 08:17:50,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:17:50,398 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 216 [2018-09-26 08:17:50,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:50,399 INFO L225 Difference]: With dead ends: 221 [2018-09-26 08:17:50,399 INFO L226 Difference]: Without dead ends: 219 [2018-09-26 08:17:50,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2808 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:17:50,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-26 08:17:50,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-09-26 08:17:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-09-26 08:17:50,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2018-09-26 08:17:50,622 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 216 [2018-09-26 08:17:50,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:50,623 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2018-09-26 08:17:50,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:17:50,623 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2018-09-26 08:17:50,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-09-26 08:17:50,623 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:50,623 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1, 1, 1] [2018-09-26 08:17:50,624 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:50,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:50,624 INFO L82 PathProgramCache]: Analyzing trace with hash 880711119, now seen corresponding path program 105 times [2018-09-26 08:17:50,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 5724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:51,225 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:51,225 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:17:51,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:17:51,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:17:51,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:17:51,227 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 110 states. [2018-09-26 08:17:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:53,534 INFO L93 Difference]: Finished difference Result 331 states and 333 transitions. [2018-09-26 08:17:53,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-09-26 08:17:53,534 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 218 [2018-09-26 08:17:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:53,535 INFO L225 Difference]: With dead ends: 331 [2018-09-26 08:17:53,535 INFO L226 Difference]: Without dead ends: 221 [2018-09-26 08:17:53,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1489 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=550, Invalid=26840, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:17:53,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-09-26 08:17:53,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-09-26 08:17:53,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-26 08:17:53,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 222 transitions. [2018-09-26 08:17:53,764 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 222 transitions. Word has length 218 [2018-09-26 08:17:53,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:53,765 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 222 transitions. [2018-09-26 08:17:53,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:17:53,765 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 222 transitions. [2018-09-26 08:17:53,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-26 08:17:53,766 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:53,766 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 54, 53, 1, 1, 1, 1] [2018-09-26 08:17:53,766 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:53,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:53,767 INFO L82 PathProgramCache]: Analyzing trace with hash 792572937, now seen corresponding path program 106 times [2018-09-26 08:17:53,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:53,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 2862 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:53,933 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:53,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:17:53,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:17:53,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:17:53,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=1707, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:17:53,934 INFO L87 Difference]: Start difference. First operand 221 states and 222 transitions. Second operand 58 states. [2018-09-26 08:17:54,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:54,296 INFO L93 Difference]: Finished difference Result 225 states and 226 transitions. [2018-09-26 08:17:54,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-09-26 08:17:54,296 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 220 [2018-09-26 08:17:54,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:54,297 INFO L225 Difference]: With dead ends: 225 [2018-09-26 08:17:54,297 INFO L226 Difference]: Without dead ends: 223 [2018-09-26 08:17:54,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2915 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:17:54,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-09-26 08:17:54,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-09-26 08:17:54,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-09-26 08:17:54,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2018-09-26 08:17:54,534 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 220 [2018-09-26 08:17:54,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:54,534 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2018-09-26 08:17:54,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:17:54,534 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2018-09-26 08:17:54,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-09-26 08:17:54,535 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:54,535 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1, 1, 1] [2018-09-26 08:17:54,535 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:54,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:54,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1453433411, now seen corresponding path program 107 times [2018-09-26 08:17:54,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 5940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:55,263 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:55,263 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:17:55,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:17:55,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:17:55,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:17:55,265 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 112 states. [2018-09-26 08:17:57,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:57,645 INFO L93 Difference]: Finished difference Result 337 states and 339 transitions. [2018-09-26 08:17:57,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-26 08:17:57,646 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 222 [2018-09-26 08:17:57,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:57,646 INFO L225 Difference]: With dead ends: 337 [2018-09-26 08:17:57,646 INFO L226 Difference]: Without dead ends: 225 [2018-09-26 08:17:57,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1544 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=560, Invalid=27832, Unknown=0, NotChecked=0, Total=28392 [2018-09-26 08:17:57,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-09-26 08:17:57,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-09-26 08:17:57,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-26 08:17:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-09-26 08:17:57,882 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 222 [2018-09-26 08:17:57,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:57,882 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-09-26 08:17:57,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:17:57,882 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-09-26 08:17:57,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-26 08:17:57,883 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:57,883 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 55, 54, 1, 1, 1, 1] [2018-09-26 08:17:57,883 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:57,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:57,884 INFO L82 PathProgramCache]: Analyzing trace with hash -2083318915, now seen corresponding path program 108 times [2018-09-26 08:17:57,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:58,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 2970 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:58,040 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:58,041 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:17:58,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:17:58,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:17:58,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1656, Invalid=1766, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:17:58,041 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 59 states. [2018-09-26 08:17:58,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:58,417 INFO L93 Difference]: Finished difference Result 229 states and 230 transitions. [2018-09-26 08:17:58,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-26 08:17:58,417 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 224 [2018-09-26 08:17:58,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:58,418 INFO L225 Difference]: With dead ends: 229 [2018-09-26 08:17:58,418 INFO L226 Difference]: Without dead ends: 227 [2018-09-26 08:17:58,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3024 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:17:58,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-09-26 08:17:58,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-09-26 08:17:58,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-26 08:17:58,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2018-09-26 08:17:58,669 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 224 [2018-09-26 08:17:58,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:58,669 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2018-09-26 08:17:58,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:17:58,669 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2018-09-26 08:17:58,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-26 08:17:58,670 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:58,670 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1, 1, 1] [2018-09-26 08:17:58,670 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:58,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:58,670 INFO L82 PathProgramCache]: Analyzing trace with hash -614665033, now seen corresponding path program 109 times [2018-09-26 08:17:58,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 6160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:59,307 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:59,307 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:17:59,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:17:59,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:17:59,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:17:59,308 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 114 states. [2018-09-26 08:18:01,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:01,973 INFO L93 Difference]: Finished difference Result 343 states and 345 transitions. [2018-09-26 08:18:01,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:18:01,974 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 226 [2018-09-26 08:18:01,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:01,974 INFO L225 Difference]: With dead ends: 343 [2018-09-26 08:18:01,975 INFO L226 Difference]: Without dead ends: 229 [2018-09-26 08:18:01,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=570, Invalid=28842, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:18:01,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-26 08:18:02,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-09-26 08:18:02,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-26 08:18:02,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2018-09-26 08:18:02,247 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 226 [2018-09-26 08:18:02,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:02,247 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2018-09-26 08:18:02,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:18:02,247 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2018-09-26 08:18:02,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-26 08:18:02,248 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:02,248 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 56, 55, 1, 1, 1, 1] [2018-09-26 08:18:02,248 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:02,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:02,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1134508273, now seen corresponding path program 110 times [2018-09-26 08:18:02,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:02,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6272 backedges. 3080 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:02,427 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:02,428 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:18:02,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:18:02,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:18:02,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1714, Invalid=1826, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:18:02,429 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 60 states. [2018-09-26 08:18:02,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:02,827 INFO L93 Difference]: Finished difference Result 233 states and 234 transitions. [2018-09-26 08:18:02,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:18:02,827 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 228 [2018-09-26 08:18:02,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:02,828 INFO L225 Difference]: With dead ends: 233 [2018-09-26 08:18:02,828 INFO L226 Difference]: Without dead ends: 231 [2018-09-26 08:18:02,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3135 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:18:02,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-09-26 08:18:03,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-09-26 08:18:03,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-09-26 08:18:03,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-09-26 08:18:03,113 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 228 [2018-09-26 08:18:03,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:03,114 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-09-26 08:18:03,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:18:03,114 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-09-26 08:18:03,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-26 08:18:03,115 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:03,115 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1, 1, 1] [2018-09-26 08:18:03,115 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:03,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:03,115 INFO L82 PathProgramCache]: Analyzing trace with hash -659190485, now seen corresponding path program 111 times [2018-09-26 08:18:03,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 6384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:03,831 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:03,831 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:18:03,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:18:03,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:18:03,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:18:03,833 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 116 states. [2018-09-26 08:18:06,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:06,410 INFO L93 Difference]: Finished difference Result 349 states and 351 transitions. [2018-09-26 08:18:06,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-09-26 08:18:06,410 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 230 [2018-09-26 08:18:06,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:06,411 INFO L225 Difference]: With dead ends: 349 [2018-09-26 08:18:06,411 INFO L226 Difference]: Without dead ends: 233 [2018-09-26 08:18:06,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1657 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=580, Invalid=29870, Unknown=0, NotChecked=0, Total=30450 [2018-09-26 08:18:06,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-09-26 08:18:06,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-09-26 08:18:06,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-26 08:18:06,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2018-09-26 08:18:06,661 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 230 [2018-09-26 08:18:06,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:06,661 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2018-09-26 08:18:06,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:18:06,661 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2018-09-26 08:18:06,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-26 08:18:06,662 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:06,662 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 57, 56, 1, 1, 1, 1] [2018-09-26 08:18:06,662 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:06,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:06,662 INFO L82 PathProgramCache]: Analyzing trace with hash 291972197, now seen corresponding path program 112 times [2018-09-26 08:18:06,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:06,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 3192 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:06,834 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:06,835 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:18:06,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:18:06,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:18:06,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1773, Invalid=1887, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:18:06,835 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 61 states. [2018-09-26 08:18:07,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:07,236 INFO L93 Difference]: Finished difference Result 237 states and 238 transitions. [2018-09-26 08:18:07,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-09-26 08:18:07,236 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 232 [2018-09-26 08:18:07,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:07,237 INFO L225 Difference]: With dead ends: 237 [2018-09-26 08:18:07,237 INFO L226 Difference]: Without dead ends: 235 [2018-09-26 08:18:07,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3248 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:18:07,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-26 08:18:07,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-09-26 08:18:07,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-09-26 08:18:07,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2018-09-26 08:18:07,492 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 232 [2018-09-26 08:18:07,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:07,492 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2018-09-26 08:18:07,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:18:07,492 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2018-09-26 08:18:07,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-09-26 08:18:07,493 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:07,493 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1, 1, 1] [2018-09-26 08:18:07,493 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:07,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:07,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1412459423, now seen corresponding path program 113 times [2018-09-26 08:18:07,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:08,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 6612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:08,252 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:08,252 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-09-26 08:18:08,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 08:18:08,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 08:18:08,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:18:08,254 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 118 states. [2018-09-26 08:18:11,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:11,105 INFO L93 Difference]: Finished difference Result 355 states and 357 transitions. [2018-09-26 08:18:11,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-09-26 08:18:11,105 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 234 [2018-09-26 08:18:11,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:11,106 INFO L225 Difference]: With dead ends: 355 [2018-09-26 08:18:11,106 INFO L226 Difference]: Without dead ends: 237 [2018-09-26 08:18:11,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1715 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=590, Invalid=30916, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 08:18:11,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-26 08:18:11,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-09-26 08:18:11,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-26 08:18:11,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2018-09-26 08:18:11,398 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 234 [2018-09-26 08:18:11,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:11,399 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2018-09-26 08:18:11,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 08:18:11,399 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2018-09-26 08:18:11,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-26 08:18:11,399 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:11,400 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 58, 57, 1, 1, 1, 1] [2018-09-26 08:18:11,400 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:11,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:11,400 INFO L82 PathProgramCache]: Analyzing trace with hash 527422937, now seen corresponding path program 114 times [2018-09-26 08:18:11,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:11,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6728 backedges. 3306 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:11,595 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:11,596 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:18:11,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:18:11,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:18:11,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1833, Invalid=1949, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:18:11,597 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 62 states. [2018-09-26 08:18:12,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:12,051 INFO L93 Difference]: Finished difference Result 241 states and 242 transitions. [2018-09-26 08:18:12,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-09-26 08:18:12,051 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 236 [2018-09-26 08:18:12,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:12,052 INFO L225 Difference]: With dead ends: 241 [2018-09-26 08:18:12,052 INFO L226 Difference]: Without dead ends: 239 [2018-09-26 08:18:12,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3363 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:18:12,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-26 08:18:12,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-09-26 08:18:12,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-09-26 08:18:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2018-09-26 08:18:12,315 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 236 [2018-09-26 08:18:12,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:12,315 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2018-09-26 08:18:12,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:18:12,316 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2018-09-26 08:18:12,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-09-26 08:18:12,316 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:12,317 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1, 1, 1] [2018-09-26 08:18:12,317 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:12,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:12,317 INFO L82 PathProgramCache]: Analyzing trace with hash 47353875, now seen corresponding path program 115 times [2018-09-26 08:18:12,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:13,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 6844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:13,046 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:13,046 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-09-26 08:18:13,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-26 08:18:13,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-26 08:18:13,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:18:13,048 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 120 states. [2018-09-26 08:18:15,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:15,713 INFO L93 Difference]: Finished difference Result 361 states and 363 transitions. [2018-09-26 08:18:15,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-09-26 08:18:15,713 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 238 [2018-09-26 08:18:15,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:15,714 INFO L225 Difference]: With dead ends: 361 [2018-09-26 08:18:15,714 INFO L226 Difference]: Without dead ends: 241 [2018-09-26 08:18:15,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1774 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=600, Invalid=31980, Unknown=0, NotChecked=0, Total=32580 [2018-09-26 08:18:15,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-09-26 08:18:16,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-09-26 08:18:16,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-26 08:18:16,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2018-09-26 08:18:16,017 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 238 [2018-09-26 08:18:16,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:16,018 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2018-09-26 08:18:16,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-26 08:18:16,018 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2018-09-26 08:18:16,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-26 08:18:16,019 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:16,019 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 59, 58, 1, 1, 1, 1] [2018-09-26 08:18:16,019 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:16,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:16,019 INFO L82 PathProgramCache]: Analyzing trace with hash -276935347, now seen corresponding path program 116 times [2018-09-26 08:18:16,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:16,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6962 backedges. 3422 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:16,218 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:16,219 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:18:16,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:18:16,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:18:16,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=2012, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:18:16,220 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 63 states. [2018-09-26 08:18:16,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:16,655 INFO L93 Difference]: Finished difference Result 245 states and 246 transitions. [2018-09-26 08:18:16,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-09-26 08:18:16,655 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 240 [2018-09-26 08:18:16,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:16,656 INFO L225 Difference]: With dead ends: 245 [2018-09-26 08:18:16,656 INFO L226 Difference]: Without dead ends: 243 [2018-09-26 08:18:16,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3480 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:18:16,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-09-26 08:18:16,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-09-26 08:18:16,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-09-26 08:18:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 244 transitions. [2018-09-26 08:18:16,929 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 244 transitions. Word has length 240 [2018-09-26 08:18:16,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:16,930 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 244 transitions. [2018-09-26 08:18:16,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:18:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 244 transitions. [2018-09-26 08:18:16,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-09-26 08:18:16,930 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:16,931 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1, 1, 1] [2018-09-26 08:18:16,931 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:16,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:16,931 INFO L82 PathProgramCache]: Analyzing trace with hash 153156231, now seen corresponding path program 117 times [2018-09-26 08:18:16,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 7080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:17,701 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:17,701 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-09-26 08:18:17,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-26 08:18:17,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-26 08:18:17,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:18:17,703 INFO L87 Difference]: Start difference. First operand 243 states and 244 transitions. Second operand 122 states. [2018-09-26 08:18:20,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:20,549 INFO L93 Difference]: Finished difference Result 367 states and 369 transitions. [2018-09-26 08:18:20,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-09-26 08:18:20,549 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 242 [2018-09-26 08:18:20,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:20,549 INFO L225 Difference]: With dead ends: 367 [2018-09-26 08:18:20,550 INFO L226 Difference]: Without dead ends: 245 [2018-09-26 08:18:20,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1834 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=610, Invalid=33062, Unknown=0, NotChecked=0, Total=33672 [2018-09-26 08:18:20,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-09-26 08:18:20,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-09-26 08:18:20,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-26 08:18:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 246 transitions. [2018-09-26 08:18:20,865 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 246 transitions. Word has length 242 [2018-09-26 08:18:20,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:20,865 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 246 transitions. [2018-09-26 08:18:20,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-26 08:18:20,866 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 246 transitions. [2018-09-26 08:18:20,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-26 08:18:20,866 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:20,866 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 60, 59, 1, 1, 1, 1] [2018-09-26 08:18:20,867 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:20,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:20,867 INFO L82 PathProgramCache]: Analyzing trace with hash 316115649, now seen corresponding path program 118 times [2018-09-26 08:18:20,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:21,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7200 backedges. 3540 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:21,100 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:21,100 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:18:21,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:18:21,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:18:21,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:18:21,101 INFO L87 Difference]: Start difference. First operand 245 states and 246 transitions. Second operand 64 states. [2018-09-26 08:18:21,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:21,623 INFO L93 Difference]: Finished difference Result 249 states and 250 transitions. [2018-09-26 08:18:21,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-09-26 08:18:21,624 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 244 [2018-09-26 08:18:21,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:21,624 INFO L225 Difference]: With dead ends: 249 [2018-09-26 08:18:21,624 INFO L226 Difference]: Without dead ends: 247 [2018-09-26 08:18:21,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3599 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:18:21,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-09-26 08:18:21,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-09-26 08:18:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-09-26 08:18:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2018-09-26 08:18:21,947 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 244 [2018-09-26 08:18:21,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:21,947 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2018-09-26 08:18:21,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:18:21,947 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2018-09-26 08:18:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-09-26 08:18:21,948 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:21,948 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1, 1, 1] [2018-09-26 08:18:21,948 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:21,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:21,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1155486981, now seen corresponding path program 119 times [2018-09-26 08:18:21,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:22,845 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 7320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:22,846 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:22,846 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-09-26 08:18:22,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-26 08:18:22,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-26 08:18:22,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:18:22,847 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 124 states. [2018-09-26 08:18:25,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:25,808 INFO L93 Difference]: Finished difference Result 373 states and 375 transitions. [2018-09-26 08:18:25,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-09-26 08:18:25,808 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 246 [2018-09-26 08:18:25,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:25,809 INFO L225 Difference]: With dead ends: 373 [2018-09-26 08:18:25,809 INFO L226 Difference]: Without dead ends: 249 [2018-09-26 08:18:25,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1895 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=620, Invalid=34162, Unknown=0, NotChecked=0, Total=34782 [2018-09-26 08:18:25,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-09-26 08:18:26,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-09-26 08:18:26,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-09-26 08:18:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2018-09-26 08:18:26,117 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 246 [2018-09-26 08:18:26,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:26,117 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2018-09-26 08:18:26,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-26 08:18:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2018-09-26 08:18:26,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-09-26 08:18:26,118 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:26,118 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 61, 60, 1, 1, 1, 1] [2018-09-26 08:18:26,118 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:26,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:26,118 INFO L82 PathProgramCache]: Analyzing trace with hash -364868043, now seen corresponding path program 120 times [2018-09-26 08:18:26,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:26,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7442 backedges. 3660 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:26,329 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:26,329 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:18:26,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:18:26,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:18:26,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=2141, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:18:26,330 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 65 states. [2018-09-26 08:18:26,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:26,788 INFO L93 Difference]: Finished difference Result 253 states and 254 transitions. [2018-09-26 08:18:26,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-09-26 08:18:26,789 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 248 [2018-09-26 08:18:26,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:26,789 INFO L225 Difference]: With dead ends: 253 [2018-09-26 08:18:26,789 INFO L226 Difference]: Without dead ends: 251 [2018-09-26 08:18:26,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3720 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:18:26,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-09-26 08:18:27,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-09-26 08:18:27,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-26 08:18:27,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 252 transitions. [2018-09-26 08:18:27,083 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 252 transitions. Word has length 248 [2018-09-26 08:18:27,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:27,083 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 252 transitions. [2018-09-26 08:18:27,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:18:27,083 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 252 transitions. [2018-09-26 08:18:27,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-26 08:18:27,084 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:27,084 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1, 1, 1] [2018-09-26 08:18:27,084 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:27,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:27,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1549181295, now seen corresponding path program 121 times [2018-09-26 08:18:27,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:27,929 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 7564 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:27,930 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:27,930 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-09-26 08:18:27,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-26 08:18:27,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-26 08:18:27,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:18:27,932 INFO L87 Difference]: Start difference. First operand 251 states and 252 transitions. Second operand 126 states. [2018-09-26 08:18:30,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:30,980 INFO L93 Difference]: Finished difference Result 379 states and 381 transitions. [2018-09-26 08:18:30,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-09-26 08:18:30,980 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 250 [2018-09-26 08:18:30,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:30,981 INFO L225 Difference]: With dead ends: 379 [2018-09-26 08:18:30,981 INFO L226 Difference]: Without dead ends: 253 [2018-09-26 08:18:30,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1957 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=630, Invalid=35280, Unknown=0, NotChecked=0, Total=35910 [2018-09-26 08:18:30,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-09-26 08:18:31,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-09-26 08:18:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-09-26 08:18:31,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 254 transitions. [2018-09-26 08:18:31,290 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 254 transitions. Word has length 250 [2018-09-26 08:18:31,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:31,291 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 254 transitions. [2018-09-26 08:18:31,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-26 08:18:31,291 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 254 transitions. [2018-09-26 08:18:31,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-09-26 08:18:31,292 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:31,292 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 62, 61, 1, 1, 1, 1] [2018-09-26 08:18:31,292 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:31,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:31,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1711167401, now seen corresponding path program 122 times [2018-09-26 08:18:31,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:31,490 INFO L134 CoverageAnalysis]: Checked inductivity of 7688 backedges. 3782 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:31,490 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:31,490 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:18:31,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:18:31,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:18:31,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:18:31,491 INFO L87 Difference]: Start difference. First operand 253 states and 254 transitions. Second operand 66 states. [2018-09-26 08:18:31,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:31,987 INFO L93 Difference]: Finished difference Result 257 states and 258 transitions. [2018-09-26 08:18:31,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-09-26 08:18:31,988 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 252 [2018-09-26 08:18:31,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:31,989 INFO L225 Difference]: With dead ends: 257 [2018-09-26 08:18:31,989 INFO L226 Difference]: Without dead ends: 255 [2018-09-26 08:18:31,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3843 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:18:31,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-09-26 08:18:32,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-09-26 08:18:32,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-09-26 08:18:32,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2018-09-26 08:18:32,311 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 252 [2018-09-26 08:18:32,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:32,312 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2018-09-26 08:18:32,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:18:32,312 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2018-09-26 08:18:32,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-09-26 08:18:32,313 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:32,313 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1, 1, 1] [2018-09-26 08:18:32,313 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:32,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:32,313 INFO L82 PathProgramCache]: Analyzing trace with hash -540549661, now seen corresponding path program 123 times [2018-09-26 08:18:32,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:33,127 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:33,128 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:33,128 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-09-26 08:18:33,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-26 08:18:33,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-26 08:18:33,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:18:33,130 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 128 states. [2018-09-26 08:18:36,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:36,263 INFO L93 Difference]: Finished difference Result 385 states and 387 transitions. [2018-09-26 08:18:36,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-09-26 08:18:36,263 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 254 [2018-09-26 08:18:36,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:36,264 INFO L225 Difference]: With dead ends: 385 [2018-09-26 08:18:36,264 INFO L226 Difference]: Without dead ends: 257 [2018-09-26 08:18:36,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2020 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=640, Invalid=36416, Unknown=0, NotChecked=0, Total=37056 [2018-09-26 08:18:36,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-09-26 08:18:36,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-09-26 08:18:36,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-26 08:18:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 258 transitions. [2018-09-26 08:18:36,609 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 258 transitions. Word has length 254 [2018-09-26 08:18:36,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:36,609 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 258 transitions. [2018-09-26 08:18:36,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-26 08:18:36,609 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 258 transitions. [2018-09-26 08:18:36,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-26 08:18:36,610 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:36,610 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 63, 62, 1, 1, 1, 1] [2018-09-26 08:18:36,611 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:36,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:36,611 INFO L82 PathProgramCache]: Analyzing trace with hash -975837411, now seen corresponding path program 124 times [2018-09-26 08:18:36,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:36,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7938 backedges. 3906 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:36,913 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:36,913 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:18:36,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:18:36,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:18:36,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2148, Invalid=2274, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:18:36,915 INFO L87 Difference]: Start difference. First operand 257 states and 258 transitions. Second operand 67 states. [2018-09-26 08:18:37,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:37,517 INFO L93 Difference]: Finished difference Result 261 states and 262 transitions. [2018-09-26 08:18:37,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-09-26 08:18:37,517 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 256 [2018-09-26 08:18:37,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:37,518 INFO L225 Difference]: With dead ends: 261 [2018-09-26 08:18:37,518 INFO L226 Difference]: Without dead ends: 259 [2018-09-26 08:18:37,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3968 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:18:37,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-09-26 08:18:37,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-09-26 08:18:37,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-09-26 08:18:37,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-09-26 08:18:37,864 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 256 [2018-09-26 08:18:37,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:37,864 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-09-26 08:18:37,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:18:37,865 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-09-26 08:18:37,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-09-26 08:18:37,865 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:37,865 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1, 1, 1] [2018-09-26 08:18:37,865 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:37,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:37,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1476829097, now seen corresponding path program 125 times [2018-09-26 08:18:37,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 8064 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:38,700 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:38,700 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-09-26 08:18:38,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-26 08:18:38,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-26 08:18:38,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:18:38,702 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 130 states. [2018-09-26 08:18:41,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:41,882 INFO L93 Difference]: Finished difference Result 391 states and 393 transitions. [2018-09-26 08:18:41,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-09-26 08:18:41,882 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 258 [2018-09-26 08:18:41,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:41,883 INFO L225 Difference]: With dead ends: 391 [2018-09-26 08:18:41,883 INFO L226 Difference]: Without dead ends: 261 [2018-09-26 08:18:41,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2084 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=650, Invalid=37570, Unknown=0, NotChecked=0, Total=38220 [2018-09-26 08:18:41,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-09-26 08:18:42,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-09-26 08:18:42,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-09-26 08:18:42,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 262 transitions. [2018-09-26 08:18:42,198 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 262 transitions. Word has length 258 [2018-09-26 08:18:42,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:42,198 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 262 transitions. [2018-09-26 08:18:42,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-26 08:18:42,198 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 262 transitions. [2018-09-26 08:18:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-26 08:18:42,199 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:42,199 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 64, 63, 1, 1, 1, 1] [2018-09-26 08:18:42,200 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:42,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:42,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1493974161, now seen corresponding path program 126 times [2018-09-26 08:18:42,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 8192 backedges. 4032 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:42,417 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:42,418 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:18:42,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:18:42,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:18:42,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=2342, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:18:42,419 INFO L87 Difference]: Start difference. First operand 261 states and 262 transitions. Second operand 68 states. [2018-09-26 08:18:42,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:42,926 INFO L93 Difference]: Finished difference Result 265 states and 266 transitions. [2018-09-26 08:18:42,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-09-26 08:18:42,926 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 260 [2018-09-26 08:18:42,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:42,927 INFO L225 Difference]: With dead ends: 265 [2018-09-26 08:18:42,927 INFO L226 Difference]: Without dead ends: 263 [2018-09-26 08:18:42,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4095 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:18:42,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-09-26 08:18:43,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-09-26 08:18:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-09-26 08:18:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 264 transitions. [2018-09-26 08:18:43,271 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 264 transitions. Word has length 260 [2018-09-26 08:18:43,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:43,271 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 264 transitions. [2018-09-26 08:18:43,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:18:43,272 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 264 transitions. [2018-09-26 08:18:43,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-09-26 08:18:43,272 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:43,272 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1, 1, 1] [2018-09-26 08:18:43,273 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:43,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:43,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1190144203, now seen corresponding path program 127 times [2018-09-26 08:18:43,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 8320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:44,190 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:44,190 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-09-26 08:18:44,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-26 08:18:44,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-26 08:18:44,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:18:44,192 INFO L87 Difference]: Start difference. First operand 263 states and 264 transitions. Second operand 132 states. [2018-09-26 08:18:47,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:47,303 INFO L93 Difference]: Finished difference Result 397 states and 399 transitions. [2018-09-26 08:18:47,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-09-26 08:18:47,303 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 262 [2018-09-26 08:18:47,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:47,304 INFO L225 Difference]: With dead ends: 397 [2018-09-26 08:18:47,304 INFO L226 Difference]: Without dead ends: 265 [2018-09-26 08:18:47,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2149 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=660, Invalid=38742, Unknown=0, NotChecked=0, Total=39402 [2018-09-26 08:18:47,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-09-26 08:18:47,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-09-26 08:18:47,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-09-26 08:18:47,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2018-09-26 08:18:47,636 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 262 [2018-09-26 08:18:47,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:47,636 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2018-09-26 08:18:47,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-26 08:18:47,636 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2018-09-26 08:18:47,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-26 08:18:47,637 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:47,637 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 65, 64, 1, 1, 1, 1] [2018-09-26 08:18:47,638 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:47,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:47,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1046894597, now seen corresponding path program 128 times [2018-09-26 08:18:47,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:47,874 INFO L134 CoverageAnalysis]: Checked inductivity of 8450 backedges. 4160 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:47,874 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:47,874 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:18:47,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:18:47,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:18:47,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2281, Invalid=2411, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:18:47,875 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 69 states. [2018-09-26 08:18:48,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:48,397 INFO L93 Difference]: Finished difference Result 269 states and 270 transitions. [2018-09-26 08:18:48,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-09-26 08:18:48,397 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 264 [2018-09-26 08:18:48,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:48,398 INFO L225 Difference]: With dead ends: 269 [2018-09-26 08:18:48,398 INFO L226 Difference]: Without dead ends: 267 [2018-09-26 08:18:48,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:18:48,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-09-26 08:18:48,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-09-26 08:18:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-09-26 08:18:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 268 transitions. [2018-09-26 08:18:48,783 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 268 transitions. Word has length 264 [2018-09-26 08:18:48,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:48,783 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 268 transitions. [2018-09-26 08:18:48,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:18:48,783 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 268 transitions. [2018-09-26 08:18:48,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-09-26 08:18:48,784 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:48,784 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1, 1, 1] [2018-09-26 08:18:48,784 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:48,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:48,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1043412799, now seen corresponding path program 129 times [2018-09-26 08:18:48,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:49,682 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 8580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:49,683 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:49,683 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-09-26 08:18:49,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-26 08:18:49,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-26 08:18:49,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:18:49,685 INFO L87 Difference]: Start difference. First operand 267 states and 268 transitions. Second operand 134 states. [2018-09-26 08:18:52,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:52,957 INFO L93 Difference]: Finished difference Result 403 states and 405 transitions. [2018-09-26 08:18:52,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-09-26 08:18:52,957 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 266 [2018-09-26 08:18:52,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:52,958 INFO L225 Difference]: With dead ends: 403 [2018-09-26 08:18:52,958 INFO L226 Difference]: Without dead ends: 269 [2018-09-26 08:18:52,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2215 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=670, Invalid=39932, Unknown=0, NotChecked=0, Total=40602 [2018-09-26 08:18:52,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-09-26 08:18:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-09-26 08:18:53,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-09-26 08:18:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 270 transitions. [2018-09-26 08:18:53,293 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 270 transitions. Word has length 266 [2018-09-26 08:18:53,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:53,293 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 270 transitions. [2018-09-26 08:18:53,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-26 08:18:53,293 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 270 transitions. [2018-09-26 08:18:53,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-26 08:18:53,294 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:53,294 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 66, 65, 1, 1, 1, 1] [2018-09-26 08:18:53,294 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:53,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:53,294 INFO L82 PathProgramCache]: Analyzing trace with hash 606681465, now seen corresponding path program 130 times [2018-09-26 08:18:53,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:53,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8712 backedges. 4290 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:53,513 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:53,514 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:18:53,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:18:53,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:18:53,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2349, Invalid=2481, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:18:53,515 INFO L87 Difference]: Start difference. First operand 269 states and 270 transitions. Second operand 70 states. [2018-09-26 08:18:54,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:54,103 INFO L93 Difference]: Finished difference Result 273 states and 274 transitions. [2018-09-26 08:18:54,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-09-26 08:18:54,103 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 268 [2018-09-26 08:18:54,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:54,104 INFO L225 Difference]: With dead ends: 273 [2018-09-26 08:18:54,104 INFO L226 Difference]: Without dead ends: 271 [2018-09-26 08:18:54,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4355 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:18:54,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-09-26 08:18:54,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-09-26 08:18:54,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-09-26 08:18:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2018-09-26 08:18:54,473 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 268 [2018-09-26 08:18:54,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:54,473 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2018-09-26 08:18:54,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:18:54,473 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2018-09-26 08:18:54,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-09-26 08:18:54,474 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:54,474 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1, 1, 1] [2018-09-26 08:18:54,474 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:54,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:54,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1094612045, now seen corresponding path program 131 times [2018-09-26 08:18:54,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:55,383 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 8844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:55,383 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:55,384 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-09-26 08:18:55,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-26 08:18:55,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-26 08:18:55,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:18:55,385 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 136 states. [2018-09-26 08:18:58,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:58,894 INFO L93 Difference]: Finished difference Result 409 states and 411 transitions. [2018-09-26 08:18:58,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-09-26 08:18:58,895 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 270 [2018-09-26 08:18:58,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:58,895 INFO L225 Difference]: With dead ends: 409 [2018-09-26 08:18:58,895 INFO L226 Difference]: Without dead ends: 273 [2018-09-26 08:18:58,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2282 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=680, Invalid=41140, Unknown=0, NotChecked=0, Total=41820 [2018-09-26 08:18:58,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-09-26 08:18:59,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-09-26 08:18:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-09-26 08:18:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 274 transitions. [2018-09-26 08:18:59,249 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 274 transitions. Word has length 270 [2018-09-26 08:18:59,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:59,249 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 274 transitions. [2018-09-26 08:18:59,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-26 08:18:59,249 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 274 transitions. [2018-09-26 08:18:59,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-09-26 08:18:59,250 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:59,250 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 67, 66, 1, 1, 1, 1] [2018-09-26 08:18:59,250 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:59,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:59,250 INFO L82 PathProgramCache]: Analyzing trace with hash 135913709, now seen corresponding path program 132 times [2018-09-26 08:18:59,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:59,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8978 backedges. 4422 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:18:59,557 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:59,557 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:18:59,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:18:59,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:18:59,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2418, Invalid=2552, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:18:59,558 INFO L87 Difference]: Start difference. First operand 273 states and 274 transitions. Second operand 71 states. [2018-09-26 08:19:00,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:00,151 INFO L93 Difference]: Finished difference Result 277 states and 278 transitions. [2018-09-26 08:19:00,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-09-26 08:19:00,151 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 272 [2018-09-26 08:19:00,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:00,151 INFO L225 Difference]: With dead ends: 277 [2018-09-26 08:19:00,152 INFO L226 Difference]: Without dead ends: 275 [2018-09-26 08:19:00,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4488 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:19:00,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-09-26 08:19:00,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-09-26 08:19:00,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-09-26 08:19:00,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 276 transitions. [2018-09-26 08:19:00,511 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 276 transitions. Word has length 272 [2018-09-26 08:19:00,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:00,512 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 276 transitions. [2018-09-26 08:19:00,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:19:00,512 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 276 transitions. [2018-09-26 08:19:00,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-09-26 08:19:00,513 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:00,513 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1, 1, 1] [2018-09-26 08:19:00,513 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:00,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:00,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1764107815, now seen corresponding path program 133 times [2018-09-26 08:19:00,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 9112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:01,520 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:01,520 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-09-26 08:19:01,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-26 08:19:01,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-26 08:19:01,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:19:01,522 INFO L87 Difference]: Start difference. First operand 275 states and 276 transitions. Second operand 138 states. [2018-09-26 08:19:05,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:05,271 INFO L93 Difference]: Finished difference Result 415 states and 417 transitions. [2018-09-26 08:19:05,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-09-26 08:19:05,271 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 274 [2018-09-26 08:19:05,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:05,271 INFO L225 Difference]: With dead ends: 415 [2018-09-26 08:19:05,272 INFO L226 Difference]: Without dead ends: 277 [2018-09-26 08:19:05,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=690, Invalid=42366, Unknown=0, NotChecked=0, Total=43056 [2018-09-26 08:19:05,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-09-26 08:19:05,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-09-26 08:19:05,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-09-26 08:19:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 278 transitions. [2018-09-26 08:19:05,681 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 278 transitions. Word has length 274 [2018-09-26 08:19:05,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:05,682 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 278 transitions. [2018-09-26 08:19:05,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-09-26 08:19:05,682 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 278 transitions. [2018-09-26 08:19:05,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-26 08:19:05,682 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:05,683 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 68, 67, 1, 1, 1, 1] [2018-09-26 08:19:05,683 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:05,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:05,683 INFO L82 PathProgramCache]: Analyzing trace with hash -142782879, now seen corresponding path program 134 times [2018-09-26 08:19:05,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:05,990 INFO L134 CoverageAnalysis]: Checked inductivity of 9248 backedges. 4556 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:05,990 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:05,990 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:19:05,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:19:05,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:19:05,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2488, Invalid=2624, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:19:05,991 INFO L87 Difference]: Start difference. First operand 277 states and 278 transitions. Second operand 72 states. [2018-09-26 08:19:06,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:06,663 INFO L93 Difference]: Finished difference Result 281 states and 282 transitions. [2018-09-26 08:19:06,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-09-26 08:19:06,663 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 276 [2018-09-26 08:19:06,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:06,664 INFO L225 Difference]: With dead ends: 281 [2018-09-26 08:19:06,664 INFO L226 Difference]: Without dead ends: 279 [2018-09-26 08:19:06,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4623 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:19:06,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-09-26 08:19:07,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-09-26 08:19:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-09-26 08:19:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2018-09-26 08:19:07,034 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 276 [2018-09-26 08:19:07,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:07,034 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2018-09-26 08:19:07,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:19:07,034 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2018-09-26 08:19:07,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-09-26 08:19:07,035 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:07,035 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1, 1, 1] [2018-09-26 08:19:07,035 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:07,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:07,035 INFO L82 PathProgramCache]: Analyzing trace with hash 224659099, now seen corresponding path program 135 times [2018-09-26 08:19:07,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 9384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:08,473 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:08,473 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-09-26 08:19:08,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-09-26 08:19:08,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-09-26 08:19:08,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:19:08,475 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 140 states. [2018-09-26 08:19:12,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:12,316 INFO L93 Difference]: Finished difference Result 421 states and 423 transitions. [2018-09-26 08:19:12,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-09-26 08:19:12,317 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 278 [2018-09-26 08:19:12,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:12,317 INFO L225 Difference]: With dead ends: 421 [2018-09-26 08:19:12,317 INFO L226 Difference]: Without dead ends: 281 [2018-09-26 08:19:12,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2419 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=700, Invalid=43610, Unknown=0, NotChecked=0, Total=44310 [2018-09-26 08:19:12,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-09-26 08:19:12,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-09-26 08:19:12,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-26 08:19:12,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 282 transitions. [2018-09-26 08:19:12,695 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 282 transitions. Word has length 278 [2018-09-26 08:19:12,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:12,695 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 282 transitions. [2018-09-26 08:19:12,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-09-26 08:19:12,695 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 282 transitions. [2018-09-26 08:19:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-26 08:19:12,696 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:12,696 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 69, 68, 1, 1, 1, 1] [2018-09-26 08:19:12,696 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:12,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:12,696 INFO L82 PathProgramCache]: Analyzing trace with hash -820477483, now seen corresponding path program 136 times [2018-09-26 08:19:12,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 9522 backedges. 4692 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:12,941 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:12,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:19:12,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:19:12,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:19:12,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2559, Invalid=2697, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:19:12,943 INFO L87 Difference]: Start difference. First operand 281 states and 282 transitions. Second operand 73 states. [2018-09-26 08:19:13,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:13,552 INFO L93 Difference]: Finished difference Result 285 states and 286 transitions. [2018-09-26 08:19:13,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-09-26 08:19:13,553 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 280 [2018-09-26 08:19:13,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:13,553 INFO L225 Difference]: With dead ends: 285 [2018-09-26 08:19:13,553 INFO L226 Difference]: Without dead ends: 283 [2018-09-26 08:19:13,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4760 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:19:13,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-09-26 08:19:13,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-09-26 08:19:13,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-09-26 08:19:13,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 284 transitions. [2018-09-26 08:19:13,932 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 284 transitions. Word has length 280 [2018-09-26 08:19:13,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:13,933 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 284 transitions. [2018-09-26 08:19:13,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:19:13,933 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 284 transitions. [2018-09-26 08:19:13,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-09-26 08:19:13,933 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:13,934 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1, 1, 1] [2018-09-26 08:19:13,934 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:13,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:13,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1795173647, now seen corresponding path program 137 times [2018-09-26 08:19:13,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:15,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 9660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:15,027 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:15,027 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-09-26 08:19:15,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-09-26 08:19:15,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-09-26 08:19:15,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:19:15,028 INFO L87 Difference]: Start difference. First operand 283 states and 284 transitions. Second operand 142 states. [2018-09-26 08:19:18,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:18,651 INFO L93 Difference]: Finished difference Result 427 states and 429 transitions. [2018-09-26 08:19:18,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-09-26 08:19:18,651 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 282 [2018-09-26 08:19:18,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:18,652 INFO L225 Difference]: With dead ends: 427 [2018-09-26 08:19:18,652 INFO L226 Difference]: Without dead ends: 285 [2018-09-26 08:19:18,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2489 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=710, Invalid=44872, Unknown=0, NotChecked=0, Total=45582 [2018-09-26 08:19:18,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-09-26 08:19:19,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-09-26 08:19:19,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-09-26 08:19:19,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 286 transitions. [2018-09-26 08:19:19,071 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 286 transitions. Word has length 282 [2018-09-26 08:19:19,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:19,071 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 286 transitions. [2018-09-26 08:19:19,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-09-26 08:19:19,071 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 286 transitions. [2018-09-26 08:19:19,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-09-26 08:19:19,072 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:19,072 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 70, 69, 1, 1, 1, 1] [2018-09-26 08:19:19,072 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:19,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:19,072 INFO L82 PathProgramCache]: Analyzing trace with hash -80708791, now seen corresponding path program 138 times [2018-09-26 08:19:19,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:19,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9800 backedges. 4830 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:19,353 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:19,353 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:19:19,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:19:19,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:19:19,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2631, Invalid=2771, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:19:19,354 INFO L87 Difference]: Start difference. First operand 285 states and 286 transitions. Second operand 74 states. [2018-09-26 08:19:19,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:19,984 INFO L93 Difference]: Finished difference Result 289 states and 290 transitions. [2018-09-26 08:19:19,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-09-26 08:19:19,984 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 284 [2018-09-26 08:19:19,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:19,985 INFO L225 Difference]: With dead ends: 289 [2018-09-26 08:19:19,985 INFO L226 Difference]: Without dead ends: 287 [2018-09-26 08:19:19,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4899 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:19:19,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-09-26 08:19:20,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-09-26 08:19:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-09-26 08:19:20,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2018-09-26 08:19:20,373 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 284 [2018-09-26 08:19:20,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:20,374 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2018-09-26 08:19:20,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:19:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2018-09-26 08:19:20,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-09-26 08:19:20,374 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:20,375 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1, 1, 1] [2018-09-26 08:19:20,375 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:20,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:20,375 INFO L82 PathProgramCache]: Analyzing trace with hash -251684477, now seen corresponding path program 139 times [2018-09-26 08:19:20,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:21,424 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 9940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:21,424 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:21,424 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-09-26 08:19:21,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-09-26 08:19:21,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-09-26 08:19:21,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:19:21,426 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 144 states. [2018-09-26 08:19:25,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:25,280 INFO L93 Difference]: Finished difference Result 433 states and 435 transitions. [2018-09-26 08:19:25,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-09-26 08:19:25,280 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 286 [2018-09-26 08:19:25,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:25,281 INFO L225 Difference]: With dead ends: 433 [2018-09-26 08:19:25,281 INFO L226 Difference]: Without dead ends: 289 [2018-09-26 08:19:25,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=720, Invalid=46152, Unknown=0, NotChecked=0, Total=46872 [2018-09-26 08:19:25,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-09-26 08:19:25,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-09-26 08:19:25,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-09-26 08:19:25,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2018-09-26 08:19:25,677 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 286 [2018-09-26 08:19:25,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:25,677 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2018-09-26 08:19:25,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-09-26 08:19:25,677 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2018-09-26 08:19:25,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-09-26 08:19:25,678 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:25,678 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 71, 70, 1, 1, 1, 1] [2018-09-26 08:19:25,678 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:25,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:25,678 INFO L82 PathProgramCache]: Analyzing trace with hash 931805885, now seen corresponding path program 140 times [2018-09-26 08:19:25,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:25,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10082 backedges. 4970 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:25,929 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:25,929 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:19:25,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:19:25,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:19:25,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2704, Invalid=2846, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:19:25,930 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand 75 states. [2018-09-26 08:19:26,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:26,584 INFO L93 Difference]: Finished difference Result 293 states and 294 transitions. [2018-09-26 08:19:26,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-09-26 08:19:26,585 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 288 [2018-09-26 08:19:26,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:26,585 INFO L225 Difference]: With dead ends: 293 [2018-09-26 08:19:26,585 INFO L226 Difference]: Without dead ends: 291 [2018-09-26 08:19:26,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5040 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:19:26,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-09-26 08:19:26,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-09-26 08:19:26,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-09-26 08:19:26,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 292 transitions. [2018-09-26 08:19:26,986 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 292 transitions. Word has length 288 [2018-09-26 08:19:26,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:26,986 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 292 transitions. [2018-09-26 08:19:26,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:19:26,986 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 292 transitions. [2018-09-26 08:19:26,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-09-26 08:19:26,987 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:26,987 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1, 1, 1] [2018-09-26 08:19:26,987 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:26,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:26,987 INFO L82 PathProgramCache]: Analyzing trace with hash 2112310263, now seen corresponding path program 141 times [2018-09-26 08:19:26,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:28,096 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 10224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:28,096 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:28,097 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-09-26 08:19:28,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-09-26 08:19:28,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-09-26 08:19:28,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:19:28,098 INFO L87 Difference]: Start difference. First operand 291 states and 292 transitions. Second operand 146 states. [2018-09-26 08:19:32,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:32,462 INFO L93 Difference]: Finished difference Result 439 states and 441 transitions. [2018-09-26 08:19:32,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-09-26 08:19:32,462 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 290 [2018-09-26 08:19:32,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:32,463 INFO L225 Difference]: With dead ends: 439 [2018-09-26 08:19:32,463 INFO L226 Difference]: Without dead ends: 293 [2018-09-26 08:19:32,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2632 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=730, Invalid=47450, Unknown=0, NotChecked=0, Total=48180 [2018-09-26 08:19:32,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-09-26 08:19:32,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-09-26 08:19:32,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-09-26 08:19:32,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 294 transitions. [2018-09-26 08:19:32,919 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 294 transitions. Word has length 290 [2018-09-26 08:19:32,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:32,919 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 294 transitions. [2018-09-26 08:19:32,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-09-26 08:19:32,919 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 294 transitions. [2018-09-26 08:19:32,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-26 08:19:32,920 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:32,920 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 72, 71, 1, 1, 1, 1] [2018-09-26 08:19:32,920 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:32,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:32,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1332396081, now seen corresponding path program 142 times [2018-09-26 08:19:32,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10368 backedges. 5112 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:33,209 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:33,209 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:19:33,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:19:33,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:19:33,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2778, Invalid=2922, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:19:33,210 INFO L87 Difference]: Start difference. First operand 293 states and 294 transitions. Second operand 76 states. [2018-09-26 08:19:33,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:33,953 INFO L93 Difference]: Finished difference Result 297 states and 298 transitions. [2018-09-26 08:19:33,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-09-26 08:19:33,953 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 292 [2018-09-26 08:19:33,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:33,954 INFO L225 Difference]: With dead ends: 297 [2018-09-26 08:19:33,954 INFO L226 Difference]: Without dead ends: 295 [2018-09-26 08:19:33,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:19:33,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-09-26 08:19:34,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-09-26 08:19:34,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-09-26 08:19:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2018-09-26 08:19:34,375 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 292 [2018-09-26 08:19:34,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:34,375 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2018-09-26 08:19:34,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:19:34,375 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2018-09-26 08:19:34,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-09-26 08:19:34,376 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:34,376 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1, 1, 1] [2018-09-26 08:19:34,376 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:34,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:34,377 INFO L82 PathProgramCache]: Analyzing trace with hash 532431979, now seen corresponding path program 143 times [2018-09-26 08:19:34,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:35,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 10512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:35,531 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:35,531 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-09-26 08:19:35,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-26 08:19:35,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-26 08:19:35,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:19:35,533 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 148 states. [2018-09-26 08:19:39,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:39,876 INFO L93 Difference]: Finished difference Result 445 states and 447 transitions. [2018-09-26 08:19:39,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-09-26 08:19:39,877 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 294 [2018-09-26 08:19:39,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:39,877 INFO L225 Difference]: With dead ends: 445 [2018-09-26 08:19:39,877 INFO L226 Difference]: Without dead ends: 297 [2018-09-26 08:19:39,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2705 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=740, Invalid=48766, Unknown=0, NotChecked=0, Total=49506 [2018-09-26 08:19:39,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-09-26 08:19:40,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2018-09-26 08:19:40,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-09-26 08:19:40,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2018-09-26 08:19:40,363 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 294 [2018-09-26 08:19:40,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:40,363 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2018-09-26 08:19:40,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-26 08:19:40,363 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2018-09-26 08:19:40,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-26 08:19:40,364 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:40,364 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 73, 72, 1, 1, 1, 1] [2018-09-26 08:19:40,364 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:40,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:40,364 INFO L82 PathProgramCache]: Analyzing trace with hash -577303643, now seen corresponding path program 144 times [2018-09-26 08:19:40,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:40,646 INFO L134 CoverageAnalysis]: Checked inductivity of 10658 backedges. 5256 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:40,646 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:40,646 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:19:40,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:19:40,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:19:40,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2853, Invalid=2999, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:19:40,647 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand 77 states. [2018-09-26 08:19:41,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:41,363 INFO L93 Difference]: Finished difference Result 301 states and 302 transitions. [2018-09-26 08:19:41,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-09-26 08:19:41,363 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 296 [2018-09-26 08:19:41,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:41,364 INFO L225 Difference]: With dead ends: 301 [2018-09-26 08:19:41,364 INFO L226 Difference]: Without dead ends: 299 [2018-09-26 08:19:41,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5328 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:19:41,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-09-26 08:19:41,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-09-26 08:19:41,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-09-26 08:19:41,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 300 transitions. [2018-09-26 08:19:41,788 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 300 transitions. Word has length 296 [2018-09-26 08:19:41,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:41,789 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 300 transitions. [2018-09-26 08:19:41,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:19:41,789 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 300 transitions. [2018-09-26 08:19:41,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-09-26 08:19:41,789 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:41,790 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1, 1, 1] [2018-09-26 08:19:41,790 INFO L423 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:41,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:41,790 INFO L82 PathProgramCache]: Analyzing trace with hash -737967393, now seen corresponding path program 145 times [2018-09-26 08:19:41,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:42,941 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 10804 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:42,941 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:42,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-09-26 08:19:42,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-09-26 08:19:42,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-09-26 08:19:42,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:19:42,943 INFO L87 Difference]: Start difference. First operand 299 states and 300 transitions. Second operand 150 states. [2018-09-26 08:19:47,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:47,298 INFO L93 Difference]: Finished difference Result 451 states and 453 transitions. [2018-09-26 08:19:47,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-26 08:19:47,298 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 298 [2018-09-26 08:19:47,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:47,299 INFO L225 Difference]: With dead ends: 451 [2018-09-26 08:19:47,299 INFO L226 Difference]: Without dead ends: 301 [2018-09-26 08:19:47,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2779 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=750, Invalid=50100, Unknown=0, NotChecked=0, Total=50850 [2018-09-26 08:19:47,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-09-26 08:19:47,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-09-26 08:19:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-26 08:19:47,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 302 transitions. [2018-09-26 08:19:47,822 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 302 transitions. Word has length 298 [2018-09-26 08:19:47,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:47,822 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 302 transitions. [2018-09-26 08:19:47,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-09-26 08:19:47,822 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 302 transitions. [2018-09-26 08:19:47,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-26 08:19:47,823 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:47,823 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 74, 73, 1, 1, 1, 1] [2018-09-26 08:19:47,823 INFO L423 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:47,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:47,824 INFO L82 PathProgramCache]: Analyzing trace with hash 206839065, now seen corresponding path program 146 times [2018-09-26 08:19:47,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:48,137 INFO L134 CoverageAnalysis]: Checked inductivity of 10952 backedges. 5402 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:48,137 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:48,138 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:19:48,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:19:48,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:19:48,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=3077, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:19:48,139 INFO L87 Difference]: Start difference. First operand 301 states and 302 transitions. Second operand 78 states. [2018-09-26 08:19:48,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:48,986 INFO L93 Difference]: Finished difference Result 305 states and 306 transitions. [2018-09-26 08:19:48,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-26 08:19:48,986 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 300 [2018-09-26 08:19:48,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:48,987 INFO L225 Difference]: With dead ends: 305 [2018-09-26 08:19:48,987 INFO L226 Difference]: Without dead ends: 303 [2018-09-26 08:19:48,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5475 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:19:48,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-09-26 08:19:49,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-09-26 08:19:49,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-09-26 08:19:49,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2018-09-26 08:19:49,473 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 300 [2018-09-26 08:19:49,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:49,473 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2018-09-26 08:19:49,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:19:49,474 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2018-09-26 08:19:49,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-09-26 08:19:49,474 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:49,474 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1, 1, 1] [2018-09-26 08:19:49,475 INFO L423 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:49,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:49,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1203898195, now seen corresponding path program 147 times [2018-09-26 08:19:49,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:50,777 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 11100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:50,777 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:50,778 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-09-26 08:19:50,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-09-26 08:19:50,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-09-26 08:19:50,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:19:50,780 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 152 states. [2018-09-26 08:19:55,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:55,102 INFO L93 Difference]: Finished difference Result 457 states and 459 transitions. [2018-09-26 08:19:55,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-09-26 08:19:55,102 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 302 [2018-09-26 08:19:55,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:55,102 INFO L225 Difference]: With dead ends: 457 [2018-09-26 08:19:55,103 INFO L226 Difference]: Without dead ends: 305 [2018-09-26 08:19:55,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2854 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=760, Invalid=51452, Unknown=0, NotChecked=0, Total=52212 [2018-09-26 08:19:55,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-09-26 08:19:55,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-09-26 08:19:55,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-09-26 08:19:55,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 306 transitions. [2018-09-26 08:19:55,558 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 306 transitions. Word has length 302 [2018-09-26 08:19:55,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:55,558 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 306 transitions. [2018-09-26 08:19:55,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-09-26 08:19:55,558 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 306 transitions. [2018-09-26 08:19:55,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-09-26 08:19:55,559 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:55,559 INFO L375 BasicCegarLoop]: trace histogram [76, 75, 75, 74, 1, 1, 1, 1] [2018-09-26 08:19:55,559 INFO L423 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:55,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:55,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1432810637, now seen corresponding path program 148 times [2018-09-26 08:19:55,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:55,881 INFO L134 CoverageAnalysis]: Checked inductivity of 11250 backedges. 5550 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:55,881 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:55,882 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:19:55,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:19:55,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:19:55,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3006, Invalid=3156, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:19:55,883 INFO L87 Difference]: Start difference. First operand 305 states and 306 transitions. Second operand 79 states. [2018-09-26 08:19:56,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:56,611 INFO L93 Difference]: Finished difference Result 309 states and 310 transitions. [2018-09-26 08:19:56,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-09-26 08:19:56,611 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 304 [2018-09-26 08:19:56,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:56,611 INFO L225 Difference]: With dead ends: 309 [2018-09-26 08:19:56,612 INFO L226 Difference]: Without dead ends: 307 [2018-09-26 08:19:56,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5624 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:19:56,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-09-26 08:19:57,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-09-26 08:19:57,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-09-26 08:19:57,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 308 transitions. [2018-09-26 08:19:57,122 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 308 transitions. Word has length 304 [2018-09-26 08:19:57,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:57,122 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 308 transitions. [2018-09-26 08:19:57,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:19:57,122 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 308 transitions. [2018-09-26 08:19:57,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-09-26 08:19:57,123 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:57,123 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1, 1, 1] [2018-09-26 08:19:57,123 INFO L423 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:57,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:57,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1753427513, now seen corresponding path program 149 times [2018-09-26 08:19:57,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:58,336 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 11400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:58,337 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:58,337 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-09-26 08:19:58,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-09-26 08:19:58,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-09-26 08:19:58,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=23257, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:19:58,339 INFO L87 Difference]: Start difference. First operand 307 states and 308 transitions. Second operand 154 states. [2018-09-26 08:20:02,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:02,963 INFO L93 Difference]: Finished difference Result 463 states and 465 transitions. [2018-09-26 08:20:02,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-09-26 08:20:02,963 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 306 [2018-09-26 08:20:02,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:02,964 INFO L225 Difference]: With dead ends: 463 [2018-09-26 08:20:02,964 INFO L226 Difference]: Without dead ends: 309 [2018-09-26 08:20:02,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2930 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=770, Invalid=52822, Unknown=0, NotChecked=0, Total=53592 [2018-09-26 08:20:02,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-09-26 08:20:03,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2018-09-26 08:20:03,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-09-26 08:20:03,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 310 transitions. [2018-09-26 08:20:03,475 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 310 transitions. Word has length 306 [2018-09-26 08:20:03,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:03,475 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 310 transitions. [2018-09-26 08:20:03,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-09-26 08:20:03,476 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 310 transitions. [2018-09-26 08:20:03,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-09-26 08:20:03,476 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:03,476 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 76, 75, 1, 1, 1, 1] [2018-09-26 08:20:03,477 INFO L423 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:03,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:03,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1108644353, now seen corresponding path program 150 times [2018-09-26 08:20:03,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 11552 backedges. 5700 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:03,832 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:03,832 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:20:03,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:20:03,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:20:03,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3084, Invalid=3236, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:20:03,834 INFO L87 Difference]: Start difference. First operand 309 states and 310 transitions. Second operand 80 states. [2018-09-26 08:20:04,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:04,658 INFO L93 Difference]: Finished difference Result 313 states and 314 transitions. [2018-09-26 08:20:04,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-09-26 08:20:04,659 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 308 [2018-09-26 08:20:04,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:04,660 INFO L225 Difference]: With dead ends: 313 [2018-09-26 08:20:04,660 INFO L226 Difference]: Without dead ends: 311 [2018-09-26 08:20:04,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5775 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9164, Invalid=15016, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:20:04,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-09-26 08:20:05,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2018-09-26 08:20:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-09-26 08:20:05,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 312 transitions. [2018-09-26 08:20:05,281 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 312 transitions. Word has length 308 [2018-09-26 08:20:05,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:05,281 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 312 transitions. [2018-09-26 08:20:05,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:20:05,282 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 312 transitions. [2018-09-26 08:20:05,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-09-26 08:20:05,282 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:05,282 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1, 1, 1] [2018-09-26 08:20:05,283 INFO L423 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:05,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:05,283 INFO L82 PathProgramCache]: Analyzing trace with hash 255386171, now seen corresponding path program 151 times [2018-09-26 08:20:05,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:06,629 INFO L134 CoverageAnalysis]: Checked inductivity of 11704 backedges. 0 proven. 11704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:06,630 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:06,630 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-09-26 08:20:06,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-09-26 08:20:06,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-09-26 08:20:06,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=23871, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:20:06,631 INFO L87 Difference]: Start difference. First operand 311 states and 312 transitions. Second operand 156 states. [2018-09-26 08:20:11,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:11,341 INFO L93 Difference]: Finished difference Result 469 states and 471 transitions. [2018-09-26 08:20:11,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-09-26 08:20:11,341 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 310 [2018-09-26 08:20:11,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:11,342 INFO L225 Difference]: With dead ends: 469 [2018-09-26 08:20:11,342 INFO L226 Difference]: Without dead ends: 313 [2018-09-26 08:20:11,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3007 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=780, Invalid=54210, Unknown=0, NotChecked=0, Total=54990 [2018-09-26 08:20:11,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-09-26 08:20:11,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-09-26 08:20:11,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-09-26 08:20:11,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 314 transitions. [2018-09-26 08:20:11,814 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 314 transitions. Word has length 310 [2018-09-26 08:20:11,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:11,814 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 314 transitions. [2018-09-26 08:20:11,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-09-26 08:20:11,814 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 314 transitions. [2018-09-26 08:20:11,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-09-26 08:20:11,815 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:11,815 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 77, 76, 1, 1, 1, 1] [2018-09-26 08:20:11,815 INFO L423 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:11,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:11,815 INFO L82 PathProgramCache]: Analyzing trace with hash 723645813, now seen corresponding path program 152 times [2018-09-26 08:20:11,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 11858 backedges. 5852 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:12,111 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:12,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:20:12,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:20:12,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:20:12,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3163, Invalid=3317, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:20:12,112 INFO L87 Difference]: Start difference. First operand 313 states and 314 transitions. Second operand 81 states. [2018-09-26 08:20:12,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:12,925 INFO L93 Difference]: Finished difference Result 317 states and 318 transitions. [2018-09-26 08:20:12,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-09-26 08:20:12,925 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 312 [2018-09-26 08:20:12,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:12,926 INFO L225 Difference]: With dead ends: 317 [2018-09-26 08:20:12,926 INFO L226 Difference]: Without dead ends: 315 [2018-09-26 08:20:12,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5928 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9400, Invalid=15406, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:20:12,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-09-26 08:20:13,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-09-26 08:20:13,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-09-26 08:20:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 316 transitions. [2018-09-26 08:20:13,451 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 316 transitions. Word has length 312 [2018-09-26 08:20:13,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:13,451 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 316 transitions. [2018-09-26 08:20:13,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:20:13,452 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 316 transitions. [2018-09-26 08:20:13,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-09-26 08:20:13,452 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:13,453 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1, 1, 1] [2018-09-26 08:20:13,453 INFO L423 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:13,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:13,453 INFO L82 PathProgramCache]: Analyzing trace with hash -361023313, now seen corresponding path program 153 times [2018-09-26 08:20:13,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-09-26 08:20:14,641 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:20:14,645 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:20:14,646 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:20:14 BoogieIcfgContainer [2018-09-26 08:20:14,646 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:20:14,647 INFO L168 Benchmark]: Toolchain (without parser) took 241173.91 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -157.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-09-26 08:20:14,649 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:20:14,649 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:20:14,650 INFO L168 Benchmark]: Boogie Preprocessor took 23.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:20:14,650 INFO L168 Benchmark]: RCFGBuilder took 269.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:20:14,651 INFO L168 Benchmark]: TraceAbstraction took 240831.35 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -167.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-09-26 08:20:14,653 INFO L336 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.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 269.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 240831.35 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -167.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 80). Cancelled while BasicCegarLoop was analyzing trace of length 315 with TraceHistMax 78, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 157 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. TIMEOUT Result, 240.7s OverallTime, 155 OverallIterations, 78 TraceHistogramMax, 159.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9472 SDtfs, 4223 SDslu, 625450 SDs, 0 SdLazy, 646860 SolverSat, 5963 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 45.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18396 GetRequests, 3080 SyntacticMatches, 0 SemanticMatches, 15316 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234441 ImplicationChecksByTransitivity, 83.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=315occurred in iteration=154, 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: 28.4s AutomataMinimizationTime, 154 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 41.3s InterpolantComputationTime, 24486 NumberOfCodeBlocks, 24486 NumberOfCodeBlocksAsserted, 154 NumberOfCheckSat, 24332 ConstructedInterpolants, 0 QuantifiedInterpolants, 23081150 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 154 InterpolantComputations, 1 PerfectInterpolantSequences, 152152/614614 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/invert_string.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-20-14-665.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/invert_string.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-20-14-665.csv Completed graceful shutdown