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/20170319-ConjunctivePathPrograms/overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:11:24,451 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:11:24,453 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:11:24,468 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:11:24,468 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:11:24,469 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:11:24,473 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:11:24,475 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:11:24,479 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:11:24,481 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:11:24,482 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:11:24,482 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:11:24,483 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:11:24,486 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:11:24,487 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:11:24,488 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:11:24,493 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:11:24,495 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:11:24,501 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:11:24,503 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:11:24,504 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:11:24,508 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:11:24,513 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:11:24,513 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:11:24,513 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:11:24,514 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:11:24,516 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:11:24,517 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:11:24,520 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:11:24,523 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:11:24,523 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:11:24,524 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:11:24,524 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:11:24,524 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:11:24,525 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:11:24,525 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:11:24,526 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:11:24,534 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:11:24,534 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:11:24,535 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:11:24,535 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:11:24,536 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:11:24,536 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:11:24,536 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:11:24,536 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:11:24,579 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:11:24,592 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:11:24,596 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:11:24,598 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:11:24,598 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:11:24,599 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl [2018-09-26 08:11:24,599 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl' [2018-09-26 08:11:24,648 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:11:24,651 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:11:24,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:11:24,652 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:11:24,652 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:11:24,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:11:24" (1/1) ... [2018-09-26 08:11:24,685 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:11:24" (1/1) ... [2018-09-26 08:11:24,692 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:11:24,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:11:24,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:11:24,693 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:11:24,704 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:11:24" (1/1) ... [2018-09-26 08:11:24,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:11:24" (1/1) ... [2018-09-26 08:11:24,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:11:24" (1/1) ... [2018-09-26 08:11:24,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:11:24" (1/1) ... [2018-09-26 08:11:24,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:11:24" (1/1) ... [2018-09-26 08:11:24,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:11:24" (1/1) ... [2018-09-26 08:11:24,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:11:24" (1/1) ... [2018-09-26 08:11:24,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:11:24,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:11:24,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:11:24,713 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:11:24,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:11:24" (1/1) ... [2018-09-26 08:11:24,794 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-09-26 08:11:24,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:11:24,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:11:24,928 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:11:24,928 INFO L202 PluginConnector]: Adding new model overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:11:24 BoogieIcfgContainer [2018-09-26 08:11:24,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:11:24,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:11:24,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:11:24,934 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:11:24,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:11:24" (1/2) ... [2018-09-26 08:11:24,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eeead51 and model type overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:11:24, skipping insertion in model container [2018-09-26 08:11:24,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:11:24" (2/2) ... [2018-09-26 08:11:24,938 INFO L112 eAbstractionObserver]: Analyzing ICFG overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl [2018-09-26 08:11:24,949 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:11:24,957 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:11:25,007 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:11:25,008 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:11:25,008 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:11:25,008 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:11:25,008 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:11:25,008 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:11:25,009 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:11:25,009 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:11:25,009 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:11:25,025 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-09-26 08:11:25,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-26 08:11:25,034 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:25,035 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-26 08:11:25,037 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:25,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:25,043 INFO L82 PathProgramCache]: Analyzing trace with hash 30017, now seen corresponding path program 1 times [2018-09-26 08:11:25,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:25,125 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:11:25,128 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:11:25,128 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:11:25,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:11:25,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:11:25,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:11:25,148 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-09-26 08:11:25,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:25,188 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2018-09-26 08:11:25,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:11:25,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-09-26 08:11:25,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:25,203 INFO L225 Difference]: With dead ends: 8 [2018-09-26 08:11:25,204 INFO L226 Difference]: Without dead ends: 5 [2018-09-26 08:11:25,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:11:25,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-09-26 08:11:25,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-09-26 08:11:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-09-26 08:11:25,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-26 08:11:25,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-09-26 08:11:25,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:25,252 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-09-26 08:11:25,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:11:25,253 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-26 08:11:25,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:11:25,253 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:25,254 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:11:25,254 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:25,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:25,255 INFO L82 PathProgramCache]: Analyzing trace with hash 928552, now seen corresponding path program 1 times [2018-09-26 08:11:25,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:25,294 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:25,294 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:11:25,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:11:25,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:11:25,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:11:25,298 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-09-26 08:11:25,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:25,316 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-09-26 08:11:25,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:11:25,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-09-26 08:11:25,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:25,318 INFO L225 Difference]: With dead ends: 8 [2018-09-26 08:11:25,318 INFO L226 Difference]: Without dead ends: 6 [2018-09-26 08:11:25,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:11:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-09-26 08:11:25,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-09-26 08:11:25,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-26 08:11:25,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-26 08:11:25,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-09-26 08:11:25,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:25,323 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-26 08:11:25,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:11:25,323 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-26 08:11:25,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:11:25,324 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:25,324 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-09-26 08:11:25,324 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:25,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:25,325 INFO L82 PathProgramCache]: Analyzing trace with hash 28783137, now seen corresponding path program 2 times [2018-09-26 08:11:25,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:25,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:25,365 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:25,365 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:11:25,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:11:25,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:11:25,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:11:25,366 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-09-26 08:11:25,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:25,384 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 08:11:25,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:11:25,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-26 08:11:25,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:25,385 INFO L225 Difference]: With dead ends: 9 [2018-09-26 08:11:25,387 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:11:25,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:11:25,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:11:25,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 08:11:25,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:11:25,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 08:11:25,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-09-26 08:11:25,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:25,393 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 08:11:25,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:11:25,393 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 08:11:25,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:11:25,394 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:25,394 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-09-26 08:11:25,394 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:25,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:25,396 INFO L82 PathProgramCache]: Analyzing trace with hash 892275272, now seen corresponding path program 3 times [2018-09-26 08:11:25,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:25,453 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:25,453 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:25,453 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:11:25,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:11:25,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:11:25,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:11:25,455 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-09-26 08:11:25,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:25,475 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-26 08:11:25,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:11:25,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-09-26 08:11:25,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:25,476 INFO L225 Difference]: With dead ends: 10 [2018-09-26 08:11:25,477 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:11:25,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:11:25,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:11:25,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 08:11:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:11:25,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-26 08:11:25,481 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-09-26 08:11:25,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:25,481 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-26 08:11:25,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:11:25,481 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-26 08:11:25,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:11:25,482 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:25,482 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-09-26 08:11:25,483 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:25,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:25,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727681, now seen corresponding path program 4 times [2018-09-26 08:11:25,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:25,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:25,549 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:25,549 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:11:25,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:11:25,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:11:25,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:11:25,550 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-09-26 08:11:25,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:25,568 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 08:11:25,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:11:25,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-09-26 08:11:25,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:25,569 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:11:25,569 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:11:25,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:11:25,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:11:25,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:11:25,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:11:25,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 08:11:25,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-09-26 08:11:25,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:25,574 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 08:11:25,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:11:25,574 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 08:11:25,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:11:25,575 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:25,575 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-09-26 08:11:25,575 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:25,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:25,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1516986008, now seen corresponding path program 5 times [2018-09-26 08:11:25,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:25,646 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:25,647 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:11:25,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:11:25,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:11:25,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:11:25,648 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-09-26 08:11:25,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:25,673 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-26 08:11:25,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:11:25,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:11:25,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:25,674 INFO L225 Difference]: With dead ends: 12 [2018-09-26 08:11:25,675 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 08:11:25,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:11:25,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 08:11:25,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-26 08:11:25,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-26 08:11:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-26 08:11:25,680 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-09-26 08:11:25,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:25,680 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-26 08:11:25,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:11:25,682 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-26 08:11:25,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:11:25,682 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:25,683 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-09-26 08:11:25,683 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:25,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:25,683 INFO L82 PathProgramCache]: Analyzing trace with hash 218072033, now seen corresponding path program 6 times [2018-09-26 08:11:25,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:25,774 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:25,774 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:11:25,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:11:25,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:11:25,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:11:25,775 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-09-26 08:11:25,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:25,792 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 08:11:25,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:11:25,792 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-26 08:11:25,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:25,793 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:11:25,793 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:11:25,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:11:25,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:11:25,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:11:25,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:11:25,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:11:25,798 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-09-26 08:11:25,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:25,798 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:11:25,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:11:25,798 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:11:25,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:11:25,799 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:25,799 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-09-26 08:11:25,799 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:25,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:25,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1829703544, now seen corresponding path program 7 times [2018-09-26 08:11:25,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:25,871 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:25,871 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:25,871 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:11:25,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:11:25,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:11:25,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:11:25,876 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-09-26 08:11:25,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:25,905 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-26 08:11:25,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:11:25,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-09-26 08:11:25,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:25,906 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:11:25,906 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:11:25,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:11:25,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:11:25,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-26 08:11:25,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 08:11:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-26 08:11:25,911 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-09-26 08:11:25,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:25,911 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-26 08:11:25,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:11:25,912 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-26 08:11:25,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:11:25,912 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:25,912 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-09-26 08:11:25,913 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:25,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:25,913 INFO L82 PathProgramCache]: Analyzing trace with hash -886236991, now seen corresponding path program 8 times [2018-09-26 08:11:25,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:25,967 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:25,968 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:11:25,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:11:25,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:11:25,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:11:25,973 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-09-26 08:11:26,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:26,010 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 08:11:26,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:11:26,012 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-09-26 08:11:26,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:26,013 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:11:26,014 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:11:26,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:11:26,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:11:26,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:11:26,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:11:26,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 08:11:26,022 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-09-26 08:11:26,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:26,023 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 08:11:26,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:11:26,023 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 08:11:26,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:11:26,026 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:26,026 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-09-26 08:11:26,026 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:26,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:26,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1703544920, now seen corresponding path program 9 times [2018-09-26 08:11:26,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:26,112 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:26,112 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:26,115 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:11:26,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:11:26,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:11:26,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:11:26,116 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-09-26 08:11:26,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:26,147 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-26 08:11:26,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:11:26,149 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-09-26 08:11:26,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:26,150 INFO L225 Difference]: With dead ends: 16 [2018-09-26 08:11:26,150 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 08:11:26,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:11:26,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 08:11:26,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-26 08:11:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:11:26,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-26 08:11:26,156 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-09-26 08:11:26,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:26,156 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-26 08:11:26,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:11:26,156 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-26 08:11:26,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:11:26,157 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:26,157 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-09-26 08:11:26,157 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:26,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:26,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1270286943, now seen corresponding path program 10 times [2018-09-26 08:11:26,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:26,201 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:26,202 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:26,202 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:11:26,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:11:26,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:11:26,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:11:26,203 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-09-26 08:11:26,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:26,217 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 08:11:26,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:11:26,218 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-09-26 08:11:26,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:26,218 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:11:26,219 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:11:26,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:11:26,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:11:26,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:11:26,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:11:26,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-26 08:11:26,224 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-09-26 08:11:26,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:26,224 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-26 08:11:26,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:11:26,225 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-26 08:11:26,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:11:26,226 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:26,228 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-09-26 08:11:26,228 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:26,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:26,229 INFO L82 PathProgramCache]: Analyzing trace with hash -724191544, now seen corresponding path program 11 times [2018-09-26 08:11:26,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:26,305 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:26,305 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:11:26,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:11:26,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:11:26,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:11:26,307 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-09-26 08:11:26,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:26,330 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-26 08:11:26,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:11:26,331 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-09-26 08:11:26,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:26,332 INFO L225 Difference]: With dead ends: 18 [2018-09-26 08:11:26,332 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:11:26,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:11:26,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:11:26,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 08:11:26,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:11:26,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-26 08:11:26,337 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-09-26 08:11:26,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:26,338 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-26 08:11:26,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:11:26,338 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-26 08:11:26,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:11:26,339 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:26,339 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-09-26 08:11:26,340 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:26,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:26,340 INFO L82 PathProgramCache]: Analyzing trace with hash -975103359, now seen corresponding path program 12 times [2018-09-26 08:11:26,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:26,397 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:26,397 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:11:26,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:11:26,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:11:26,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:11:26,399 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-09-26 08:11:26,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:26,413 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-26 08:11:26,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:11:26,413 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-26 08:11:26,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:26,414 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:11:26,414 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:11:26,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:11:26,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:11:26,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:11:26,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:11:26,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 08:11:26,419 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-09-26 08:11:26,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:26,420 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 08:11:26,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:11:26,420 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 08:11:26,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:11:26,421 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:26,421 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-09-26 08:11:26,421 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:26,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:26,422 INFO L82 PathProgramCache]: Analyzing trace with hash -163435032, now seen corresponding path program 13 times [2018-09-26 08:11:26,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:26,502 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:26,503 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:11:26,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:11:26,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:11:26,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:11:26,508 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-09-26 08:11:26,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:26,538 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-26 08:11:26,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:11:26,539 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-09-26 08:11:26,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:26,540 INFO L225 Difference]: With dead ends: 20 [2018-09-26 08:11:26,540 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 08:11:26,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:11:26,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 08:11:26,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-09-26 08:11:26,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-26 08:11:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-26 08:11:26,546 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-09-26 08:11:26,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:26,547 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-26 08:11:26,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:11:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-26 08:11:26,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:11:26,548 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:26,548 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-09-26 08:11:26,548 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:26,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:26,549 INFO L82 PathProgramCache]: Analyzing trace with hash -771520671, now seen corresponding path program 14 times [2018-09-26 08:11:26,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:26,613 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:26,614 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:26,614 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:11:26,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:11:26,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:11:26,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:11:26,616 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-09-26 08:11:26,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:26,632 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-26 08:11:26,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:11:26,633 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-09-26 08:11:26,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:26,634 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:11:26,634 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:11:26,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:11:26,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:11:26,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:11:26,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:11:26,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-26 08:11:26,638 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-09-26 08:11:26,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:26,639 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-26 08:11:26,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:11:26,639 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-26 08:11:26,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:11:26,640 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:26,640 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-09-26 08:11:26,640 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:26,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:26,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1852661000, now seen corresponding path program 15 times [2018-09-26 08:11:26,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:26,701 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:26,702 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:26,702 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:11:26,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:11:26,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:11:26,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:11:26,704 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-09-26 08:11:26,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:26,722 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-09-26 08:11:26,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:11:26,722 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-26 08:11:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:26,723 INFO L225 Difference]: With dead ends: 22 [2018-09-26 08:11:26,723 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 08:11:26,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:11:26,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 08:11:26,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-26 08:11:26,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 08:11:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-26 08:11:26,731 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-09-26 08:11:26,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:26,731 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-26 08:11:26,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:11:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-26 08:11:26,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:11:26,732 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:26,732 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-09-26 08:11:26,733 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:26,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:26,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1597914177, now seen corresponding path program 16 times [2018-09-26 08:11:26,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:26,796 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:26,797 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:26,797 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:11:26,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:11:26,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:11:26,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:11:26,799 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-09-26 08:11:26,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:26,815 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-26 08:11:26,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:11:26,815 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-09-26 08:11:26,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:26,817 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:11:26,817 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:11:26,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:11:26,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:11:26,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-26 08:11:26,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:11:26,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 08:11:26,822 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-09-26 08:11:26,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:26,823 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 08:11:26,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:11:26,823 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 08:11:26,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:11:26,825 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:26,825 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-09-26 08:11:26,830 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:26,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:26,831 INFO L82 PathProgramCache]: Analyzing trace with hash -2004270040, now seen corresponding path program 17 times [2018-09-26 08:11:26,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:26,906 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:26,907 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:26,907 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:11:26,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:11:26,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:11:26,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:11:26,908 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-09-26 08:11:26,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:26,926 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-26 08:11:26,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:11:26,926 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-09-26 08:11:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:26,927 INFO L225 Difference]: With dead ends: 24 [2018-09-26 08:11:26,927 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 08:11:26,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:11:26,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 08:11:26,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-26 08:11:26,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 08:11:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-26 08:11:26,932 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-09-26 08:11:26,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:26,932 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-26 08:11:26,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:11:26,933 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-26 08:11:26,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:11:26,933 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:26,933 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-09-26 08:11:26,934 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:26,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:26,934 INFO L82 PathProgramCache]: Analyzing trace with hash -2002831071, now seen corresponding path program 18 times [2018-09-26 08:11:26,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:27,006 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:27,006 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:27,007 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:11:27,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:11:27,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:11:27,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:11:27,008 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-09-26 08:11:27,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:27,023 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-26 08:11:27,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:11:27,024 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-09-26 08:11:27,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:27,025 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:11:27,025 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:11:27,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:11:27,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:11:27,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 08:11:27,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:11:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-26 08:11:27,029 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-09-26 08:11:27,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:27,030 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-26 08:11:27,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:11:27,030 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-26 08:11:27,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:11:27,031 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:27,031 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-09-26 08:11:27,031 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:27,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:27,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1958223032, now seen corresponding path program 19 times [2018-09-26 08:11:27,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:27,109 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:27,109 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:27,109 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:11:27,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:11:27,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:11:27,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:11:27,111 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-09-26 08:11:27,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:27,137 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-26 08:11:27,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:11:27,138 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-09-26 08:11:27,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:27,139 INFO L225 Difference]: With dead ends: 26 [2018-09-26 08:11:27,139 INFO L226 Difference]: Without dead ends: 24 [2018-09-26 08:11:27,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:11:27,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-26 08:11:27,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-26 08:11:27,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-26 08:11:27,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-26 08:11:27,147 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-09-26 08:11:27,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:27,148 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-26 08:11:27,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:11:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-26 08:11:27,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:11:27,149 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:27,149 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-09-26 08:11:27,149 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:27,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:27,150 INFO L82 PathProgramCache]: Analyzing trace with hash -575373823, now seen corresponding path program 20 times [2018-09-26 08:11:27,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:27,251 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:27,252 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:11:27,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:11:27,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:11:27,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:11:27,255 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-09-26 08:11:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:27,285 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-26 08:11:27,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:11:27,286 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-09-26 08:11:27,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:27,286 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:11:27,286 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:11:27,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:11:27,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:11:27,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:11:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:11:27,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-26 08:11:27,295 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-09-26 08:11:27,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:27,295 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-26 08:11:27,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:11:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-26 08:11:27,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:11:27,301 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:27,302 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-09-26 08:11:27,302 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:27,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:27,302 INFO L82 PathProgramCache]: Analyzing trace with hash -656721304, now seen corresponding path program 21 times [2018-09-26 08:11:27,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:27,405 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:27,405 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:11:27,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:11:27,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:11:27,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:11:27,408 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-09-26 08:11:27,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:27,437 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-09-26 08:11:27,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:11:27,438 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-09-26 08:11:27,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:27,441 INFO L225 Difference]: With dead ends: 28 [2018-09-26 08:11:27,441 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 08:11:27,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:11:27,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 08:11:27,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-26 08:11:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 08:11:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-26 08:11:27,453 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-09-26 08:11:27,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:27,453 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-26 08:11:27,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:11:27,454 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-26 08:11:27,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:11:27,454 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:27,454 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-09-26 08:11:27,455 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:27,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:27,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1116474081, now seen corresponding path program 22 times [2018-09-26 08:11:27,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:27,595 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:27,596 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:27,596 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:11:27,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:11:27,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:11:27,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:11:27,598 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-09-26 08:11:27,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:27,628 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-26 08:11:27,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:11:27,629 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-09-26 08:11:27,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:27,629 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:11:27,629 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:11:27,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:11:27,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:11:27,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 08:11:27,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:11:27,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-26 08:11:27,636 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-09-26 08:11:27,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:27,636 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-26 08:11:27,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:11:27,637 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-26 08:11:27,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:11:27,638 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:27,638 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-09-26 08:11:27,638 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:27,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:27,639 INFO L82 PathProgramCache]: Analyzing trace with hash 250956168, now seen corresponding path program 23 times [2018-09-26 08:11:27,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:27,752 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:27,753 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:27,753 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:11:27,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:11:27,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:11:27,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:11:27,758 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-09-26 08:11:27,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:27,777 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-26 08:11:27,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:11:27,778 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-09-26 08:11:27,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:27,779 INFO L225 Difference]: With dead ends: 30 [2018-09-26 08:11:27,779 INFO L226 Difference]: Without dead ends: 28 [2018-09-26 08:11:27,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:11:27,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-26 08:11:27,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-09-26 08:11:27,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-26 08:11:27,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-09-26 08:11:27,788 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-09-26 08:11:27,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:27,789 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-09-26 08:11:27,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:11:27,789 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-09-26 08:11:27,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-26 08:11:27,790 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:27,790 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-09-26 08:11:27,790 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:27,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:27,792 INFO L82 PathProgramCache]: Analyzing trace with hash -810295359, now seen corresponding path program 24 times [2018-09-26 08:11:27,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:27,917 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:27,919 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:27,919 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:11:27,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:11:27,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:11:27,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:11:27,921 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-09-26 08:11:27,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:27,942 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-26 08:11:27,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:11:27,942 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-09-26 08:11:27,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:27,943 INFO L225 Difference]: With dead ends: 31 [2018-09-26 08:11:27,943 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:11:27,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:11:27,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:11:27,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:11:27,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:11:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 08:11:27,952 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-09-26 08:11:27,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:27,952 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 08:11:27,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:11:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 08:11:27,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:11:27,953 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:27,953 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-09-26 08:11:27,953 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:27,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:27,954 INFO L82 PathProgramCache]: Analyzing trace with hash 650645672, now seen corresponding path program 25 times [2018-09-26 08:11:27,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:28,073 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:28,073 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:28,074 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:11:28,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:11:28,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:11:28,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:11:28,075 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-09-26 08:11:28,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:28,101 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-26 08:11:28,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:11:28,103 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-09-26 08:11:28,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:28,104 INFO L225 Difference]: With dead ends: 32 [2018-09-26 08:11:28,104 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 08:11:28,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:11:28,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 08:11:28,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-26 08:11:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 08:11:28,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-09-26 08:11:28,110 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-09-26 08:11:28,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:28,110 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-09-26 08:11:28,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:11:28,110 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-09-26 08:11:28,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:11:28,111 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:28,111 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-09-26 08:11:28,111 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:28,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:28,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1304822623, now seen corresponding path program 26 times [2018-09-26 08:11:28,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:28,240 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:28,241 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:28,241 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:11:28,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:11:28,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:11:28,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:11:28,242 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-09-26 08:11:28,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:28,273 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-26 08:11:28,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:11:28,273 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-09-26 08:11:28,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:28,274 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:11:28,274 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:11:28,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:11:28,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:11:28,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:11:28,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:11:28,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-26 08:11:28,278 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-09-26 08:11:28,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:28,281 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-26 08:11:28,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:11:28,282 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-26 08:11:28,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:11:28,282 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:28,283 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-09-26 08:11:28,283 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:28,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:28,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1794797624, now seen corresponding path program 27 times [2018-09-26 08:11:28,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:28,421 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:28,422 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:28,422 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:11:28,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:11:28,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:11:28,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:11:28,425 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-09-26 08:11:28,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:28,453 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-09-26 08:11:28,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:11:28,454 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-09-26 08:11:28,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:28,454 INFO L225 Difference]: With dead ends: 34 [2018-09-26 08:11:28,454 INFO L226 Difference]: Without dead ends: 32 [2018-09-26 08:11:28,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:11:28,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-26 08:11:28,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-09-26 08:11:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-26 08:11:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-26 08:11:28,466 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-09-26 08:11:28,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:28,467 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-26 08:11:28,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:11:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-26 08:11:28,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-26 08:11:28,470 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:28,470 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-09-26 08:11:28,471 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:28,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:28,471 INFO L82 PathProgramCache]: Analyzing trace with hash 195846529, now seen corresponding path program 28 times [2018-09-26 08:11:28,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:28,614 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:28,614 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:28,615 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:11:28,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:11:28,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:11:28,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:11:28,616 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-09-26 08:11:28,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:28,644 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-26 08:11:28,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:11:28,645 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-09-26 08:11:28,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:28,646 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:11:28,646 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:11:28,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:11:28,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:11:28,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 08:11:28,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:11:28,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-26 08:11:28,655 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-09-26 08:11:28,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:28,656 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-26 08:11:28,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:11:28,656 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-26 08:11:28,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:11:28,657 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:28,657 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-09-26 08:11:28,657 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:28,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:28,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1776273128, now seen corresponding path program 29 times [2018-09-26 08:11:28,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:28,805 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:28,806 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:28,806 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:11:28,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:11:28,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:11:28,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:11:28,808 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-09-26 08:11:28,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:28,838 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-26 08:11:28,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:11:28,839 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-09-26 08:11:28,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:28,839 INFO L225 Difference]: With dead ends: 36 [2018-09-26 08:11:28,839 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 08:11:28,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:11:28,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 08:11:28,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-26 08:11:28,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-26 08:11:28,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-09-26 08:11:28,845 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-09-26 08:11:28,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:28,845 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-09-26 08:11:28,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:11:28,846 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-09-26 08:11:28,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-26 08:11:28,847 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:28,847 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-09-26 08:11:28,847 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:28,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:28,847 INFO L82 PathProgramCache]: Analyzing trace with hash -770109855, now seen corresponding path program 30 times [2018-09-26 08:11:28,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:29,000 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:29,001 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:29,001 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:11:29,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:11:29,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:11:29,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:11:29,003 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-09-26 08:11:29,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:29,026 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-09-26 08:11:29,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:11:29,027 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-09-26 08:11:29,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:29,027 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:11:29,028 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:11:29,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:11:29,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:11:29,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:11:29,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:11:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-26 08:11:29,035 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-09-26 08:11:29,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:29,035 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-26 08:11:29,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:11:29,035 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-26 08:11:29,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:11:29,036 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:29,036 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-09-26 08:11:29,036 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:29,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:29,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1896396296, now seen corresponding path program 31 times [2018-09-26 08:11:29,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:29,267 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:29,267 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:29,268 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:11:29,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:11:29,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:11:29,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:11:29,269 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-09-26 08:11:29,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:29,285 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-26 08:11:29,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:11:29,285 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-09-26 08:11:29,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:29,286 INFO L225 Difference]: With dead ends: 38 [2018-09-26 08:11:29,286 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 08:11:29,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:11:29,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 08:11:29,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-26 08:11:29,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-26 08:11:29,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-26 08:11:29,296 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-09-26 08:11:29,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:29,297 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-26 08:11:29,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:11:29,297 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-26 08:11:29,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-26 08:11:29,297 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:29,297 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-09-26 08:11:29,298 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:29,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:29,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1341258943, now seen corresponding path program 32 times [2018-09-26 08:11:29,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:29,468 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:29,469 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:11:29,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:11:29,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:11:29,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:11:29,473 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-09-26 08:11:29,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:29,498 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-26 08:11:29,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:11:29,499 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-09-26 08:11:29,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:29,499 INFO L225 Difference]: With dead ends: 39 [2018-09-26 08:11:29,500 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:11:29,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:11:29,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:11:29,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 08:11:29,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:11:29,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-26 08:11:29,506 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-09-26 08:11:29,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:29,506 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-26 08:11:29,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:11:29,506 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-26 08:11:29,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:11:29,507 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:29,507 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-09-26 08:11:29,507 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:29,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:29,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1370643752, now seen corresponding path program 33 times [2018-09-26 08:11:29,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:29,671 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:29,671 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:29,672 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:11:29,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:11:29,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:11:29,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:11:29,674 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-09-26 08:11:29,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:29,701 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-26 08:11:29,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:11:29,702 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-09-26 08:11:29,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:29,702 INFO L225 Difference]: With dead ends: 40 [2018-09-26 08:11:29,702 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 08:11:29,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:11:29,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 08:11:29,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-09-26 08:11:29,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-26 08:11:29,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-26 08:11:29,706 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-09-26 08:11:29,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:29,707 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-26 08:11:29,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:11:29,708 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-26 08:11:29,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-26 08:11:29,708 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:29,708 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-09-26 08:11:29,708 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:29,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:29,709 INFO L82 PathProgramCache]: Analyzing trace with hash -459718623, now seen corresponding path program 34 times [2018-09-26 08:11:29,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:29,890 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:29,892 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:29,892 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:11:29,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:11:29,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:11:29,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:11:29,894 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-09-26 08:11:29,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:29,924 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-26 08:11:29,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:11:29,925 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-09-26 08:11:29,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:29,925 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:11:29,925 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:11:29,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:11:29,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:11:29,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 08:11:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:11:29,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-09-26 08:11:29,929 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-09-26 08:11:29,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:29,929 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-09-26 08:11:29,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:11:29,930 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-09-26 08:11:29,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:11:29,930 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:29,930 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-09-26 08:11:29,930 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:29,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:29,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1366377400, now seen corresponding path program 35 times [2018-09-26 08:11:29,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:30,121 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:30,121 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:30,121 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:11:30,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:11:30,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:11:30,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:11:30,123 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-09-26 08:11:30,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:30,148 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-26 08:11:30,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:11:30,148 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-09-26 08:11:30,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:30,148 INFO L225 Difference]: With dead ends: 42 [2018-09-26 08:11:30,149 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 08:11:30,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:11:30,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 08:11:30,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-26 08:11:30,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-26 08:11:30,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-09-26 08:11:30,152 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-09-26 08:11:30,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:30,152 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-09-26 08:11:30,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:11:30,152 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-09-26 08:11:30,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-26 08:11:30,153 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:30,153 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-09-26 08:11:30,153 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:30,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:30,154 INFO L82 PathProgramCache]: Analyzing trace with hash 591971585, now seen corresponding path program 36 times [2018-09-26 08:11:30,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:30,333 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:30,333 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:30,334 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:11:30,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:11:30,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:11:30,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:11:30,335 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-09-26 08:11:30,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:30,355 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-26 08:11:30,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:11:30,355 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-09-26 08:11:30,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:30,356 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:11:30,356 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:11:30,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:11:30,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:11:30,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:11:30,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:11:30,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 08:11:30,360 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-09-26 08:11:30,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:30,360 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 08:11:30,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:11:30,360 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 08:11:30,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:11:30,360 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:30,361 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-09-26 08:11:30,361 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:30,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:30,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1171247976, now seen corresponding path program 37 times [2018-09-26 08:11:30,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:30,559 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:30,560 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:30,560 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:11:30,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:11:30,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:11:30,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:11:30,562 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-09-26 08:11:30,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:30,586 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-26 08:11:30,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:11:30,587 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-09-26 08:11:30,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:30,587 INFO L225 Difference]: With dead ends: 44 [2018-09-26 08:11:30,587 INFO L226 Difference]: Without dead ends: 42 [2018-09-26 08:11:30,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:11:30,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-26 08:11:30,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-09-26 08:11:30,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-26 08:11:30,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-26 08:11:30,591 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-09-26 08:11:30,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:30,591 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-26 08:11:30,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:11:30,591 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-26 08:11:30,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-26 08:11:30,592 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:30,592 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-09-26 08:11:30,592 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:30,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:30,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1948946913, now seen corresponding path program 38 times [2018-09-26 08:11:30,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:30,777 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:30,778 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:30,778 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:11:30,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:11:30,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:11:30,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:11:30,780 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-09-26 08:11:30,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:30,808 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-26 08:11:30,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:11:30,809 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-09-26 08:11:30,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:30,810 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:11:30,810 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:11:30,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:11:30,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:11:30,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:11:30,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:11:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-09-26 08:11:30,813 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-09-26 08:11:30,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:30,813 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-09-26 08:11:30,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:11:30,814 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-09-26 08:11:30,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:11:30,814 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:30,814 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-09-26 08:11:30,814 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:30,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:30,815 INFO L82 PathProgramCache]: Analyzing trace with hash 287810184, now seen corresponding path program 39 times [2018-09-26 08:11:30,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:30,995 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:30,995 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:11:30,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:11:30,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:11:30,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:11:30,997 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-09-26 08:11:31,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:31,019 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-26 08:11:31,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:11:31,020 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-09-26 08:11:31,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:31,020 INFO L225 Difference]: With dead ends: 46 [2018-09-26 08:11:31,020 INFO L226 Difference]: Without dead ends: 44 [2018-09-26 08:11:31,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:11:31,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-26 08:11:31,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-09-26 08:11:31,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-26 08:11:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-09-26 08:11:31,024 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-09-26 08:11:31,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:31,024 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-09-26 08:11:31,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:11:31,024 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-09-26 08:11:31,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-26 08:11:31,025 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:31,025 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-09-26 08:11:31,025 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:31,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:31,026 INFO L82 PathProgramCache]: Analyzing trace with hash 332179137, now seen corresponding path program 40 times [2018-09-26 08:11:31,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:31,218 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:31,218 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:31,218 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:11:31,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:11:31,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:11:31,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:11:31,220 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-09-26 08:11:31,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:31,254 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-26 08:11:31,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:11:31,254 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-09-26 08:11:31,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:31,255 INFO L225 Difference]: With dead ends: 47 [2018-09-26 08:11:31,255 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:11:31,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:11:31,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:11:31,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 08:11:31,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:11:31,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-26 08:11:31,259 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-09-26 08:11:31,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:31,259 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-26 08:11:31,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:11:31,259 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-26 08:11:31,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:11:31,260 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:31,260 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-09-26 08:11:31,260 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:31,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:31,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1707616680, now seen corresponding path program 41 times [2018-09-26 08:11:31,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:31,464 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:31,464 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:11:31,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:11:31,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:11:31,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:11:31,467 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-09-26 08:11:31,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:31,490 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-26 08:11:31,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:11:31,490 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-09-26 08:11:31,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:31,491 INFO L225 Difference]: With dead ends: 48 [2018-09-26 08:11:31,491 INFO L226 Difference]: Without dead ends: 46 [2018-09-26 08:11:31,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:11:31,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-26 08:11:31,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-26 08:11:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-26 08:11:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-26 08:11:31,495 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-09-26 08:11:31,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:31,495 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-26 08:11:31,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:11:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-26 08:11:31,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-26 08:11:31,496 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:31,496 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-09-26 08:11:31,496 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:31,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:31,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1396507553, now seen corresponding path program 42 times [2018-09-26 08:11:31,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:31,709 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:31,709 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:31,709 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:11:31,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:11:31,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:11:31,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:11:31,711 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-09-26 08:11:31,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:31,745 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-09-26 08:11:31,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:11:31,746 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-09-26 08:11:31,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:31,746 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:11:31,747 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:11:31,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:11:31,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:11:31,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 08:11:31,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:11:31,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-26 08:11:31,750 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-09-26 08:11:31,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:31,751 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-26 08:11:31,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:11:31,751 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-26 08:11:31,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:11:31,751 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:31,752 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-09-26 08:11:31,752 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:31,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:31,752 INFO L82 PathProgramCache]: Analyzing trace with hash 342059208, now seen corresponding path program 43 times [2018-09-26 08:11:31,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:31,994 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:31,995 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:31,995 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:11:31,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:11:31,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:11:31,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:11:31,997 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-09-26 08:11:32,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:32,032 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-26 08:11:32,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:11:32,032 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-09-26 08:11:32,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:32,033 INFO L225 Difference]: With dead ends: 50 [2018-09-26 08:11:32,033 INFO L226 Difference]: Without dead ends: 48 [2018-09-26 08:11:32,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:11:32,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-26 08:11:32,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-09-26 08:11:32,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-26 08:11:32,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-09-26 08:11:32,038 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-09-26 08:11:32,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:32,038 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-09-26 08:11:32,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:11:32,038 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-09-26 08:11:32,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-26 08:11:32,039 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:32,039 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-09-26 08:11:32,039 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:32,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:32,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2013898881, now seen corresponding path program 44 times [2018-09-26 08:11:32,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:32,310 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:32,310 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:32,310 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:11:32,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:11:32,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:11:32,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:11:32,312 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-09-26 08:11:32,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:32,344 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-26 08:11:32,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:11:32,345 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-09-26 08:11:32,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:32,345 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:11:32,345 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:11:32,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:11:32,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:11:32,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-26 08:11:32,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:11:32,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-26 08:11:32,350 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-09-26 08:11:32,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:32,350 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-26 08:11:32,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:11:32,350 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-26 08:11:32,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:11:32,351 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:32,351 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-09-26 08:11:32,351 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:32,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:32,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1993646104, now seen corresponding path program 45 times [2018-09-26 08:11:32,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:32,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:32,590 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:32,590 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:11:32,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:11:32,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:11:32,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:11:32,592 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-09-26 08:11:32,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:32,615 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-09-26 08:11:32,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:11:32,615 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-09-26 08:11:32,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:32,616 INFO L225 Difference]: With dead ends: 52 [2018-09-26 08:11:32,616 INFO L226 Difference]: Without dead ends: 50 [2018-09-26 08:11:32,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:11:32,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-26 08:11:32,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-26 08:11:32,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-26 08:11:32,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-09-26 08:11:32,619 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-09-26 08:11:32,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:32,619 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-09-26 08:11:32,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:11:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-09-26 08:11:32,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-26 08:11:32,620 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:32,620 INFO L375 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-09-26 08:11:32,620 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:32,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:32,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1673489055, now seen corresponding path program 46 times [2018-09-26 08:11:32,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:32,834 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:32,834 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:11:32,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:11:32,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:11:32,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:11:32,836 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-09-26 08:11:32,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:32,863 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-09-26 08:11:32,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:11:32,864 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-09-26 08:11:32,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:32,864 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:11:32,864 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:11:32,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:11:32,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:11:32,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 08:11:32,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:11:32,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-26 08:11:32,869 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-09-26 08:11:32,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:32,869 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-26 08:11:32,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:11:32,869 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-26 08:11:32,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:11:32,870 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:32,870 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-09-26 08:11:32,870 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:32,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:32,871 INFO L82 PathProgramCache]: Analyzing trace with hash -338555128, now seen corresponding path program 47 times [2018-09-26 08:11:32,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:33,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:33,074 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:33,074 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:11:33,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:11:33,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:11:33,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:11:33,076 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-09-26 08:11:33,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:33,103 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-09-26 08:11:33,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:11:33,103 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-09-26 08:11:33,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:33,104 INFO L225 Difference]: With dead ends: 54 [2018-09-26 08:11:33,104 INFO L226 Difference]: Without dead ends: 52 [2018-09-26 08:11:33,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:11:33,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-26 08:11:33,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-09-26 08:11:33,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-26 08:11:33,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-09-26 08:11:33,108 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-09-26 08:11:33,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:33,108 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-09-26 08:11:33,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:11:33,108 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-09-26 08:11:33,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-26 08:11:33,109 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:33,109 INFO L375 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-09-26 08:11:33,109 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:33,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:33,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1905276351, now seen corresponding path program 48 times [2018-09-26 08:11:33,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:33,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:33,335 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:33,335 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:11:33,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:11:33,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:11:33,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:11:33,338 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-09-26 08:11:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:33,373 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-26 08:11:33,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:11:33,374 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-09-26 08:11:33,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:33,375 INFO L225 Difference]: With dead ends: 55 [2018-09-26 08:11:33,375 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:11:33,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:11:33,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:11:33,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 08:11:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:11:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-26 08:11:33,381 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-09-26 08:11:33,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:33,381 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-26 08:11:33,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:11:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-26 08:11:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:11:33,382 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:33,382 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-09-26 08:11:33,383 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:33,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:33,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1065973288, now seen corresponding path program 49 times [2018-09-26 08:11:33,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:33,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:33,623 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:33,623 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:11:33,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:11:33,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:11:33,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:11:33,625 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-09-26 08:11:33,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:33,665 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-26 08:11:33,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:11:33,666 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-09-26 08:11:33,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:33,666 INFO L225 Difference]: With dead ends: 56 [2018-09-26 08:11:33,666 INFO L226 Difference]: Without dead ends: 54 [2018-09-26 08:11:33,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:11:33,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-26 08:11:33,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-09-26 08:11:33,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-26 08:11:33,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-09-26 08:11:33,670 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-09-26 08:11:33,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:33,670 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-09-26 08:11:33,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:11:33,670 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-09-26 08:11:33,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-26 08:11:33,671 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:33,671 INFO L375 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-09-26 08:11:33,671 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:33,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:33,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1314568415, now seen corresponding path program 50 times [2018-09-26 08:11:33,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:33,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:33,902 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:33,902 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:11:33,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:11:33,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:11:33,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:11:33,904 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-09-26 08:11:33,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:33,941 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-09-26 08:11:33,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:11:33,941 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-09-26 08:11:33,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:33,942 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:11:33,942 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:11:33,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:11:33,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:11:33,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-26 08:11:33,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:11:33,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-09-26 08:11:33,946 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-09-26 08:11:33,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:33,946 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-09-26 08:11:33,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:11:33,946 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-09-26 08:11:33,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:11:33,947 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:33,947 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-09-26 08:11:33,947 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:33,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:33,947 INFO L82 PathProgramCache]: Analyzing trace with hash -2096917176, now seen corresponding path program 51 times [2018-09-26 08:11:33,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:34,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:34,189 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:34,189 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:11:34,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:11:34,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:11:34,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:11:34,191 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-09-26 08:11:34,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:34,222 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-09-26 08:11:34,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:11:34,222 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-09-26 08:11:34,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:34,223 INFO L225 Difference]: With dead ends: 58 [2018-09-26 08:11:34,223 INFO L226 Difference]: Without dead ends: 56 [2018-09-26 08:11:34,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:11:34,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-26 08:11:34,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-09-26 08:11:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-26 08:11:34,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-26 08:11:34,226 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-09-26 08:11:34,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:34,226 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-26 08:11:34,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:11:34,227 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-26 08:11:34,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-26 08:11:34,227 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:34,227 INFO L375 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-09-26 08:11:34,227 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:34,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:34,228 INFO L82 PathProgramCache]: Analyzing trace with hash -579924991, now seen corresponding path program 52 times [2018-09-26 08:11:34,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:34,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:34,477 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:34,477 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:11:34,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:11:34,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:11:34,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:11:34,479 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-09-26 08:11:34,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:34,513 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-26 08:11:34,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:11:34,513 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-09-26 08:11:34,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:34,514 INFO L225 Difference]: With dead ends: 59 [2018-09-26 08:11:34,514 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 08:11:34,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:11:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 08:11:34,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-26 08:11:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:11:34,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-26 08:11:34,518 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-09-26 08:11:34,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:34,518 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-26 08:11:34,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:11:34,519 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-26 08:11:34,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:11:34,519 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:34,519 INFO L375 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-09-26 08:11:34,520 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:34,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:34,520 INFO L82 PathProgramCache]: Analyzing trace with hash -797807512, now seen corresponding path program 53 times [2018-09-26 08:11:34,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:34,771 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:34,771 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:11:34,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:11:34,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:11:34,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:11:34,773 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-09-26 08:11:34,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:34,819 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-26 08:11:34,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:11:34,819 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-09-26 08:11:34,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:34,820 INFO L225 Difference]: With dead ends: 60 [2018-09-26 08:11:34,820 INFO L226 Difference]: Without dead ends: 58 [2018-09-26 08:11:34,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:11:34,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-26 08:11:34,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-09-26 08:11:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-26 08:11:34,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-09-26 08:11:34,825 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-09-26 08:11:34,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:34,825 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-09-26 08:11:34,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:11:34,825 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-09-26 08:11:34,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-26 08:11:34,826 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:34,826 INFO L375 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-09-26 08:11:34,826 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:34,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:34,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1037768929, now seen corresponding path program 54 times [2018-09-26 08:11:34,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:35,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:35,143 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:35,143 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:11:35,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:11:35,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:11:35,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:11:35,145 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-09-26 08:11:35,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:35,194 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-09-26 08:11:35,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:11:35,194 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-09-26 08:11:35,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:35,195 INFO L225 Difference]: With dead ends: 61 [2018-09-26 08:11:35,196 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:11:35,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:11:35,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:11:35,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 08:11:35,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:11:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-09-26 08:11:35,201 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-09-26 08:11:35,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:35,201 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-09-26 08:11:35,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:11:35,201 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-09-26 08:11:35,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:11:35,202 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:35,202 INFO L375 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-09-26 08:11:35,203 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:35,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:35,203 INFO L82 PathProgramCache]: Analyzing trace with hash 2106063752, now seen corresponding path program 55 times [2018-09-26 08:11:35,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:35,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:35,556 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:35,557 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:11:35,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:11:35,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:11:35,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:11:35,558 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-09-26 08:11:35,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:35,590 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-09-26 08:11:35,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:11:35,591 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-09-26 08:11:35,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:35,591 INFO L225 Difference]: With dead ends: 62 [2018-09-26 08:11:35,591 INFO L226 Difference]: Without dead ends: 60 [2018-09-26 08:11:35,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:11:35,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-26 08:11:35,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-09-26 08:11:35,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-26 08:11:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-09-26 08:11:35,595 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-09-26 08:11:35,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:35,595 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-09-26 08:11:35,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:11:35,596 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-09-26 08:11:35,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-26 08:11:35,596 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:35,596 INFO L375 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-09-26 08:11:35,597 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:35,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:35,597 INFO L82 PathProgramCache]: Analyzing trace with hash 863464897, now seen corresponding path program 56 times [2018-09-26 08:11:35,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:35,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:35,840 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:35,841 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:11:35,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:11:35,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:11:35,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:11:35,843 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-09-26 08:11:35,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:35,888 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-26 08:11:35,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:11:35,888 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-09-26 08:11:35,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:35,889 INFO L225 Difference]: With dead ends: 63 [2018-09-26 08:11:35,889 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 08:11:35,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:11:35,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 08:11:35,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-26 08:11:35,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:11:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-26 08:11:35,893 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-09-26 08:11:35,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:35,894 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-26 08:11:35,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:11:35,894 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-26 08:11:35,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:11:35,895 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:35,895 INFO L375 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-09-26 08:11:35,895 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:35,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:35,895 INFO L82 PathProgramCache]: Analyzing trace with hash 997606056, now seen corresponding path program 57 times [2018-09-26 08:11:35,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:36,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:36,133 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:36,133 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:11:36,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:11:36,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:11:36,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:11:36,135 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-09-26 08:11:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:36,179 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-09-26 08:11:36,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:11:36,180 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-09-26 08:11:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:36,180 INFO L225 Difference]: With dead ends: 64 [2018-09-26 08:11:36,180 INFO L226 Difference]: Without dead ends: 62 [2018-09-26 08:11:36,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:11:36,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-26 08:11:36,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-09-26 08:11:36,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-26 08:11:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-09-26 08:11:36,184 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-09-26 08:11:36,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:36,185 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-09-26 08:11:36,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:11:36,185 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-09-26 08:11:36,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-26 08:11:36,185 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:36,185 INFO L375 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-09-26 08:11:36,186 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:36,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:36,186 INFO L82 PathProgramCache]: Analyzing trace with hash 861014689, now seen corresponding path program 58 times [2018-09-26 08:11:36,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:36,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:36,438 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:36,438 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:11:36,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:11:36,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:11:36,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:11:36,440 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-09-26 08:11:36,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:36,481 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-09-26 08:11:36,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:11:36,481 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-09-26 08:11:36,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:36,482 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:11:36,482 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:11:36,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:11:36,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:11:36,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-26 08:11:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:11:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-09-26 08:11:36,486 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-09-26 08:11:36,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:36,486 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-09-26 08:11:36,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:11:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-09-26 08:11:36,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:11:36,487 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:36,487 INFO L375 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-09-26 08:11:36,487 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:36,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:36,487 INFO L82 PathProgramCache]: Analyzing trace with hash 921649608, now seen corresponding path program 59 times [2018-09-26 08:11:36,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:36,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:36,753 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:36,753 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:11:36,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:11:36,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:11:36,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:11:36,756 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-09-26 08:11:36,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:36,804 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-26 08:11:36,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:11:36,804 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-09-26 08:11:36,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:36,805 INFO L225 Difference]: With dead ends: 66 [2018-09-26 08:11:36,805 INFO L226 Difference]: Without dead ends: 64 [2018-09-26 08:11:36,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:11:36,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-26 08:11:36,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-09-26 08:11:36,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-26 08:11:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-09-26 08:11:36,809 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-09-26 08:11:36,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:36,809 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-09-26 08:11:36,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:11:36,810 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-09-26 08:11:36,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-26 08:11:36,810 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:36,810 INFO L375 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-09-26 08:11:36,811 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:36,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:36,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1493635199, now seen corresponding path program 60 times [2018-09-26 08:11:36,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:37,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:37,082 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:37,082 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:11:37,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:11:37,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:11:37,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:11:37,084 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-09-26 08:11:37,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:37,125 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-26 08:11:37,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:11:37,126 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-09-26 08:11:37,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:37,126 INFO L225 Difference]: With dead ends: 67 [2018-09-26 08:11:37,126 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:11:37,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:11:37,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:11:37,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-09-26 08:11:37,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:11:37,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-26 08:11:37,130 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-09-26 08:11:37,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:37,131 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-26 08:11:37,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:11:37,131 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-26 08:11:37,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:11:37,131 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:37,131 INFO L375 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-09-26 08:11:37,132 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:37,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:37,132 INFO L82 PathProgramCache]: Analyzing trace with hash 941947112, now seen corresponding path program 61 times [2018-09-26 08:11:37,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:37,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:37,394 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:37,394 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:11:37,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:11:37,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:11:37,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:11:37,396 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-09-26 08:11:37,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:37,444 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-09-26 08:11:37,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:11:37,445 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-09-26 08:11:37,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:37,445 INFO L225 Difference]: With dead ends: 68 [2018-09-26 08:11:37,446 INFO L226 Difference]: Without dead ends: 66 [2018-09-26 08:11:37,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:11:37,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-26 08:11:37,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-09-26 08:11:37,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-26 08:11:37,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-09-26 08:11:37,450 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-09-26 08:11:37,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:37,450 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-09-26 08:11:37,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:11:37,450 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-09-26 08:11:37,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-26 08:11:37,451 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:37,451 INFO L375 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-09-26 08:11:37,451 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:37,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:37,452 INFO L82 PathProgramCache]: Analyzing trace with hash -864412575, now seen corresponding path program 62 times [2018-09-26 08:11:37,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:37,717 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:37,717 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:11:37,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:11:37,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:11:37,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:11:37,720 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-09-26 08:11:37,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:37,777 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-09-26 08:11:37,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:11:37,778 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-09-26 08:11:37,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:37,778 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:11:37,778 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:11:37,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:11:37,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:11:37,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-26 08:11:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:11:37,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-09-26 08:11:37,783 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-09-26 08:11:37,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:37,783 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-09-26 08:11:37,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:11:37,783 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-09-26 08:11:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:11:37,784 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:37,784 INFO L375 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-09-26 08:11:37,784 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:37,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:37,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1026988024, now seen corresponding path program 63 times [2018-09-26 08:11:37,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:38,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:38,057 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:38,057 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:11:38,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:11:38,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:11:38,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:11:38,060 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-09-26 08:11:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:38,102 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-26 08:11:38,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:11:38,103 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-09-26 08:11:38,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:38,104 INFO L225 Difference]: With dead ends: 70 [2018-09-26 08:11:38,104 INFO L226 Difference]: Without dead ends: 68 [2018-09-26 08:11:38,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:11:38,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-26 08:11:38,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-09-26 08:11:38,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-26 08:11:38,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-09-26 08:11:38,110 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-09-26 08:11:38,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:38,110 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-09-26 08:11:38,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:11:38,111 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-09-26 08:11:38,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-26 08:11:38,111 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:38,112 INFO L375 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-09-26 08:11:38,112 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:38,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:38,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1771859647, now seen corresponding path program 64 times [2018-09-26 08:11:38,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:38,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:38,462 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:38,462 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:11:38,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:11:38,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:11:38,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:11:38,465 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-09-26 08:11:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:38,528 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-26 08:11:38,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:11:38,529 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-09-26 08:11:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:38,529 INFO L225 Difference]: With dead ends: 71 [2018-09-26 08:11:38,530 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 08:11:38,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:11:38,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 08:11:38,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-26 08:11:38,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:11:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-26 08:11:38,535 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-09-26 08:11:38,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:38,535 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-26 08:11:38,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:11:38,535 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-26 08:11:38,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:11:38,536 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:38,536 INFO L375 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-09-26 08:11:38,536 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:38,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:38,537 INFO L82 PathProgramCache]: Analyzing trace with hash 906923816, now seen corresponding path program 65 times [2018-09-26 08:11:38,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:38,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:38,868 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:38,868 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:11:38,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:11:38,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:11:38,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:11:38,871 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-09-26 08:11:38,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:38,936 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-09-26 08:11:38,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:11:38,937 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-09-26 08:11:38,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:38,937 INFO L225 Difference]: With dead ends: 72 [2018-09-26 08:11:38,937 INFO L226 Difference]: Without dead ends: 70 [2018-09-26 08:11:38,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:11:38,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-26 08:11:38,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-09-26 08:11:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-26 08:11:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-09-26 08:11:38,942 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-09-26 08:11:38,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:38,943 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-09-26 08:11:38,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:11:38,943 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-09-26 08:11:38,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-26 08:11:38,943 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:38,944 INFO L375 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-09-26 08:11:38,944 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:38,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:38,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1950134751, now seen corresponding path program 66 times [2018-09-26 08:11:38,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:39,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:39,208 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:39,208 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:11:39,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:11:39,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:11:39,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:11:39,211 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-09-26 08:11:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:39,253 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-09-26 08:11:39,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:11:39,253 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-09-26 08:11:39,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:39,254 INFO L225 Difference]: With dead ends: 73 [2018-09-26 08:11:39,254 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:11:39,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:11:39,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:11:39,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-26 08:11:39,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:11:39,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-26 08:11:39,259 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-09-26 08:11:39,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:39,259 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-26 08:11:39,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:11:39,259 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-26 08:11:39,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:11:39,260 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:39,260 INFO L375 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-09-26 08:11:39,260 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:39,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:39,260 INFO L82 PathProgramCache]: Analyzing trace with hash -324637112, now seen corresponding path program 67 times [2018-09-26 08:11:39,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:39,523 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:39,523 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:11:39,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:11:39,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:11:39,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:11:39,526 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-09-26 08:11:39,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:39,568 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-09-26 08:11:39,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:11:39,569 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-09-26 08:11:39,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:39,570 INFO L225 Difference]: With dead ends: 74 [2018-09-26 08:11:39,570 INFO L226 Difference]: Without dead ends: 72 [2018-09-26 08:11:39,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:11:39,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-09-26 08:11:39,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-09-26 08:11:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-26 08:11:39,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-09-26 08:11:39,574 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-09-26 08:11:39,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:39,574 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-09-26 08:11:39,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:11:39,575 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-09-26 08:11:39,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-26 08:11:39,575 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:39,576 INFO L375 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-09-26 08:11:39,576 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:39,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:39,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1473817855, now seen corresponding path program 68 times [2018-09-26 08:11:39,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:39,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:39,849 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:39,850 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:11:39,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:11:39,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:11:39,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:11:39,852 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-09-26 08:11:39,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:39,911 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-26 08:11:39,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:11:39,911 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-09-26 08:11:39,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:39,912 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:11:39,912 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 08:11:39,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:11:39,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 08:11:39,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-26 08:11:39,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:11:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-26 08:11:39,916 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-09-26 08:11:39,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:39,916 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-26 08:11:39,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:11:39,916 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-26 08:11:39,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:11:39,917 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:39,917 INFO L375 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-09-26 08:11:39,917 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:39,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:39,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1556284776, now seen corresponding path program 69 times [2018-09-26 08:11:39,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:40,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:40,188 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:40,189 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:11:40,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:11:40,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:11:40,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:11:40,191 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-09-26 08:11:40,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:40,259 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-09-26 08:11:40,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:11:40,259 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-09-26 08:11:40,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:40,260 INFO L225 Difference]: With dead ends: 76 [2018-09-26 08:11:40,260 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 08:11:40,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:11:40,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 08:11:40,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-26 08:11:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-26 08:11:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-09-26 08:11:40,264 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-09-26 08:11:40,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:40,265 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-09-26 08:11:40,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:11:40,265 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-09-26 08:11:40,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-26 08:11:40,265 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:40,266 INFO L375 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-09-26 08:11:40,266 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:40,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:40,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1000185825, now seen corresponding path program 70 times [2018-09-26 08:11:40,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:40,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:40,532 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:40,532 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:11:40,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:11:40,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:11:40,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:11:40,537 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-09-26 08:11:40,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:40,602 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-09-26 08:11:40,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:11:40,602 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-09-26 08:11:40,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:40,603 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:11:40,603 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:11:40,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:11:40,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:11:40,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-26 08:11:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:11:40,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-09-26 08:11:40,607 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-09-26 08:11:40,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:40,608 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-09-26 08:11:40,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:11:40,608 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-09-26 08:11:40,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:11:40,608 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:40,609 INFO L375 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-09-26 08:11:40,609 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:40,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:40,609 INFO L82 PathProgramCache]: Analyzing trace with hash 940987528, now seen corresponding path program 71 times [2018-09-26 08:11:40,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:40,861 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:40,862 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:11:40,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:11:40,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:11:40,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:11:40,864 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-09-26 08:11:40,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:40,934 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-09-26 08:11:40,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:11:40,935 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-09-26 08:11:40,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:40,936 INFO L225 Difference]: With dead ends: 78 [2018-09-26 08:11:40,936 INFO L226 Difference]: Without dead ends: 76 [2018-09-26 08:11:40,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:11:40,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-26 08:11:40,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-09-26 08:11:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 08:11:40,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-09-26 08:11:40,940 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-09-26 08:11:40,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:40,940 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-09-26 08:11:40,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:11:40,940 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-09-26 08:11:40,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-26 08:11:40,941 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:40,941 INFO L375 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-09-26 08:11:40,941 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:40,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:40,942 INFO L82 PathProgramCache]: Analyzing trace with hash -894159679, now seen corresponding path program 72 times [2018-09-26 08:11:40,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:41,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:41,233 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:41,233 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:11:41,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:11:41,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:11:41,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:11:41,235 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-09-26 08:11:41,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:41,302 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-26 08:11:41,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:11:41,303 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-09-26 08:11:41,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:41,303 INFO L225 Difference]: With dead ends: 79 [2018-09-26 08:11:41,303 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:11:41,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:11:41,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:11:41,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-26 08:11:41,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:11:41,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-26 08:11:41,307 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-09-26 08:11:41,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:41,308 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-26 08:11:41,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:11:41,308 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-26 08:11:41,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:11:41,309 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:41,309 INFO L375 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-09-26 08:11:41,309 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:41,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:41,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1949148248, now seen corresponding path program 73 times [2018-09-26 08:11:41,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:41,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:41,609 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:41,609 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:11:41,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:11:41,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:11:41,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:11:41,611 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-09-26 08:11:41,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:41,678 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-26 08:11:41,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:11:41,679 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-09-26 08:11:41,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:41,679 INFO L225 Difference]: With dead ends: 80 [2018-09-26 08:11:41,680 INFO L226 Difference]: Without dead ends: 78 [2018-09-26 08:11:41,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:11:41,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-26 08:11:41,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-09-26 08:11:41,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-26 08:11:41,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-09-26 08:11:41,683 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-09-26 08:11:41,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:41,683 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-09-26 08:11:41,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:11:41,684 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-09-26 08:11:41,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-26 08:11:41,684 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:41,684 INFO L375 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-09-26 08:11:41,685 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:41,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:41,685 INFO L82 PathProgramCache]: Analyzing trace with hash -294055519, now seen corresponding path program 74 times [2018-09-26 08:11:41,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:41,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:41,929 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:41,929 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:11:41,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:11:41,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:11:41,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:11:41,932 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-09-26 08:11:42,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:42,003 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-09-26 08:11:42,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:11:42,004 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-09-26 08:11:42,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:42,005 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:11:42,005 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:11:42,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:11:42,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:11:42,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-26 08:11:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:11:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-09-26 08:11:42,009 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-09-26 08:11:42,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:42,009 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-09-26 08:11:42,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:11:42,009 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-09-26 08:11:42,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:11:42,010 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:42,010 INFO L375 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-09-26 08:11:42,010 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:42,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:42,011 INFO L82 PathProgramCache]: Analyzing trace with hash -525788472, now seen corresponding path program 75 times [2018-09-26 08:11:42,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:42,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:42,262 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:42,262 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:11:42,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:11:42,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:11:42,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:11:42,264 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-09-26 08:11:42,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:42,332 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-09-26 08:11:42,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:11:42,333 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-09-26 08:11:42,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:42,333 INFO L225 Difference]: With dead ends: 82 [2018-09-26 08:11:42,334 INFO L226 Difference]: Without dead ends: 80 [2018-09-26 08:11:42,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:11:42,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-26 08:11:42,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-26 08:11:42,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-26 08:11:42,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-09-26 08:11:42,337 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-09-26 08:11:42,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:42,338 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-09-26 08:11:42,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:11:42,338 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-09-26 08:11:42,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-26 08:11:42,339 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:42,339 INFO L375 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-09-26 08:11:42,339 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:42,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:42,339 INFO L82 PathProgramCache]: Analyzing trace with hash 880424577, now seen corresponding path program 76 times [2018-09-26 08:11:42,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:42,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:42,619 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:42,619 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:11:42,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:11:42,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:11:42,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:11:42,621 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-09-26 08:11:42,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:42,685 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-26 08:11:42,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:11:42,685 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-09-26 08:11:42,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:42,686 INFO L225 Difference]: With dead ends: 83 [2018-09-26 08:11:42,688 INFO L226 Difference]: Without dead ends: 81 [2018-09-26 08:11:42,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:11:42,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-26 08:11:42,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-26 08:11:42,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:11:42,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-26 08:11:42,692 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-09-26 08:11:42,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:42,693 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-26 08:11:42,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:11:42,693 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-26 08:11:42,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:11:42,694 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:42,694 INFO L375 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-09-26 08:11:42,695 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:42,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:42,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1523356136, now seen corresponding path program 77 times [2018-09-26 08:11:42,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:42,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:42,961 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:42,961 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:11:42,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:11:42,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:11:42,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:11:42,964 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-09-26 08:11:43,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:43,007 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-09-26 08:11:43,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:11:43,008 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-09-26 08:11:43,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:43,009 INFO L225 Difference]: With dead ends: 84 [2018-09-26 08:11:43,009 INFO L226 Difference]: Without dead ends: 82 [2018-09-26 08:11:43,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:11:43,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-26 08:11:43,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-09-26 08:11:43,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-26 08:11:43,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-09-26 08:11:43,013 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-09-26 08:11:43,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:43,013 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-09-26 08:11:43,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:11:43,013 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-09-26 08:11:43,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-26 08:11:43,014 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:43,014 INFO L375 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-09-26 08:11:43,014 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:43,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:43,015 INFO L82 PathProgramCache]: Analyzing trace with hash -20602015, now seen corresponding path program 78 times [2018-09-26 08:11:43,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:43,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:43,278 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:43,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:11:43,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:11:43,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:11:43,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:11:43,280 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-09-26 08:11:43,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:43,342 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-09-26 08:11:43,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:11:43,342 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-09-26 08:11:43,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:43,343 INFO L225 Difference]: With dead ends: 85 [2018-09-26 08:11:43,343 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:11:43,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:11:43,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:11:43,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-26 08:11:43,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:11:43,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-09-26 08:11:43,347 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-09-26 08:11:43,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:43,347 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-09-26 08:11:43,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:11:43,348 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-09-26 08:11:43,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:11:43,348 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:43,348 INFO L375 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-09-26 08:11:43,349 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:43,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:43,349 INFO L82 PathProgramCache]: Analyzing trace with hash -638664440, now seen corresponding path program 79 times [2018-09-26 08:11:43,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:43,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:43,696 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:43,696 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:11:43,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:11:43,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:11:43,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:11:43,699 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-09-26 08:11:43,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:43,789 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-09-26 08:11:43,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:11:43,790 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-09-26 08:11:43,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:43,791 INFO L225 Difference]: With dead ends: 86 [2018-09-26 08:11:43,791 INFO L226 Difference]: Without dead ends: 84 [2018-09-26 08:11:43,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:11:43,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-09-26 08:11:43,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-09-26 08:11:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-26 08:11:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-09-26 08:11:43,796 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-09-26 08:11:43,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:43,796 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-09-26 08:11:43,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:11:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-09-26 08:11:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-26 08:11:43,797 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:43,797 INFO L375 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-09-26 08:11:43,798 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:43,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:43,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1676236865, now seen corresponding path program 80 times [2018-09-26 08:11:43,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:44,107 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:44,107 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:11:44,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:11:44,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:11:44,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:11:44,110 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-09-26 08:11:44,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:44,182 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-26 08:11:44,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:11:44,182 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-09-26 08:11:44,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:44,183 INFO L225 Difference]: With dead ends: 87 [2018-09-26 08:11:44,183 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 08:11:44,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:11:44,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 08:11:44,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 08:11:44,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:11:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-26 08:11:44,188 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-09-26 08:11:44,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:44,188 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-26 08:11:44,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:11:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-26 08:11:44,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:11:44,189 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:44,189 INFO L375 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-09-26 08:11:44,189 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:44,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:44,190 INFO L82 PathProgramCache]: Analyzing trace with hash 423733288, now seen corresponding path program 81 times [2018-09-26 08:11:44,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:44,467 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:44,467 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:11:44,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:11:44,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:11:44,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:11:44,469 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-09-26 08:11:44,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:44,525 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-09-26 08:11:44,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:11:44,525 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-09-26 08:11:44,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:44,526 INFO L225 Difference]: With dead ends: 88 [2018-09-26 08:11:44,526 INFO L226 Difference]: Without dead ends: 86 [2018-09-26 08:11:44,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:11:44,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-26 08:11:44,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-09-26 08:11:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-26 08:11:44,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-26 08:11:44,530 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-09-26 08:11:44,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:44,530 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-26 08:11:44,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:11:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-26 08:11:44,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-26 08:11:44,531 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:44,531 INFO L375 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-09-26 08:11:44,531 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:44,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:44,531 INFO L82 PathProgramCache]: Analyzing trace with hash 250828065, now seen corresponding path program 82 times [2018-09-26 08:11:44,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:44,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:44,794 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:44,794 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:11:44,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:11:44,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:11:44,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:11:44,796 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-09-26 08:11:44,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:44,884 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-09-26 08:11:44,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:11:44,884 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-09-26 08:11:44,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:44,888 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:11:44,888 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:11:44,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:11:44,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:11:44,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-26 08:11:44,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:11:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-09-26 08:11:44,892 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-09-26 08:11:44,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:44,892 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-09-26 08:11:44,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:11:44,893 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-09-26 08:11:44,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:11:44,893 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:44,893 INFO L375 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-09-26 08:11:44,894 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:44,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:44,894 INFO L82 PathProgramCache]: Analyzing trace with hash -814266552, now seen corresponding path program 83 times [2018-09-26 08:11:44,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:45,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:45,187 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:45,187 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:11:45,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:11:45,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:11:45,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:11:45,189 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-09-26 08:11:45,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:45,238 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-26 08:11:45,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:11:45,239 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-09-26 08:11:45,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:45,239 INFO L225 Difference]: With dead ends: 90 [2018-09-26 08:11:45,239 INFO L226 Difference]: Without dead ends: 88 [2018-09-26 08:11:45,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:11:45,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-09-26 08:11:45,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-09-26 08:11:45,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-26 08:11:45,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-09-26 08:11:45,243 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-09-26 08:11:45,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:45,243 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-09-26 08:11:45,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:11:45,244 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-09-26 08:11:45,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-26 08:11:45,244 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:45,244 INFO L375 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-09-26 08:11:45,245 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:45,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:45,245 INFO L82 PathProgramCache]: Analyzing trace with hash 527538689, now seen corresponding path program 84 times [2018-09-26 08:11:45,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:45,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:45,479 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:45,479 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:11:45,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:11:45,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:11:45,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:11:45,480 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-09-26 08:11:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:45,571 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-26 08:11:45,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:11:45,571 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-09-26 08:11:45,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:45,572 INFO L225 Difference]: With dead ends: 91 [2018-09-26 08:11:45,572 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:11:45,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:11:45,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:11:45,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-26 08:11:45,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:11:45,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-26 08:11:45,577 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-09-26 08:11:45,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:45,577 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-26 08:11:45,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:11:45,578 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-26 08:11:45,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:11:45,579 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:45,579 INFO L375 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-09-26 08:11:45,579 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:45,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:45,579 INFO L82 PathProgramCache]: Analyzing trace with hash -826171800, now seen corresponding path program 85 times [2018-09-26 08:11:45,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:45,827 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:45,827 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:11:45,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:11:45,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:11:45,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:11:45,829 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-09-26 08:11:45,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:45,885 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-09-26 08:11:45,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:11:45,886 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-09-26 08:11:45,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:45,886 INFO L225 Difference]: With dead ends: 92 [2018-09-26 08:11:45,887 INFO L226 Difference]: Without dead ends: 90 [2018-09-26 08:11:45,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:11:45,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-26 08:11:45,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-09-26 08:11:45,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-09-26 08:11:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-09-26 08:11:45,891 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-09-26 08:11:45,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:45,891 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-09-26 08:11:45,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:11:45,892 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-09-26 08:11:45,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-26 08:11:45,893 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:45,893 INFO L375 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-09-26 08:11:45,893 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:45,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:45,893 INFO L82 PathProgramCache]: Analyzing trace with hash 158476001, now seen corresponding path program 86 times [2018-09-26 08:11:45,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:46,161 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:46,161 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:11:46,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:11:46,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:11:46,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:11:46,163 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-09-26 08:11:46,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:46,260 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-09-26 08:11:46,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:11:46,260 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-09-26 08:11:46,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:46,261 INFO L225 Difference]: With dead ends: 93 [2018-09-26 08:11:46,261 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:11:46,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:11:46,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:11:46,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-26 08:11:46,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:11:46,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-09-26 08:11:46,265 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-09-26 08:11:46,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:46,265 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-09-26 08:11:46,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:11:46,266 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-09-26 08:11:46,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:11:46,266 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:46,266 INFO L375 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-09-26 08:11:46,267 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:46,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:46,267 INFO L82 PathProgramCache]: Analyzing trace with hash 617786760, now seen corresponding path program 87 times [2018-09-26 08:11:46,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:46,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:46,548 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:46,548 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:11:46,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:11:46,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:11:46,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:11:46,550 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-09-26 08:11:46,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:46,600 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-09-26 08:11:46,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:11:46,600 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-09-26 08:11:46,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:46,601 INFO L225 Difference]: With dead ends: 94 [2018-09-26 08:11:46,601 INFO L226 Difference]: Without dead ends: 92 [2018-09-26 08:11:46,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:11:46,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-09-26 08:11:46,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-09-26 08:11:46,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-26 08:11:46,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-09-26 08:11:46,605 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-09-26 08:11:46,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:46,605 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-09-26 08:11:46,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:11:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-09-26 08:11:46,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-26 08:11:46,606 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:46,606 INFO L375 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-09-26 08:11:46,606 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:46,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:46,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1971518401, now seen corresponding path program 88 times [2018-09-26 08:11:46,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:46,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:46,836 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:46,836 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:11:46,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:11:46,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:11:46,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:11:46,838 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-09-26 08:11:46,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:46,938 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-26 08:11:46,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:11:46,939 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-09-26 08:11:46,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:46,940 INFO L225 Difference]: With dead ends: 95 [2018-09-26 08:11:46,940 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 08:11:46,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:11:46,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 08:11:46,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-26 08:11:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:11:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-26 08:11:46,943 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-09-26 08:11:46,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:46,944 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-26 08:11:46,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:11:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-26 08:11:46,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 08:11:46,944 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:46,945 INFO L375 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-09-26 08:11:46,945 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:46,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:46,945 INFO L82 PathProgramCache]: Analyzing trace with hash 987526312, now seen corresponding path program 89 times [2018-09-26 08:11:46,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:47,230 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:47,230 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:11:47,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:11:47,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:11:47,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:11:47,231 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-09-26 08:11:47,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:47,286 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-09-26 08:11:47,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:11:47,286 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-09-26 08:11:47,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:47,287 INFO L225 Difference]: With dead ends: 96 [2018-09-26 08:11:47,287 INFO L226 Difference]: Without dead ends: 94 [2018-09-26 08:11:47,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:11:47,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-26 08:11:47,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-09-26 08:11:47,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-26 08:11:47,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-09-26 08:11:47,291 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-09-26 08:11:47,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:47,291 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-09-26 08:11:47,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:11:47,292 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-09-26 08:11:47,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-09-26 08:11:47,292 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:47,292 INFO L375 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-09-26 08:11:47,292 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:47,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:47,293 INFO L82 PathProgramCache]: Analyzing trace with hash 548542625, now seen corresponding path program 90 times [2018-09-26 08:11:47,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:47,618 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:47,618 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:11:47,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:11:47,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:11:47,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:11:47,620 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-09-26 08:11:47,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:47,679 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-09-26 08:11:47,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:11:47,679 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-09-26 08:11:47,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:47,680 INFO L225 Difference]: With dead ends: 97 [2018-09-26 08:11:47,681 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 08:11:47,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:11:47,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 08:11:47,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-26 08:11:47,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:11:47,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-09-26 08:11:47,684 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-09-26 08:11:47,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:47,685 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-09-26 08:11:47,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:11:47,685 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-09-26 08:11:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:11:47,686 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:47,686 INFO L375 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-09-26 08:11:47,686 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:47,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:47,687 INFO L82 PathProgramCache]: Analyzing trace with hash -175049784, now seen corresponding path program 91 times [2018-09-26 08:11:47,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:48,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:48,033 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:48,033 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:11:48,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:11:48,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:11:48,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:11:48,035 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-09-26 08:11:48,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:48,162 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-09-26 08:11:48,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:11:48,162 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-09-26 08:11:48,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:48,163 INFO L225 Difference]: With dead ends: 98 [2018-09-26 08:11:48,163 INFO L226 Difference]: Without dead ends: 96 [2018-09-26 08:11:48,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:11:48,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-26 08:11:48,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-09-26 08:11:48,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-26 08:11:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-09-26 08:11:48,167 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-09-26 08:11:48,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:48,167 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-09-26 08:11:48,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:11:48,168 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-09-26 08:11:48,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-26 08:11:48,168 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:48,168 INFO L375 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-09-26 08:11:48,169 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:48,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:48,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1131577983, now seen corresponding path program 92 times [2018-09-26 08:11:48,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:48,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:48,621 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:48,621 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:11:48,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:11:48,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:11:48,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:11:48,624 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-09-26 08:11:48,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:48,774 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-26 08:11:48,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:11:48,774 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-09-26 08:11:48,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:48,775 INFO L225 Difference]: With dead ends: 99 [2018-09-26 08:11:48,775 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 08:11:48,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:11:48,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 08:11:48,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-26 08:11:48,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 08:11:48,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-26 08:11:48,781 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-09-26 08:11:48,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:48,781 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-26 08:11:48,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:11:48,781 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-26 08:11:48,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:11:48,782 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:48,782 INFO L375 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-09-26 08:11:48,783 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:48,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:48,783 INFO L82 PathProgramCache]: Analyzing trace with hash -719181080, now seen corresponding path program 93 times [2018-09-26 08:11:48,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:49,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:49,197 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:49,197 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:11:49,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:11:49,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:11:49,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:11:49,199 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-09-26 08:11:49,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:49,290 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-26 08:11:49,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:11:49,290 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-09-26 08:11:49,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:49,291 INFO L225 Difference]: With dead ends: 100 [2018-09-26 08:11:49,291 INFO L226 Difference]: Without dead ends: 98 [2018-09-26 08:11:49,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:11:49,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-26 08:11:49,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-09-26 08:11:49,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-26 08:11:49,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-09-26 08:11:49,294 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-09-26 08:11:49,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:49,295 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-09-26 08:11:49,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:11:49,295 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-09-26 08:11:49,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-26 08:11:49,295 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:49,296 INFO L375 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-09-26 08:11:49,296 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:49,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:49,296 INFO L82 PathProgramCache]: Analyzing trace with hash -819778975, now seen corresponding path program 94 times [2018-09-26 08:11:49,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:49,535 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:49,535 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:11:49,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:11:49,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:11:49,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:11:49,537 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-09-26 08:11:49,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:49,586 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-09-26 08:11:49,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:11:49,586 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-09-26 08:11:49,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:49,587 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:11:49,587 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:11:49,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:11:49,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:11:49,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-26 08:11:49,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:11:49,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-09-26 08:11:49,591 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-09-26 08:11:49,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:49,591 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-09-26 08:11:49,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:11:49,592 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-09-26 08:11:49,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:11:49,592 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:49,592 INFO L375 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-09-26 08:11:49,593 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:49,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:49,593 INFO L82 PathProgramCache]: Analyzing trace with hash 356653576, now seen corresponding path program 95 times [2018-09-26 08:11:49,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:49,975 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:49,975 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:11:49,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:11:49,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:11:49,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:11:49,979 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-09-26 08:11:50,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:50,052 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-09-26 08:11:50,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:11:50,052 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-09-26 08:11:50,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:50,054 INFO L225 Difference]: With dead ends: 102 [2018-09-26 08:11:50,054 INFO L226 Difference]: Without dead ends: 100 [2018-09-26 08:11:50,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:11:50,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-26 08:11:50,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-09-26 08:11:50,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-26 08:11:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-09-26 08:11:50,059 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-09-26 08:11:50,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:50,061 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-09-26 08:11:50,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:11:50,061 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-09-26 08:11:50,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-26 08:11:50,062 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:50,062 INFO L375 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-09-26 08:11:50,062 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:50,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:50,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1828643007, now seen corresponding path program 96 times [2018-09-26 08:11:50,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:50,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:50,440 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:50,440 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:11:50,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:11:50,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:11:50,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:11:50,443 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-09-26 08:11:50,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:50,526 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-26 08:11:50,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:11:50,527 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-09-26 08:11:50,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:50,528 INFO L225 Difference]: With dead ends: 103 [2018-09-26 08:11:50,528 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 08:11:50,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:11:50,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 08:11:50,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-09-26 08:11:50,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:11:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-26 08:11:50,532 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-09-26 08:11:50,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:50,532 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-26 08:11:50,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:11:50,532 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-26 08:11:50,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:11:50,533 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:50,533 INFO L375 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-09-26 08:11:50,533 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:50,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:50,533 INFO L82 PathProgramCache]: Analyzing trace with hash -853360344, now seen corresponding path program 97 times [2018-09-26 08:11:50,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:50,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:50,856 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:50,856 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:11:50,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:11:50,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:11:50,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:11:50,858 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-09-26 08:11:50,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:50,928 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-09-26 08:11:50,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:11:50,928 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-09-26 08:11:50,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:50,929 INFO L225 Difference]: With dead ends: 104 [2018-09-26 08:11:50,929 INFO L226 Difference]: Without dead ends: 102 [2018-09-26 08:11:50,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:11:50,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-26 08:11:50,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-09-26 08:11:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-26 08:11:50,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-09-26 08:11:50,932 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-09-26 08:11:50,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:50,932 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-09-26 08:11:50,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:11:50,933 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-09-26 08:11:50,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-26 08:11:50,933 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:50,933 INFO L375 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-09-26 08:11:50,934 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:50,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:50,934 INFO L82 PathProgramCache]: Analyzing trace with hash -684368863, now seen corresponding path program 98 times [2018-09-26 08:11:50,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:51,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:51,244 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:51,244 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:11:51,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:11:51,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:11:51,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:11:51,246 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-09-26 08:11:51,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:51,331 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-09-26 08:11:51,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:11:51,331 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-09-26 08:11:51,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:51,332 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:11:51,332 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:11:51,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:11:51,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:11:51,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-26 08:11:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 08:11:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-09-26 08:11:51,335 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-09-26 08:11:51,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:51,336 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-09-26 08:11:51,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:11:51,336 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-09-26 08:11:51,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:11:51,336 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:51,336 INFO L375 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-09-26 08:11:51,337 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:51,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:51,337 INFO L82 PathProgramCache]: Analyzing trace with hash 259399752, now seen corresponding path program 99 times [2018-09-26 08:11:51,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:51,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:51,578 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:51,578 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:11:51,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:11:51,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:11:51,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:11:51,580 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-09-26 08:11:51,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:51,648 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-09-26 08:11:51,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:11:51,648 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-09-26 08:11:51,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:51,649 INFO L225 Difference]: With dead ends: 106 [2018-09-26 08:11:51,649 INFO L226 Difference]: Without dead ends: 104 [2018-09-26 08:11:51,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:11:51,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-26 08:11:51,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-09-26 08:11:51,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-26 08:11:51,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-09-26 08:11:51,652 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-09-26 08:11:51,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:51,652 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-09-26 08:11:51,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:11:51,653 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-09-26 08:11:51,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-26 08:11:51,653 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:51,653 INFO L375 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-09-26 08:11:51,653 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:51,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:51,653 INFO L82 PathProgramCache]: Analyzing trace with hash -548544255, now seen corresponding path program 100 times [2018-09-26 08:11:51,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:51,939 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:51,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:11:51,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:11:51,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:11:51,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:11:51,941 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-09-26 08:11:52,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:52,000 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-09-26 08:11:52,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:11:52,001 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-09-26 08:11:52,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:52,001 INFO L225 Difference]: With dead ends: 107 [2018-09-26 08:11:52,002 INFO L226 Difference]: Without dead ends: 105 [2018-09-26 08:11:52,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:11:52,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-26 08:11:52,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-09-26 08:11:52,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 08:11:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-26 08:11:52,006 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-09-26 08:11:52,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:52,006 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-26 08:11:52,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:11:52,007 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-26 08:11:52,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 08:11:52,007 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:52,007 INFO L375 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-09-26 08:11:52,007 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:52,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:52,008 INFO L82 PathProgramCache]: Analyzing trace with hash 174995304, now seen corresponding path program 101 times [2018-09-26 08:11:52,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:52,263 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:52,263 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:52,263 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:11:52,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:11:52,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:11:52,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:11:52,265 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-09-26 08:11:52,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:52,340 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-09-26 08:11:52,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:11:52,340 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-09-26 08:11:52,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:52,341 INFO L225 Difference]: With dead ends: 108 [2018-09-26 08:11:52,342 INFO L226 Difference]: Without dead ends: 106 [2018-09-26 08:11:52,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:11:52,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-26 08:11:52,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-09-26 08:11:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-26 08:11:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-09-26 08:11:52,346 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-09-26 08:11:52,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:52,346 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-09-26 08:11:52,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:11:52,346 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-09-26 08:11:52,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-26 08:11:52,347 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:52,347 INFO L375 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-09-26 08:11:52,347 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:52,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:52,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1129885153, now seen corresponding path program 102 times [2018-09-26 08:11:52,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:52,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:52,582 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:52,582 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-09-26 08:11:52,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:11:52,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:11:52,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:11:52,584 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-09-26 08:11:52,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:52,670 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-09-26 08:11:52,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-26 08:11:52,671 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-09-26 08:11:52,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:52,671 INFO L225 Difference]: With dead ends: 109 [2018-09-26 08:11:52,672 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 08:11:52,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:11:52,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 08:11:52,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-26 08:11:52,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 08:11:52,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-09-26 08:11:52,676 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-09-26 08:11:52,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:52,676 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-09-26 08:11:52,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-26 08:11:52,677 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-09-26 08:11:52,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:11:52,677 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:52,678 INFO L375 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-09-26 08:11:52,678 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:52,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:52,678 INFO L82 PathProgramCache]: Analyzing trace with hash 666699400, now seen corresponding path program 103 times [2018-09-26 08:11:52,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:53,017 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:53,017 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:11:53,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:11:53,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:11:53,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:11:53,019 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-09-26 08:11:53,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:53,141 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-09-26 08:11:53,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:11:53,142 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-09-26 08:11:53,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:53,143 INFO L225 Difference]: With dead ends: 110 [2018-09-26 08:11:53,143 INFO L226 Difference]: Without dead ends: 108 [2018-09-26 08:11:53,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:11:53,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-09-26 08:11:53,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-09-26 08:11:53,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-09-26 08:11:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-09-26 08:11:53,147 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-09-26 08:11:53,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:53,147 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-09-26 08:11:53,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:11:53,148 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-09-26 08:11:53,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-26 08:11:53,148 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:53,148 INFO L375 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-09-26 08:11:53,149 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:53,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:53,149 INFO L82 PathProgramCache]: Analyzing trace with hash -807157055, now seen corresponding path program 104 times [2018-09-26 08:11:53,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:53,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:53,506 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:53,506 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-09-26 08:11:53,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-09-26 08:11:53,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-09-26 08:11:53,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:11:53,508 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-09-26 08:11:53,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:53,594 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-26 08:11:53,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-26 08:11:53,594 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-09-26 08:11:53,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:53,595 INFO L225 Difference]: With dead ends: 111 [2018-09-26 08:11:53,595 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 08:11:53,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:11:53,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 08:11:53,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-26 08:11:53,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 08:11:53,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-09-26 08:11:53,599 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-09-26 08:11:53,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:53,599 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-09-26 08:11:53,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-09-26 08:11:53,599 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-09-26 08:11:53,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 08:11:53,600 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:53,600 INFO L375 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-09-26 08:11:53,600 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:53,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:53,601 INFO L82 PathProgramCache]: Analyzing trace with hash 747933096, now seen corresponding path program 105 times [2018-09-26 08:11:53,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:53,854 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:53,854 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:53,854 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:11:53,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:11:53,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:11:53,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:11:53,856 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-09-26 08:11:53,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:53,927 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-09-26 08:11:53,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:11:53,927 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-09-26 08:11:53,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:53,928 INFO L225 Difference]: With dead ends: 112 [2018-09-26 08:11:53,928 INFO L226 Difference]: Without dead ends: 110 [2018-09-26 08:11:53,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:11:53,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-26 08:11:53,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-09-26 08:11:53,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-09-26 08:11:53,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-09-26 08:11:53,932 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-09-26 08:11:53,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:53,933 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-09-26 08:11:53,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:11:53,933 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-09-26 08:11:53,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-09-26 08:11:53,933 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:53,934 INFO L375 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-09-26 08:11:53,934 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:53,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:53,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1711087521, now seen corresponding path program 106 times [2018-09-26 08:11:53,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:54,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:54,196 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:54,196 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-09-26 08:11:54,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-26 08:11:54,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-26 08:11:54,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:11:54,197 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-09-26 08:11:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:54,284 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-09-26 08:11:54,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-09-26 08:11:54,284 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-09-26 08:11:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:54,285 INFO L225 Difference]: With dead ends: 113 [2018-09-26 08:11:54,285 INFO L226 Difference]: Without dead ends: 111 [2018-09-26 08:11:54,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:11:54,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-26 08:11:54,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-09-26 08:11:54,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 08:11:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-09-26 08:11:54,290 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-09-26 08:11:54,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:54,290 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-09-26 08:11:54,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-09-26 08:11:54,290 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-09-26 08:11:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 08:11:54,291 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:54,291 INFO L375 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-09-26 08:11:54,291 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:54,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:54,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1504103624, now seen corresponding path program 107 times [2018-09-26 08:11:54,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:54,549 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:54,549 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:11:54,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:11:54,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:11:54,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:11:54,551 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-09-26 08:11:54,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:54,665 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-09-26 08:11:54,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:11:54,665 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-09-26 08:11:54,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:54,666 INFO L225 Difference]: With dead ends: 114 [2018-09-26 08:11:54,666 INFO L226 Difference]: Without dead ends: 112 [2018-09-26 08:11:54,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:11:54,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-09-26 08:11:54,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-09-26 08:11:54,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-26 08:11:54,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-09-26 08:11:54,671 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-09-26 08:11:54,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:54,672 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-09-26 08:11:54,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:11:54,672 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-09-26 08:11:54,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-26 08:11:54,674 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:54,674 INFO L375 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-09-26 08:11:54,674 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:54,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:54,676 INFO L82 PathProgramCache]: Analyzing trace with hash -617429887, now seen corresponding path program 108 times [2018-09-26 08:11:54,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:54,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:54,985 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:54,985 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-09-26 08:11:54,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-09-26 08:11:54,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-09-26 08:11:54,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:11:54,988 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-09-26 08:11:55,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:55,064 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-26 08:11:55,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-26 08:11:55,064 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-09-26 08:11:55,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:55,065 INFO L225 Difference]: With dead ends: 115 [2018-09-26 08:11:55,065 INFO L226 Difference]: Without dead ends: 113 [2018-09-26 08:11:55,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:11:55,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-26 08:11:55,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-26 08:11:55,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 08:11:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-26 08:11:55,068 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-09-26 08:11:55,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:55,069 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-26 08:11:55,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-09-26 08:11:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-26 08:11:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 08:11:55,070 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:55,070 INFO L375 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-09-26 08:11:55,070 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:55,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:55,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1960459288, now seen corresponding path program 109 times [2018-09-26 08:11:55,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:55,387 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:55,387 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:11:55,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:11:55,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:11:55,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:11:55,389 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-09-26 08:11:55,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:55,506 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-09-26 08:11:55,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-09-26 08:11:55,507 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-09-26 08:11:55,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:55,508 INFO L225 Difference]: With dead ends: 116 [2018-09-26 08:11:55,508 INFO L226 Difference]: Without dead ends: 114 [2018-09-26 08:11:55,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:11:55,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-26 08:11:55,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-09-26 08:11:55,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-09-26 08:11:55,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-09-26 08:11:55,512 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-09-26 08:11:55,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:55,512 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-09-26 08:11:55,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:11:55,513 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-09-26 08:11:55,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-09-26 08:11:55,513 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:55,513 INFO L375 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-09-26 08:11:55,514 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:55,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:55,514 INFO L82 PathProgramCache]: Analyzing trace with hash -644697759, now seen corresponding path program 110 times [2018-09-26 08:11:55,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:55,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:55,869 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:55,869 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-09-26 08:11:55,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-09-26 08:11:55,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-09-26 08:11:55,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:11:55,871 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2018-09-26 08:11:55,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:55,953 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-09-26 08:11:55,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 08:11:55,953 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2018-09-26 08:11:55,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:55,954 INFO L225 Difference]: With dead ends: 117 [2018-09-26 08:11:55,954 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 08:11:55,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:11:55,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 08:11:55,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-26 08:11:55,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 08:11:55,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-09-26 08:11:55,958 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-09-26 08:11:55,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:55,959 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-09-26 08:11:55,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-09-26 08:11:55,959 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-09-26 08:11:55,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-26 08:11:55,960 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:55,960 INFO L375 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2018-09-26 08:11:55,960 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:55,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:55,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1489203976, now seen corresponding path program 111 times [2018-09-26 08:11:55,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:56,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:56,458 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:56,458 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:11:56,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:11:56,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:11:56,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:11:56,461 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2018-09-26 08:11:56,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:56,619 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-09-26 08:11:56,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-26 08:11:56,619 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2018-09-26 08:11:56,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:56,620 INFO L225 Difference]: With dead ends: 118 [2018-09-26 08:11:56,620 INFO L226 Difference]: Without dead ends: 116 [2018-09-26 08:11:56,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:11:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-09-26 08:11:56,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-09-26 08:11:56,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-09-26 08:11:56,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-09-26 08:11:56,624 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-09-26 08:11:56,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:56,625 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-09-26 08:11:56,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:11:56,625 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-09-26 08:11:56,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-26 08:11:56,625 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:56,626 INFO L375 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2018-09-26 08:11:56,626 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:56,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:56,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1079318975, now seen corresponding path program 112 times [2018-09-26 08:11:56,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:56,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:56,921 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:56,921 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-09-26 08:11:56,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-09-26 08:11:56,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-09-26 08:11:56,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:11:56,923 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2018-09-26 08:11:57,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:57,030 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-09-26 08:11:57,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-09-26 08:11:57,030 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2018-09-26 08:11:57,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:57,031 INFO L225 Difference]: With dead ends: 119 [2018-09-26 08:11:57,031 INFO L226 Difference]: Without dead ends: 117 [2018-09-26 08:11:57,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:11:57,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-26 08:11:57,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-09-26 08:11:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-26 08:11:57,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-26 08:11:57,034 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2018-09-26 08:11:57,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:57,035 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-26 08:11:57,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-09-26 08:11:57,035 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-26 08:11:57,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-26 08:11:57,035 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:57,036 INFO L375 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2018-09-26 08:11:57,036 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:57,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:57,036 INFO L82 PathProgramCache]: Analyzing trace with hash 900848168, now seen corresponding path program 113 times [2018-09-26 08:11:57,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:57,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:57,346 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:57,346 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:11:57,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:11:57,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:11:57,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:11:57,347 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2018-09-26 08:11:57,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:57,469 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-09-26 08:11:57,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:11:57,469 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2018-09-26 08:11:57,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:57,470 INFO L225 Difference]: With dead ends: 120 [2018-09-26 08:11:57,470 INFO L226 Difference]: Without dead ends: 118 [2018-09-26 08:11:57,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:11:57,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-09-26 08:11:57,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-09-26 08:11:57,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-26 08:11:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-09-26 08:11:57,474 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2018-09-26 08:11:57,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:57,474 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-09-26 08:11:57,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:11:57,475 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-09-26 08:11:57,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-09-26 08:11:57,475 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:57,475 INFO L375 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2018-09-26 08:11:57,476 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:57,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:57,476 INFO L82 PathProgramCache]: Analyzing trace with hash -2138479839, now seen corresponding path program 114 times [2018-09-26 08:11:57,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:57,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:57,821 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:57,821 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-09-26 08:11:57,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-09-26 08:11:57,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-09-26 08:11:57,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:11:57,824 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 117 states. [2018-09-26 08:11:57,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:57,920 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-09-26 08:11:57,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-09-26 08:11:57,920 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 117 [2018-09-26 08:11:57,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:57,921 INFO L225 Difference]: With dead ends: 121 [2018-09-26 08:11:57,921 INFO L226 Difference]: Without dead ends: 119 [2018-09-26 08:11:57,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:11:57,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-26 08:11:57,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-26 08:11:57,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-26 08:11:57,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-09-26 08:11:57,925 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2018-09-26 08:11:57,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:57,925 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-09-26 08:11:57,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-09-26 08:11:57,926 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-09-26 08:11:57,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-26 08:11:57,927 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:57,927 INFO L375 BasicCegarLoop]: trace histogram [115, 1, 1, 1] [2018-09-26 08:11:57,927 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:57,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:57,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1868367544, now seen corresponding path program 115 times [2018-09-26 08:11:57,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:58,535 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:58,535 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-09-26 08:11:58,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 08:11:58,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 08:11:58,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:11:58,539 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 118 states. [2018-09-26 08:11:58,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:58,671 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-09-26 08:11:58,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-09-26 08:11:58,672 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 118 [2018-09-26 08:11:58,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:58,672 INFO L225 Difference]: With dead ends: 122 [2018-09-26 08:11:58,672 INFO L226 Difference]: Without dead ends: 120 [2018-09-26 08:11:58,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:11:58,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-09-26 08:11:58,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-09-26 08:11:58,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-09-26 08:11:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-09-26 08:11:58,677 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2018-09-26 08:11:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:58,677 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-09-26 08:11:58,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 08:11:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-09-26 08:11:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-09-26 08:11:58,678 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:58,678 INFO L375 BasicCegarLoop]: trace histogram [116, 1, 1, 1] [2018-09-26 08:11:58,678 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:58,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:58,679 INFO L82 PathProgramCache]: Analyzing trace with hash -2084820991, now seen corresponding path program 116 times [2018-09-26 08:11:58,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:58,979 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:58,980 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-09-26 08:11:58,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-09-26 08:11:58,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-09-26 08:11:58,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:11:58,981 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 119 states. [2018-09-26 08:11:59,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:59,106 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-09-26 08:11:59,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-09-26 08:11:59,106 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 119 [2018-09-26 08:11:59,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:59,107 INFO L225 Difference]: With dead ends: 123 [2018-09-26 08:11:59,107 INFO L226 Difference]: Without dead ends: 121 [2018-09-26 08:11:59,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:11:59,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-09-26 08:11:59,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-09-26 08:11:59,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 08:11:59,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-26 08:11:59,111 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2018-09-26 08:11:59,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:59,112 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-26 08:11:59,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-09-26 08:11:59,112 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-26 08:11:59,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-26 08:11:59,113 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:59,113 INFO L375 BasicCegarLoop]: trace histogram [117, 1, 1, 1] [2018-09-26 08:11:59,113 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:59,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:59,113 INFO L82 PathProgramCache]: Analyzing trace with hash -204943256, now seen corresponding path program 117 times [2018-09-26 08:11:59,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:59,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:59,419 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:59,419 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-09-26 08:11:59,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-26 08:11:59,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-26 08:11:59,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:11:59,420 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 120 states. [2018-09-26 08:11:59,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:59,539 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-09-26 08:11:59,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-09-26 08:11:59,539 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 120 [2018-09-26 08:11:59,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:59,540 INFO L225 Difference]: With dead ends: 124 [2018-09-26 08:11:59,540 INFO L226 Difference]: Without dead ends: 122 [2018-09-26 08:11:59,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:11:59,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-26 08:11:59,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-09-26 08:11:59,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-09-26 08:11:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-09-26 08:11:59,544 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2018-09-26 08:11:59,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:59,544 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-09-26 08:11:59,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-26 08:11:59,545 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-09-26 08:11:59,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-26 08:11:59,545 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:59,545 INFO L375 BasicCegarLoop]: trace histogram [118, 1, 1, 1] [2018-09-26 08:11:59,546 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:59,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:59,546 INFO L82 PathProgramCache]: Analyzing trace with hash -2058275615, now seen corresponding path program 118 times [2018-09-26 08:11:59,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:11:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:11:59,868 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:11:59,868 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:11:59,868 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-09-26 08:11:59,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-09-26 08:11:59,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-09-26 08:11:59,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:11:59,870 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 121 states. [2018-09-26 08:11:59,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:11:59,980 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-09-26 08:11:59,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-09-26 08:11:59,980 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 121 [2018-09-26 08:11:59,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:11:59,981 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:11:59,981 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:11:59,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:11:59,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:11:59,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-09-26 08:11:59,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-26 08:11:59,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-09-26 08:11:59,985 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 121 [2018-09-26 08:11:59,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:11:59,985 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-09-26 08:11:59,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-09-26 08:11:59,986 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-09-26 08:11:59,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-26 08:11:59,986 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:11:59,986 INFO L375 BasicCegarLoop]: trace histogram [119, 1, 1, 1] [2018-09-26 08:11:59,987 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:11:59,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:11:59,987 INFO L82 PathProgramCache]: Analyzing trace with hash 617963400, now seen corresponding path program 119 times [2018-09-26 08:11:59,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:00,301 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:00,301 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:00,301 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-09-26 08:12:00,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-26 08:12:00,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-26 08:12:00,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:12:00,303 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 122 states. [2018-09-26 08:12:00,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:00,364 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-09-26 08:12:00,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-09-26 08:12:00,364 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 122 [2018-09-26 08:12:00,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:00,365 INFO L225 Difference]: With dead ends: 126 [2018-09-26 08:12:00,365 INFO L226 Difference]: Without dead ends: 124 [2018-09-26 08:12:00,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:12:00,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-09-26 08:12:00,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-09-26 08:12:00,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-09-26 08:12:00,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-09-26 08:12:00,369 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 122 [2018-09-26 08:12:00,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:00,370 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-09-26 08:12:00,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-26 08:12:00,370 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-09-26 08:12:00,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-26 08:12:00,370 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:00,371 INFO L375 BasicCegarLoop]: trace histogram [120, 1, 1, 1] [2018-09-26 08:12:00,371 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:00,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:00,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1976994241, now seen corresponding path program 120 times [2018-09-26 08:12:00,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:00,725 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:00,725 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:00,726 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-09-26 08:12:00,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-09-26 08:12:00,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-09-26 08:12:00,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:12:00,728 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 123 states. [2018-09-26 08:12:00,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:00,869 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-09-26 08:12:00,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-26 08:12:00,869 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 123 [2018-09-26 08:12:00,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:00,869 INFO L225 Difference]: With dead ends: 127 [2018-09-26 08:12:00,869 INFO L226 Difference]: Without dead ends: 125 [2018-09-26 08:12:00,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:12:00,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-26 08:12:00,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-09-26 08:12:00,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-26 08:12:00,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-09-26 08:12:00,873 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 123 [2018-09-26 08:12:00,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:00,873 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-09-26 08:12:00,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-09-26 08:12:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-09-26 08:12:00,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 08:12:00,874 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:00,874 INFO L375 BasicCegarLoop]: trace histogram [121, 1, 1, 1] [2018-09-26 08:12:00,875 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:00,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:00,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1157277352, now seen corresponding path program 121 times [2018-09-26 08:12:00,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:01,198 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:01,198 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:01,198 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-09-26 08:12:01,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-26 08:12:01,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-26 08:12:01,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:12:01,200 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 124 states. [2018-09-26 08:12:01,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:01,330 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-09-26 08:12:01,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-09-26 08:12:01,331 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 124 [2018-09-26 08:12:01,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:01,331 INFO L225 Difference]: With dead ends: 128 [2018-09-26 08:12:01,331 INFO L226 Difference]: Without dead ends: 126 [2018-09-26 08:12:01,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:12:01,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-09-26 08:12:01,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-09-26 08:12:01,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-09-26 08:12:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-09-26 08:12:01,336 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 124 [2018-09-26 08:12:01,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:01,336 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-09-26 08:12:01,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-26 08:12:01,336 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-09-26 08:12:01,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-09-26 08:12:01,337 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:01,337 INFO L375 BasicCegarLoop]: trace histogram [122, 1, 1, 1] [2018-09-26 08:12:01,337 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:01,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:01,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1515857569, now seen corresponding path program 122 times [2018-09-26 08:12:01,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:01,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:01,679 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:01,679 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-09-26 08:12:01,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-09-26 08:12:01,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-09-26 08:12:01,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:12:01,682 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 125 states. [2018-09-26 08:12:01,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:01,849 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-09-26 08:12:01,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-09-26 08:12:01,850 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 125 [2018-09-26 08:12:01,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:01,850 INFO L225 Difference]: With dead ends: 129 [2018-09-26 08:12:01,850 INFO L226 Difference]: Without dead ends: 127 [2018-09-26 08:12:01,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:12:01,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-26 08:12:01,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-26 08:12:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-26 08:12:01,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-09-26 08:12:01,853 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 125 [2018-09-26 08:12:01,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:01,853 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-09-26 08:12:01,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-09-26 08:12:01,853 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-09-26 08:12:01,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-26 08:12:01,854 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:01,854 INFO L375 BasicCegarLoop]: trace histogram [123, 1, 1, 1] [2018-09-26 08:12:01,854 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:01,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:01,854 INFO L82 PathProgramCache]: Analyzing trace with hash -253057592, now seen corresponding path program 123 times [2018-09-26 08:12:01,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:02,190 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:02,190 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-09-26 08:12:02,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-26 08:12:02,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-26 08:12:02,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:12:02,192 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 126 states. [2018-09-26 08:12:02,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:02,313 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-09-26 08:12:02,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-09-26 08:12:02,313 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 126 [2018-09-26 08:12:02,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:02,314 INFO L225 Difference]: With dead ends: 130 [2018-09-26 08:12:02,314 INFO L226 Difference]: Without dead ends: 128 [2018-09-26 08:12:02,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:12:02,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-09-26 08:12:02,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-09-26 08:12:02,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-09-26 08:12:02,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-09-26 08:12:02,317 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 126 [2018-09-26 08:12:02,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:02,317 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-09-26 08:12:02,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-26 08:12:02,317 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-09-26 08:12:02,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-09-26 08:12:02,319 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:02,320 INFO L375 BasicCegarLoop]: trace histogram [124, 1, 1, 1] [2018-09-26 08:12:02,320 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:02,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:02,320 INFO L82 PathProgramCache]: Analyzing trace with hash 745147265, now seen corresponding path program 124 times [2018-09-26 08:12:02,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:02,709 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:02,710 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:02,710 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-09-26 08:12:02,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-09-26 08:12:02,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-09-26 08:12:02,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:12:02,713 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 127 states. [2018-09-26 08:12:02,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:02,903 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-09-26 08:12:02,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-09-26 08:12:02,904 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 127 [2018-09-26 08:12:02,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:02,904 INFO L225 Difference]: With dead ends: 131 [2018-09-26 08:12:02,904 INFO L226 Difference]: Without dead ends: 129 [2018-09-26 08:12:02,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:12:02,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-26 08:12:02,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-09-26 08:12:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 08:12:02,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-09-26 08:12:02,909 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 127 [2018-09-26 08:12:02,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:02,910 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-09-26 08:12:02,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-09-26 08:12:02,910 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-09-26 08:12:02,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-26 08:12:02,911 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:02,911 INFO L375 BasicCegarLoop]: trace histogram [125, 1, 1, 1] [2018-09-26 08:12:02,911 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:02,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:02,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1624726760, now seen corresponding path program 125 times [2018-09-26 08:12:02,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:03,299 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:03,299 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:03,300 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-09-26 08:12:03,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-26 08:12:03,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-26 08:12:03,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:12:03,302 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 128 states. [2018-09-26 08:12:03,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:03,403 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-09-26 08:12:03,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-09-26 08:12:03,403 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 128 [2018-09-26 08:12:03,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:03,404 INFO L225 Difference]: With dead ends: 132 [2018-09-26 08:12:03,404 INFO L226 Difference]: Without dead ends: 130 [2018-09-26 08:12:03,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:12:03,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-26 08:12:03,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-09-26 08:12:03,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-09-26 08:12:03,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-09-26 08:12:03,407 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 128 [2018-09-26 08:12:03,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:03,408 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-09-26 08:12:03,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-26 08:12:03,408 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-09-26 08:12:03,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-09-26 08:12:03,408 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:03,409 INFO L375 BasicCegarLoop]: trace histogram [126, 1, 1, 1] [2018-09-26 08:12:03,409 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:03,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:03,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1173079967, now seen corresponding path program 126 times [2018-09-26 08:12:03,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:04,013 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:04,013 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-09-26 08:12:04,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-09-26 08:12:04,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-09-26 08:12:04,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:12:04,016 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 129 states. [2018-09-26 08:12:04,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:04,264 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-09-26 08:12:04,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-09-26 08:12:04,264 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 129 [2018-09-26 08:12:04,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:04,264 INFO L225 Difference]: With dead ends: 133 [2018-09-26 08:12:04,264 INFO L226 Difference]: Without dead ends: 131 [2018-09-26 08:12:04,265 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:12:04,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-26 08:12:04,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-26 08:12:04,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 08:12:04,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-09-26 08:12:04,267 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 129 [2018-09-26 08:12:04,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:04,267 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-09-26 08:12:04,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-09-26 08:12:04,268 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-09-26 08:12:04,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 08:12:04,268 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:04,268 INFO L375 BasicCegarLoop]: trace histogram [127, 1, 1, 1] [2018-09-26 08:12:04,268 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:04,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:04,269 INFO L82 PathProgramCache]: Analyzing trace with hash -2005742584, now seen corresponding path program 127 times [2018-09-26 08:12:04,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:04,621 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:04,621 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:04,622 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-09-26 08:12:04,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-26 08:12:04,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-26 08:12:04,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:12:04,625 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 130 states. [2018-09-26 08:12:04,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:04,696 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-09-26 08:12:04,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-09-26 08:12:04,696 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 130 [2018-09-26 08:12:04,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:04,697 INFO L225 Difference]: With dead ends: 134 [2018-09-26 08:12:04,697 INFO L226 Difference]: Without dead ends: 132 [2018-09-26 08:12:04,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:12:04,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-09-26 08:12:04,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-09-26 08:12:04,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-09-26 08:12:04,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-09-26 08:12:04,703 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 130 [2018-09-26 08:12:04,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:04,704 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-09-26 08:12:04,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-26 08:12:04,704 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-09-26 08:12:04,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-09-26 08:12:04,705 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:04,705 INFO L375 BasicCegarLoop]: trace histogram [128, 1, 1, 1] [2018-09-26 08:12:04,705 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:04,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:04,705 INFO L82 PathProgramCache]: Analyzing trace with hash -2048479935, now seen corresponding path program 128 times [2018-09-26 08:12:04,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:05,073 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:05,074 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:05,074 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-09-26 08:12:05,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-09-26 08:12:05,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-09-26 08:12:05,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:12:05,077 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 131 states. [2018-09-26 08:12:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:05,237 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-26 08:12:05,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-09-26 08:12:05,237 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 131 [2018-09-26 08:12:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:05,237 INFO L225 Difference]: With dead ends: 135 [2018-09-26 08:12:05,238 INFO L226 Difference]: Without dead ends: 133 [2018-09-26 08:12:05,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:12:05,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-26 08:12:05,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-09-26 08:12:05,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-26 08:12:05,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-09-26 08:12:05,241 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 131 [2018-09-26 08:12:05,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:05,242 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-09-26 08:12:05,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-09-26 08:12:05,242 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-09-26 08:12:05,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-26 08:12:05,242 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:05,242 INFO L375 BasicCegarLoop]: trace histogram [129, 1, 1, 1] [2018-09-26 08:12:05,243 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:05,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:05,243 INFO L82 PathProgramCache]: Analyzing trace with hash 921629480, now seen corresponding path program 129 times [2018-09-26 08:12:05,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:05,652 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:05,653 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:05,653 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-09-26 08:12:05,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-26 08:12:05,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-26 08:12:05,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:12:05,654 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 132 states. [2018-09-26 08:12:05,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:05,842 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-09-26 08:12:05,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-09-26 08:12:05,842 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 132 [2018-09-26 08:12:05,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:05,842 INFO L225 Difference]: With dead ends: 136 [2018-09-26 08:12:05,842 INFO L226 Difference]: Without dead ends: 134 [2018-09-26 08:12:05,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:12:05,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-26 08:12:05,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-09-26 08:12:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-09-26 08:12:05,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-09-26 08:12:05,846 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 132 [2018-09-26 08:12:05,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:05,846 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-09-26 08:12:05,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-26 08:12:05,846 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-09-26 08:12:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-09-26 08:12:05,847 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:05,847 INFO L375 BasicCegarLoop]: trace histogram [130, 1, 1, 1] [2018-09-26 08:12:05,847 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:05,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:05,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1494259167, now seen corresponding path program 130 times [2018-09-26 08:12:05,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:06,476 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:06,476 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-09-26 08:12:06,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-09-26 08:12:06,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-09-26 08:12:06,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:12:06,479 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 133 states. [2018-09-26 08:12:06,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:06,637 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-09-26 08:12:06,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-09-26 08:12:06,637 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 133 [2018-09-26 08:12:06,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:06,638 INFO L225 Difference]: With dead ends: 137 [2018-09-26 08:12:06,638 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 08:12:06,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:12:06,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 08:12:06,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-09-26 08:12:06,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-26 08:12:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-09-26 08:12:06,641 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 133 [2018-09-26 08:12:06,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:06,641 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-09-26 08:12:06,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-09-26 08:12:06,641 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-09-26 08:12:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-26 08:12:06,642 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:06,642 INFO L375 BasicCegarLoop]: trace histogram [131, 1, 1, 1] [2018-09-26 08:12:06,642 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:06,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:06,642 INFO L82 PathProgramCache]: Analyzing trace with hash 922604104, now seen corresponding path program 131 times [2018-09-26 08:12:06,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:07,002 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:07,002 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:07,002 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-09-26 08:12:07,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-26 08:12:07,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-26 08:12:07,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:12:07,004 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 134 states. [2018-09-26 08:12:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:07,305 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-09-26 08:12:07,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-09-26 08:12:07,305 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 134 [2018-09-26 08:12:07,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:07,306 INFO L225 Difference]: With dead ends: 138 [2018-09-26 08:12:07,306 INFO L226 Difference]: Without dead ends: 136 [2018-09-26 08:12:07,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:12:07,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-09-26 08:12:07,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-09-26 08:12:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-09-26 08:12:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-09-26 08:12:07,312 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 134 [2018-09-26 08:12:07,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:07,312 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-09-26 08:12:07,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-26 08:12:07,313 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-09-26 08:12:07,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-09-26 08:12:07,313 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:07,313 INFO L375 BasicCegarLoop]: trace histogram [132, 1, 1, 1] [2018-09-26 08:12:07,314 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:07,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:07,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1464045823, now seen corresponding path program 132 times [2018-09-26 08:12:07,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:07,987 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:07,987 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-09-26 08:12:07,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-09-26 08:12:07,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-09-26 08:12:07,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:12:07,990 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 135 states. [2018-09-26 08:12:08,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:08,172 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-09-26 08:12:08,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-09-26 08:12:08,172 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 135 [2018-09-26 08:12:08,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:08,173 INFO L225 Difference]: With dead ends: 139 [2018-09-26 08:12:08,173 INFO L226 Difference]: Without dead ends: 137 [2018-09-26 08:12:08,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:12:08,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-26 08:12:08,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-09-26 08:12:08,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 08:12:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-26 08:12:08,177 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 135 [2018-09-26 08:12:08,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:08,177 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-26 08:12:08,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-09-26 08:12:08,177 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-26 08:12:08,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 08:12:08,178 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:08,178 INFO L375 BasicCegarLoop]: trace histogram [133, 1, 1, 1] [2018-09-26 08:12:08,178 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:08,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:08,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1859217768, now seen corresponding path program 133 times [2018-09-26 08:12:08,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:08,569 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:08,570 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:08,570 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-09-26 08:12:08,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-26 08:12:08,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-26 08:12:08,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:12:08,573 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 136 states. [2018-09-26 08:12:08,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:08,780 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-09-26 08:12:08,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-09-26 08:12:08,780 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 136 [2018-09-26 08:12:08,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:08,781 INFO L225 Difference]: With dead ends: 140 [2018-09-26 08:12:08,781 INFO L226 Difference]: Without dead ends: 138 [2018-09-26 08:12:08,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:12:08,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-26 08:12:08,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-09-26 08:12:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-09-26 08:12:08,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-09-26 08:12:08,786 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 136 [2018-09-26 08:12:08,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:08,786 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-09-26 08:12:08,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-26 08:12:08,786 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-09-26 08:12:08,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-09-26 08:12:08,787 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:08,787 INFO L375 BasicCegarLoop]: trace histogram [134, 1, 1, 1] [2018-09-26 08:12:08,787 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:08,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:08,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1801173985, now seen corresponding path program 134 times [2018-09-26 08:12:08,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:09,313 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:09,314 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:09,314 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-09-26 08:12:09,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-09-26 08:12:09,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-09-26 08:12:09,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:12:09,316 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 137 states. [2018-09-26 08:12:09,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:09,505 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-09-26 08:12:09,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-09-26 08:12:09,505 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 137 [2018-09-26 08:12:09,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:09,506 INFO L225 Difference]: With dead ends: 141 [2018-09-26 08:12:09,506 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 08:12:09,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:12:09,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 08:12:09,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-09-26 08:12:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-26 08:12:09,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-09-26 08:12:09,508 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 137 [2018-09-26 08:12:09,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:09,509 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-09-26 08:12:09,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-09-26 08:12:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-09-26 08:12:09,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-26 08:12:09,509 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:09,509 INFO L375 BasicCegarLoop]: trace histogram [135, 1, 1, 1] [2018-09-26 08:12:09,509 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:09,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:09,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1816712, now seen corresponding path program 135 times [2018-09-26 08:12:09,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:09,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:09,909 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:09,909 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-09-26 08:12:09,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-26 08:12:09,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-26 08:12:09,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:12:09,912 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 138 states. [2018-09-26 08:12:10,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:10,126 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-09-26 08:12:10,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-09-26 08:12:10,126 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 138 [2018-09-26 08:12:10,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:10,127 INFO L225 Difference]: With dead ends: 142 [2018-09-26 08:12:10,127 INFO L226 Difference]: Without dead ends: 140 [2018-09-26 08:12:10,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:12:10,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-09-26 08:12:10,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-09-26 08:12:10,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-09-26 08:12:10,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-09-26 08:12:10,131 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 138 [2018-09-26 08:12:10,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:10,131 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-09-26 08:12:10,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-09-26 08:12:10,132 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-09-26 08:12:10,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-26 08:12:10,132 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:10,132 INFO L375 BasicCegarLoop]: trace histogram [136, 1, 1, 1] [2018-09-26 08:12:10,132 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:10,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:10,133 INFO L82 PathProgramCache]: Analyzing trace with hash 56316097, now seen corresponding path program 136 times [2018-09-26 08:12:10,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:10,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:10,533 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:10,533 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-09-26 08:12:10,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-09-26 08:12:10,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-09-26 08:12:10,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:12:10,536 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 139 states. [2018-09-26 08:12:10,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:10,623 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-09-26 08:12:10,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-09-26 08:12:10,623 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 139 [2018-09-26 08:12:10,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:10,623 INFO L225 Difference]: With dead ends: 143 [2018-09-26 08:12:10,623 INFO L226 Difference]: Without dead ends: 141 [2018-09-26 08:12:10,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:12:10,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-26 08:12:10,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-09-26 08:12:10,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 08:12:10,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-26 08:12:10,626 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 139 [2018-09-26 08:12:10,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:10,627 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-26 08:12:10,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-09-26 08:12:10,627 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-26 08:12:10,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 08:12:10,627 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:10,627 INFO L375 BasicCegarLoop]: trace histogram [137, 1, 1, 1] [2018-09-26 08:12:10,627 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:10,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:10,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1745797032, now seen corresponding path program 137 times [2018-09-26 08:12:10,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:11,026 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:11,027 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-09-26 08:12:11,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-09-26 08:12:11,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-09-26 08:12:11,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:12:11,029 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 140 states. [2018-09-26 08:12:11,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:11,265 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-09-26 08:12:11,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-09-26 08:12:11,265 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 140 [2018-09-26 08:12:11,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:11,266 INFO L225 Difference]: With dead ends: 144 [2018-09-26 08:12:11,266 INFO L226 Difference]: Without dead ends: 142 [2018-09-26 08:12:11,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:12:11,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-09-26 08:12:11,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-09-26 08:12:11,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-09-26 08:12:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-09-26 08:12:11,269 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 140 [2018-09-26 08:12:11,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:11,269 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-09-26 08:12:11,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-09-26 08:12:11,269 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-09-26 08:12:11,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-09-26 08:12:11,269 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:11,269 INFO L375 BasicCegarLoop]: trace histogram [138, 1, 1, 1] [2018-09-26 08:12:11,269 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:11,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:11,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1714868831, now seen corresponding path program 138 times [2018-09-26 08:12:11,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:11,679 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:11,679 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-09-26 08:12:11,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-09-26 08:12:11,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-09-26 08:12:11,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:12:11,681 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 141 states. [2018-09-26 08:12:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:11,899 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-09-26 08:12:11,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-09-26 08:12:11,899 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 141 [2018-09-26 08:12:11,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:11,900 INFO L225 Difference]: With dead ends: 145 [2018-09-26 08:12:11,900 INFO L226 Difference]: Without dead ends: 143 [2018-09-26 08:12:11,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:12:11,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-26 08:12:11,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-26 08:12:11,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-26 08:12:11,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-09-26 08:12:11,903 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 141 [2018-09-26 08:12:11,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:11,903 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-09-26 08:12:11,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-09-26 08:12:11,903 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-09-26 08:12:11,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-26 08:12:11,904 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:11,904 INFO L375 BasicCegarLoop]: trace histogram [139, 1, 1, 1] [2018-09-26 08:12:11,904 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:11,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:11,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1621328184, now seen corresponding path program 139 times [2018-09-26 08:12:11,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:12,416 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:12,416 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-09-26 08:12:12,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-09-26 08:12:12,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-09-26 08:12:12,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:12:12,419 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 142 states. [2018-09-26 08:12:12,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:12,715 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-09-26 08:12:12,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-09-26 08:12:12,715 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 142 [2018-09-26 08:12:12,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:12,716 INFO L225 Difference]: With dead ends: 146 [2018-09-26 08:12:12,716 INFO L226 Difference]: Without dead ends: 144 [2018-09-26 08:12:12,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:12:12,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-09-26 08:12:12,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-09-26 08:12:12,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-09-26 08:12:12,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-09-26 08:12:12,720 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 142 [2018-09-26 08:12:12,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:12,721 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-09-26 08:12:12,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-09-26 08:12:12,721 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-09-26 08:12:12,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-09-26 08:12:12,721 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:12,722 INFO L375 BasicCegarLoop]: trace histogram [140, 1, 1, 1] [2018-09-26 08:12:12,722 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:12,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:12,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1278431873, now seen corresponding path program 140 times [2018-09-26 08:12:12,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:13,149 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:13,149 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-09-26 08:12:13,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-09-26 08:12:13,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-09-26 08:12:13,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:12:13,152 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 143 states. [2018-09-26 08:12:13,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:13,325 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-09-26 08:12:13,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-09-26 08:12:13,326 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 143 [2018-09-26 08:12:13,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:13,326 INFO L225 Difference]: With dead ends: 147 [2018-09-26 08:12:13,326 INFO L226 Difference]: Without dead ends: 145 [2018-09-26 08:12:13,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:12:13,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-09-26 08:12:13,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-09-26 08:12:13,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-26 08:12:13,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-09-26 08:12:13,331 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 143 [2018-09-26 08:12:13,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:13,331 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-09-26 08:12:13,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-09-26 08:12:13,331 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-09-26 08:12:13,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-26 08:12:13,332 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:13,332 INFO L375 BasicCegarLoop]: trace histogram [141, 1, 1, 1] [2018-09-26 08:12:13,332 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:13,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:13,332 INFO L82 PathProgramCache]: Analyzing trace with hash 976680424, now seen corresponding path program 141 times [2018-09-26 08:12:13,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:13,756 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:13,756 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-09-26 08:12:13,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-09-26 08:12:13,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-09-26 08:12:13,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:12:13,759 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 144 states. [2018-09-26 08:12:13,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:13,861 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-09-26 08:12:13,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-09-26 08:12:13,862 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 144 [2018-09-26 08:12:13,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:13,862 INFO L225 Difference]: With dead ends: 148 [2018-09-26 08:12:13,862 INFO L226 Difference]: Without dead ends: 146 [2018-09-26 08:12:13,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:12:13,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-26 08:12:13,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-09-26 08:12:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-09-26 08:12:13,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-09-26 08:12:13,866 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 144 [2018-09-26 08:12:13,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:13,866 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-09-26 08:12:13,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-09-26 08:12:13,866 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-09-26 08:12:13,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-26 08:12:13,867 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:13,867 INFO L375 BasicCegarLoop]: trace histogram [142, 1, 1, 1] [2018-09-26 08:12:13,867 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:13,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:13,867 INFO L82 PathProgramCache]: Analyzing trace with hash 212320097, now seen corresponding path program 142 times [2018-09-26 08:12:13,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:14,544 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:14,544 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:14,544 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-09-26 08:12:14,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-09-26 08:12:14,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-09-26 08:12:14,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:12:14,551 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 145 states. [2018-09-26 08:12:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:14,821 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-09-26 08:12:14,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-09-26 08:12:14,821 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 145 [2018-09-26 08:12:14,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:14,821 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:12:14,821 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 08:12:14,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:12:14,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 08:12:14,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-09-26 08:12:14,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 08:12:14,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-09-26 08:12:14,825 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 145 [2018-09-26 08:12:14,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:14,826 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-09-26 08:12:14,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-09-26 08:12:14,826 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-09-26 08:12:14,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-26 08:12:14,827 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:14,827 INFO L375 BasicCegarLoop]: trace histogram [143, 1, 1, 1] [2018-09-26 08:12:14,827 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:14,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:14,827 INFO L82 PathProgramCache]: Analyzing trace with hash -2008013560, now seen corresponding path program 143 times [2018-09-26 08:12:14,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:15,476 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:15,476 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-09-26 08:12:15,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-09-26 08:12:15,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-09-26 08:12:15,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:12:15,477 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 146 states. [2018-09-26 08:12:15,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:15,737 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-09-26 08:12:15,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-09-26 08:12:15,737 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 146 [2018-09-26 08:12:15,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:15,737 INFO L225 Difference]: With dead ends: 150 [2018-09-26 08:12:15,737 INFO L226 Difference]: Without dead ends: 148 [2018-09-26 08:12:15,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:12:15,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-09-26 08:12:15,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-09-26 08:12:15,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-09-26 08:12:15,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-09-26 08:12:15,740 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 146 [2018-09-26 08:12:15,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:15,740 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-09-26 08:12:15,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-09-26 08:12:15,740 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-09-26 08:12:15,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-26 08:12:15,741 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:15,741 INFO L375 BasicCegarLoop]: trace histogram [144, 1, 1, 1] [2018-09-26 08:12:15,741 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:15,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:15,741 INFO L82 PathProgramCache]: Analyzing trace with hash -2118880191, now seen corresponding path program 144 times [2018-09-26 08:12:15,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:16,180 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:16,180 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-09-26 08:12:16,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-09-26 08:12:16,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-09-26 08:12:16,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:12:16,183 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 147 states. [2018-09-26 08:12:16,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:16,459 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-09-26 08:12:16,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-09-26 08:12:16,459 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 147 [2018-09-26 08:12:16,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:16,459 INFO L225 Difference]: With dead ends: 151 [2018-09-26 08:12:16,459 INFO L226 Difference]: Without dead ends: 149 [2018-09-26 08:12:16,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:12:16,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-26 08:12:16,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-09-26 08:12:16,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-26 08:12:16,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-09-26 08:12:16,462 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 147 [2018-09-26 08:12:16,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:16,462 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-09-26 08:12:16,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-09-26 08:12:16,463 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-09-26 08:12:16,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 08:12:16,463 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:16,463 INFO L375 BasicCegarLoop]: trace histogram [145, 1, 1, 1] [2018-09-26 08:12:16,463 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:16,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:16,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1260778456, now seen corresponding path program 145 times [2018-09-26 08:12:16,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:16,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:16,900 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:16,900 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-09-26 08:12:16,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-26 08:12:16,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-26 08:12:16,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:12:16,903 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 148 states. [2018-09-26 08:12:17,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:17,184 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-09-26 08:12:17,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-09-26 08:12:17,184 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 148 [2018-09-26 08:12:17,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:17,184 INFO L225 Difference]: With dead ends: 152 [2018-09-26 08:12:17,184 INFO L226 Difference]: Without dead ends: 150 [2018-09-26 08:12:17,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:12:17,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-26 08:12:17,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-09-26 08:12:17,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-09-26 08:12:17,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-09-26 08:12:17,188 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 148 [2018-09-26 08:12:17,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:17,188 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-09-26 08:12:17,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-26 08:12:17,188 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-09-26 08:12:17,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-09-26 08:12:17,189 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:17,189 INFO L375 BasicCegarLoop]: trace histogram [146, 1, 1, 1] [2018-09-26 08:12:17,189 INFO L423 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:17,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:17,189 INFO L82 PathProgramCache]: Analyzing trace with hash -429428447, now seen corresponding path program 146 times [2018-09-26 08:12:17,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:17,691 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:17,691 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-09-26 08:12:17,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-09-26 08:12:17,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-09-26 08:12:17,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:12:17,693 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 149 states. [2018-09-26 08:12:18,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:18,004 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-09-26 08:12:18,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-09-26 08:12:18,004 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 149 [2018-09-26 08:12:18,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:18,005 INFO L225 Difference]: With dead ends: 153 [2018-09-26 08:12:18,005 INFO L226 Difference]: Without dead ends: 151 [2018-09-26 08:12:18,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:12:18,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-09-26 08:12:18,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-09-26 08:12:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 08:12:18,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-09-26 08:12:18,010 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 149 [2018-09-26 08:12:18,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:18,010 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-09-26 08:12:18,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-09-26 08:12:18,010 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-09-26 08:12:18,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-26 08:12:18,011 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:18,011 INFO L375 BasicCegarLoop]: trace histogram [147, 1, 1, 1] [2018-09-26 08:12:18,011 INFO L423 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:18,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:18,011 INFO L82 PathProgramCache]: Analyzing trace with hash -427381944, now seen corresponding path program 147 times [2018-09-26 08:12:18,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:18,533 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:18,533 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:18,533 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-09-26 08:12:18,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-09-26 08:12:18,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-09-26 08:12:18,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:12:18,536 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 150 states. [2018-09-26 08:12:18,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:18,861 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-09-26 08:12:18,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-09-26 08:12:18,861 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 150 [2018-09-26 08:12:18,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:18,861 INFO L225 Difference]: With dead ends: 154 [2018-09-26 08:12:18,861 INFO L226 Difference]: Without dead ends: 152 [2018-09-26 08:12:18,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:12:18,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-09-26 08:12:18,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-09-26 08:12:18,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-09-26 08:12:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-09-26 08:12:18,865 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 150 [2018-09-26 08:12:18,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:18,866 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-09-26 08:12:18,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-09-26 08:12:18,866 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-09-26 08:12:18,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-09-26 08:12:18,867 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:18,867 INFO L375 BasicCegarLoop]: trace histogram [148, 1, 1, 1] [2018-09-26 08:12:18,867 INFO L423 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:18,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:18,867 INFO L82 PathProgramCache]: Analyzing trace with hash -363940351, now seen corresponding path program 148 times [2018-09-26 08:12:18,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:19,435 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:19,435 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-09-26 08:12:19,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-09-26 08:12:19,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-09-26 08:12:19,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:12:19,437 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 151 states. [2018-09-26 08:12:19,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:19,793 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-26 08:12:19,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-09-26 08:12:19,793 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 151 [2018-09-26 08:12:19,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:19,794 INFO L225 Difference]: With dead ends: 155 [2018-09-26 08:12:19,794 INFO L226 Difference]: Without dead ends: 153 [2018-09-26 08:12:19,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:12:19,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-09-26 08:12:19,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-09-26 08:12:19,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-26 08:12:19,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-09-26 08:12:19,797 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 151 [2018-09-26 08:12:19,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:19,798 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-09-26 08:12:19,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-09-26 08:12:19,798 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-09-26 08:12:19,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-26 08:12:19,798 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:19,798 INFO L375 BasicCegarLoop]: trace histogram [149, 1, 1, 1] [2018-09-26 08:12:19,799 INFO L423 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:19,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:19,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1602749032, now seen corresponding path program 149 times [2018-09-26 08:12:19,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:20,277 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:20,278 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:20,278 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-09-26 08:12:20,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-09-26 08:12:20,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-09-26 08:12:20,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:12:20,280 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 152 states. [2018-09-26 08:12:20,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:20,623 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-09-26 08:12:20,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-26 08:12:20,623 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 152 [2018-09-26 08:12:20,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:20,624 INFO L225 Difference]: With dead ends: 156 [2018-09-26 08:12:20,624 INFO L226 Difference]: Without dead ends: 154 [2018-09-26 08:12:20,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:12:20,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-26 08:12:20,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-09-26 08:12:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-09-26 08:12:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-09-26 08:12:20,627 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 152 [2018-09-26 08:12:20,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:20,628 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-09-26 08:12:20,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-09-26 08:12:20,628 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-09-26 08:12:20,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-09-26 08:12:20,628 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:20,629 INFO L375 BasicCegarLoop]: trace histogram [150, 1, 1, 1] [2018-09-26 08:12:20,629 INFO L423 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:20,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:20,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1854389535, now seen corresponding path program 150 times [2018-09-26 08:12:20,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:21,154 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:21,155 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:21,155 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-09-26 08:12:21,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-09-26 08:12:21,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-09-26 08:12:21,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:12:21,157 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 153 states. [2018-09-26 08:12:21,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:21,509 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-09-26 08:12:21,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-09-26 08:12:21,509 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 153 [2018-09-26 08:12:21,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:21,509 INFO L225 Difference]: With dead ends: 157 [2018-09-26 08:12:21,509 INFO L226 Difference]: Without dead ends: 155 [2018-09-26 08:12:21,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:12:21,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-26 08:12:21,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-09-26 08:12:21,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-09-26 08:12:21,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-09-26 08:12:21,512 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 153 [2018-09-26 08:12:21,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:21,513 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-09-26 08:12:21,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-09-26 08:12:21,513 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-09-26 08:12:21,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-26 08:12:21,513 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:21,513 INFO L375 BasicCegarLoop]: trace histogram [151, 1, 1, 1] [2018-09-26 08:12:21,513 INFO L423 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:21,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:21,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1651502712, now seen corresponding path program 151 times [2018-09-26 08:12:21,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:22,005 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:22,005 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:22,005 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-09-26 08:12:22,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-09-26 08:12:22,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-09-26 08:12:22,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:12:22,008 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 154 states. [2018-09-26 08:12:22,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:22,360 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-09-26 08:12:22,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-09-26 08:12:22,360 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 154 [2018-09-26 08:12:22,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:22,361 INFO L225 Difference]: With dead ends: 158 [2018-09-26 08:12:22,361 INFO L226 Difference]: Without dead ends: 156 [2018-09-26 08:12:22,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:12:22,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-09-26 08:12:22,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-09-26 08:12:22,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-09-26 08:12:22,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-09-26 08:12:22,364 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 154 [2018-09-26 08:12:22,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:22,364 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-09-26 08:12:22,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-09-26 08:12:22,365 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-09-26 08:12:22,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-09-26 08:12:22,365 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:22,365 INFO L375 BasicCegarLoop]: trace histogram [152, 1, 1, 1] [2018-09-26 08:12:22,365 INFO L423 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:22,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:22,365 INFO L82 PathProgramCache]: Analyzing trace with hash 343021505, now seen corresponding path program 152 times [2018-09-26 08:12:22,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:22,946 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:22,946 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:22,946 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-09-26 08:12:22,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-09-26 08:12:22,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-09-26 08:12:22,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:12:22,948 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 155 states. [2018-09-26 08:12:23,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:23,270 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-09-26 08:12:23,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-09-26 08:12:23,270 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 155 [2018-09-26 08:12:23,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:23,270 INFO L225 Difference]: With dead ends: 159 [2018-09-26 08:12:23,270 INFO L226 Difference]: Without dead ends: 157 [2018-09-26 08:12:23,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:12:23,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-09-26 08:12:23,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-09-26 08:12:23,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-26 08:12:23,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-09-26 08:12:23,274 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 155 [2018-09-26 08:12:23,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:23,275 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-09-26 08:12:23,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-09-26 08:12:23,275 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-09-26 08:12:23,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-26 08:12:23,276 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:23,276 INFO L375 BasicCegarLoop]: trace histogram [153, 1, 1, 1] [2018-09-26 08:12:23,276 INFO L423 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:23,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:23,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2043730088, now seen corresponding path program 153 times [2018-09-26 08:12:23,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:23,768 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:23,769 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:23,769 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-09-26 08:12:23,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-09-26 08:12:23,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-09-26 08:12:23,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:12:23,771 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 156 states. [2018-09-26 08:12:24,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:24,107 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-09-26 08:12:24,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-09-26 08:12:24,107 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 156 [2018-09-26 08:12:24,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:24,108 INFO L225 Difference]: With dead ends: 160 [2018-09-26 08:12:24,108 INFO L226 Difference]: Without dead ends: 158 [2018-09-26 08:12:24,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:12:24,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-26 08:12:24,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-09-26 08:12:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-09-26 08:12:24,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-09-26 08:12:24,113 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 156 [2018-09-26 08:12:24,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:24,113 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-09-26 08:12:24,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-09-26 08:12:24,113 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-09-26 08:12:24,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-09-26 08:12:24,114 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:24,114 INFO L375 BasicCegarLoop]: trace histogram [154, 1, 1, 1] [2018-09-26 08:12:24,114 INFO L423 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:24,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:24,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1068878687, now seen corresponding path program 154 times [2018-09-26 08:12:24,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:24,617 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:24,617 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:24,617 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-09-26 08:12:24,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-09-26 08:12:24,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-09-26 08:12:24,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:12:24,620 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 157 states. [2018-09-26 08:12:25,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:25,036 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-09-26 08:12:25,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-09-26 08:12:25,037 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 157 [2018-09-26 08:12:25,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:25,037 INFO L225 Difference]: With dead ends: 161 [2018-09-26 08:12:25,037 INFO L226 Difference]: Without dead ends: 159 [2018-09-26 08:12:25,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:12:25,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-26 08:12:25,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-09-26 08:12:25,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-09-26 08:12:25,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-09-26 08:12:25,041 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 157 [2018-09-26 08:12:25,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:25,041 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-09-26 08:12:25,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-09-26 08:12:25,042 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-09-26 08:12:25,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-26 08:12:25,042 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:25,042 INFO L375 BasicCegarLoop]: trace histogram [155, 1, 1, 1] [2018-09-26 08:12:25,042 INFO L423 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:25,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:25,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1224497096, now seen corresponding path program 155 times [2018-09-26 08:12:25,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:25,608 INFO L134 CoverageAnalysis]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:25,608 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:25,609 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-09-26 08:12:25,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-09-26 08:12:25,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-09-26 08:12:25,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:12:25,611 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 158 states. [2018-09-26 08:12:25,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:25,843 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-09-26 08:12:25,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-09-26 08:12:25,843 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 158 [2018-09-26 08:12:25,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:25,844 INFO L225 Difference]: With dead ends: 162 [2018-09-26 08:12:25,844 INFO L226 Difference]: Without dead ends: 160 [2018-09-26 08:12:25,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:12:25,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-09-26 08:12:25,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-09-26 08:12:25,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-09-26 08:12:25,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-09-26 08:12:25,847 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 158 [2018-09-26 08:12:25,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:25,848 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-09-26 08:12:25,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-09-26 08:12:25,848 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-09-26 08:12:25,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-09-26 08:12:25,848 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:25,848 INFO L375 BasicCegarLoop]: trace histogram [156, 1, 1, 1] [2018-09-26 08:12:25,848 INFO L423 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:25,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:25,849 INFO L82 PathProgramCache]: Analyzing trace with hash -695297663, now seen corresponding path program 156 times [2018-09-26 08:12:25,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:26,390 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:26,390 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-09-26 08:12:26,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-09-26 08:12:26,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-09-26 08:12:26,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:12:26,392 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 159 states. [2018-09-26 08:12:26,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:26,520 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-09-26 08:12:26,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-09-26 08:12:26,521 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 159 [2018-09-26 08:12:26,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:26,521 INFO L225 Difference]: With dead ends: 163 [2018-09-26 08:12:26,521 INFO L226 Difference]: Without dead ends: 161 [2018-09-26 08:12:26,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:12:26,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-09-26 08:12:26,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-09-26 08:12:26,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 08:12:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-26 08:12:26,524 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 159 [2018-09-26 08:12:26,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:26,524 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-26 08:12:26,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-09-26 08:12:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-26 08:12:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 08:12:26,525 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:26,525 INFO L375 BasicCegarLoop]: trace histogram [157, 1, 1, 1] [2018-09-26 08:12:26,525 INFO L423 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:26,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:26,525 INFO L82 PathProgramCache]: Analyzing trace with hash -79393048, now seen corresponding path program 157 times [2018-09-26 08:12:26,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:27,033 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:27,034 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:27,034 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-09-26 08:12:27,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-09-26 08:12:27,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-09-26 08:12:27,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:12:27,037 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 160 states. [2018-09-26 08:12:27,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:27,248 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-09-26 08:12:27,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-09-26 08:12:27,248 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 160 [2018-09-26 08:12:27,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:27,248 INFO L225 Difference]: With dead ends: 164 [2018-09-26 08:12:27,248 INFO L226 Difference]: Without dead ends: 162 [2018-09-26 08:12:27,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:12:27,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-26 08:12:27,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-09-26 08:12:27,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-26 08:12:27,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-09-26 08:12:27,252 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 160 [2018-09-26 08:12:27,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:27,252 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-09-26 08:12:27,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-09-26 08:12:27,252 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-09-26 08:12:27,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-09-26 08:12:27,252 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:27,253 INFO L375 BasicCegarLoop]: trace histogram [158, 1, 1, 1] [2018-09-26 08:12:27,253 INFO L423 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:27,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:27,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1833780833, now seen corresponding path program 158 times [2018-09-26 08:12:27,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:27,788 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:27,788 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:27,788 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-09-26 08:12:27,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-09-26 08:12:27,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-09-26 08:12:27,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:12:27,792 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 161 states. [2018-09-26 08:12:28,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:28,241 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-09-26 08:12:28,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-09-26 08:12:28,242 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 161 [2018-09-26 08:12:28,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:28,242 INFO L225 Difference]: With dead ends: 165 [2018-09-26 08:12:28,242 INFO L226 Difference]: Without dead ends: 163 [2018-09-26 08:12:28,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:12:28,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-26 08:12:28,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-09-26 08:12:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-09-26 08:12:28,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-09-26 08:12:28,246 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 161 [2018-09-26 08:12:28,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:28,247 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-09-26 08:12:28,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-09-26 08:12:28,247 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-09-26 08:12:28,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-26 08:12:28,248 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:28,248 INFO L375 BasicCegarLoop]: trace histogram [159, 1, 1, 1] [2018-09-26 08:12:28,248 INFO L423 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:28,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:28,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1012629000, now seen corresponding path program 159 times [2018-09-26 08:12:28,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:28,839 INFO L134 CoverageAnalysis]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:28,840 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:28,840 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-09-26 08:12:28,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-09-26 08:12:28,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-09-26 08:12:28,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:12:28,843 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 162 states. [2018-09-26 08:12:29,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:29,261 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-09-26 08:12:29,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-09-26 08:12:29,261 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 162 [2018-09-26 08:12:29,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:29,261 INFO L225 Difference]: With dead ends: 166 [2018-09-26 08:12:29,261 INFO L226 Difference]: Without dead ends: 164 [2018-09-26 08:12:29,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:12:29,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-09-26 08:12:29,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-09-26 08:12:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-09-26 08:12:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-09-26 08:12:29,266 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 162 [2018-09-26 08:12:29,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:29,266 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-09-26 08:12:29,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-09-26 08:12:29,266 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-09-26 08:12:29,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-09-26 08:12:29,267 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:29,267 INFO L375 BasicCegarLoop]: trace histogram [160, 1, 1, 1] [2018-09-26 08:12:29,267 INFO L423 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:29,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:29,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1326725953, now seen corresponding path program 160 times [2018-09-26 08:12:29,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:29,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:29,933 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:29,934 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-09-26 08:12:29,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-09-26 08:12:29,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-09-26 08:12:29,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:12:29,936 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 163 states. [2018-09-26 08:12:30,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:30,321 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-09-26 08:12:30,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-09-26 08:12:30,321 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 163 [2018-09-26 08:12:30,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:30,322 INFO L225 Difference]: With dead ends: 167 [2018-09-26 08:12:30,322 INFO L226 Difference]: Without dead ends: 165 [2018-09-26 08:12:30,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:12:30,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-09-26 08:12:30,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-09-26 08:12:30,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-26 08:12:30,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-09-26 08:12:30,326 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 163 [2018-09-26 08:12:30,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:30,326 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-09-26 08:12:30,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-09-26 08:12:30,326 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-09-26 08:12:30,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-26 08:12:30,327 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:30,327 INFO L375 BasicCegarLoop]: trace histogram [161, 1, 1, 1] [2018-09-26 08:12:30,327 INFO L423 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:30,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:30,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1821170392, now seen corresponding path program 161 times [2018-09-26 08:12:30,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:30,996 INFO L134 CoverageAnalysis]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:30,997 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:30,997 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-09-26 08:12:30,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-09-26 08:12:30,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-09-26 08:12:31,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:12:31,000 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 164 states. [2018-09-26 08:12:31,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:31,164 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-09-26 08:12:31,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-09-26 08:12:31,164 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 164 [2018-09-26 08:12:31,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:31,165 INFO L225 Difference]: With dead ends: 168 [2018-09-26 08:12:31,165 INFO L226 Difference]: Without dead ends: 166 [2018-09-26 08:12:31,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:12:31,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-26 08:12:31,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-09-26 08:12:31,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-26 08:12:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-09-26 08:12:31,171 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 164 [2018-09-26 08:12:31,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:31,171 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-09-26 08:12:31,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-09-26 08:12:31,171 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-09-26 08:12:31,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-09-26 08:12:31,172 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:31,172 INFO L375 BasicCegarLoop]: trace histogram [162, 1, 1, 1] [2018-09-26 08:12:31,172 INFO L423 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:31,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:31,173 INFO L82 PathProgramCache]: Analyzing trace with hash -621709279, now seen corresponding path program 162 times [2018-09-26 08:12:31,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:31,828 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:31,828 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-09-26 08:12:31,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-09-26 08:12:31,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-09-26 08:12:31,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:12:31,831 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 165 states. [2018-09-26 08:12:32,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:32,134 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-09-26 08:12:32,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-09-26 08:12:32,135 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 165 [2018-09-26 08:12:32,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:32,135 INFO L225 Difference]: With dead ends: 169 [2018-09-26 08:12:32,135 INFO L226 Difference]: Without dead ends: 167 [2018-09-26 08:12:32,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:12:32,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-26 08:12:32,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-09-26 08:12:32,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 08:12:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-09-26 08:12:32,140 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 165 [2018-09-26 08:12:32,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:32,140 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-09-26 08:12:32,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-09-26 08:12:32,141 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-09-26 08:12:32,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-26 08:12:32,141 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:32,141 INFO L375 BasicCegarLoop]: trace histogram [163, 1, 1, 1] [2018-09-26 08:12:32,142 INFO L423 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:32,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:32,142 INFO L82 PathProgramCache]: Analyzing trace with hash -2093120440, now seen corresponding path program 163 times [2018-09-26 08:12:32,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:32,705 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:32,705 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-09-26 08:12:32,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-09-26 08:12:32,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-09-26 08:12:32,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:12:32,708 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 166 states. [2018-09-26 08:12:33,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:33,183 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-09-26 08:12:33,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-09-26 08:12:33,183 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 166 [2018-09-26 08:12:33,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:33,184 INFO L225 Difference]: With dead ends: 170 [2018-09-26 08:12:33,184 INFO L226 Difference]: Without dead ends: 168 [2018-09-26 08:12:33,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:12:33,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-09-26 08:12:33,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-09-26 08:12:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-09-26 08:12:33,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-09-26 08:12:33,187 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 166 [2018-09-26 08:12:33,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:33,187 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-09-26 08:12:33,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-09-26 08:12:33,187 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-09-26 08:12:33,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-09-26 08:12:33,188 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:33,188 INFO L375 BasicCegarLoop]: trace histogram [164, 1, 1, 1] [2018-09-26 08:12:33,188 INFO L423 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:33,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:33,188 INFO L82 PathProgramCache]: Analyzing trace with hash -462226175, now seen corresponding path program 164 times [2018-09-26 08:12:33,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:33,818 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:33,819 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:33,819 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-09-26 08:12:33,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-09-26 08:12:33,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-09-26 08:12:33,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:12:33,821 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 167 states. [2018-09-26 08:12:34,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:34,183 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-09-26 08:12:34,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-09-26 08:12:34,184 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 167 [2018-09-26 08:12:34,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:34,184 INFO L225 Difference]: With dead ends: 171 [2018-09-26 08:12:34,184 INFO L226 Difference]: Without dead ends: 169 [2018-09-26 08:12:34,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:12:34,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-09-26 08:12:34,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-09-26 08:12:34,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-26 08:12:34,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-09-26 08:12:34,189 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 167 [2018-09-26 08:12:34,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:34,189 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-09-26 08:12:34,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-09-26 08:12:34,189 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-09-26 08:12:34,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-26 08:12:34,190 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:34,190 INFO L375 BasicCegarLoop]: trace histogram [165, 1, 1, 1] [2018-09-26 08:12:34,190 INFO L423 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:34,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:34,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1444111512, now seen corresponding path program 165 times [2018-09-26 08:12:34,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:34,800 INFO L134 CoverageAnalysis]: Checked inductivity of 13695 backedges. 0 proven. 13695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:34,800 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:34,800 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-09-26 08:12:34,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-09-26 08:12:34,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-09-26 08:12:34,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:12:34,804 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 168 states. [2018-09-26 08:12:35,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:35,001 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-09-26 08:12:35,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-09-26 08:12:35,001 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 168 [2018-09-26 08:12:35,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:35,002 INFO L225 Difference]: With dead ends: 172 [2018-09-26 08:12:35,002 INFO L226 Difference]: Without dead ends: 170 [2018-09-26 08:12:35,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:12:35,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-26 08:12:35,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-09-26 08:12:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-09-26 08:12:35,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-09-26 08:12:35,006 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 168 [2018-09-26 08:12:35,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:35,007 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-09-26 08:12:35,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-09-26 08:12:35,007 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-09-26 08:12:35,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-09-26 08:12:35,008 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:35,008 INFO L375 BasicCegarLoop]: trace histogram [166, 1, 1, 1] [2018-09-26 08:12:35,008 INFO L423 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:35,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:35,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1817785887, now seen corresponding path program 166 times [2018-09-26 08:12:35,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:35,607 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:35,608 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-09-26 08:12:35,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-09-26 08:12:35,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-09-26 08:12:35,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-09-26 08:12:35,611 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 169 states. [2018-09-26 08:12:36,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:36,169 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-09-26 08:12:36,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-09-26 08:12:36,169 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 169 [2018-09-26 08:12:36,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:36,170 INFO L225 Difference]: With dead ends: 173 [2018-09-26 08:12:36,170 INFO L226 Difference]: Without dead ends: 171 [2018-09-26 08:12:36,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-09-26 08:12:36,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-09-26 08:12:36,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-09-26 08:12:36,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-26 08:12:36,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-09-26 08:12:36,175 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 169 [2018-09-26 08:12:36,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:36,175 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-09-26 08:12:36,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-09-26 08:12:36,175 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-09-26 08:12:36,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-26 08:12:36,176 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:36,176 INFO L375 BasicCegarLoop]: trace histogram [167, 1, 1, 1] [2018-09-26 08:12:36,176 INFO L423 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:36,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:36,176 INFO L82 PathProgramCache]: Analyzing trace with hash -516789624, now seen corresponding path program 167 times [2018-09-26 08:12:36,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 14028 backedges. 0 proven. 14028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:36,862 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:36,862 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-09-26 08:12:36,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-09-26 08:12:36,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-09-26 08:12:36,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:12:36,867 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 170 states. [2018-09-26 08:12:37,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:37,270 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-09-26 08:12:37,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-09-26 08:12:37,270 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 170 [2018-09-26 08:12:37,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:37,271 INFO L225 Difference]: With dead ends: 174 [2018-09-26 08:12:37,271 INFO L226 Difference]: Without dead ends: 172 [2018-09-26 08:12:37,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:12:37,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-09-26 08:12:37,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-09-26 08:12:37,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-09-26 08:12:37,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-09-26 08:12:37,274 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 170 [2018-09-26 08:12:37,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:37,274 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-09-26 08:12:37,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-09-26 08:12:37,275 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-09-26 08:12:37,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-09-26 08:12:37,275 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:37,275 INFO L375 BasicCegarLoop]: trace histogram [168, 1, 1, 1] [2018-09-26 08:12:37,275 INFO L423 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:37,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:37,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1159388865, now seen corresponding path program 168 times [2018-09-26 08:12:37,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:38,011 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:38,012 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:38,012 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2018-09-26 08:12:38,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-09-26 08:12:38,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-09-26 08:12:38,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-09-26 08:12:38,014 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 171 states. [2018-09-26 08:12:38,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:38,244 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-09-26 08:12:38,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-09-26 08:12:38,244 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 171 [2018-09-26 08:12:38,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:38,244 INFO L225 Difference]: With dead ends: 175 [2018-09-26 08:12:38,244 INFO L226 Difference]: Without dead ends: 173 [2018-09-26 08:12:38,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-09-26 08:12:38,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-09-26 08:12:38,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-09-26 08:12:38,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 08:12:38,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-09-26 08:12:38,247 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 171 [2018-09-26 08:12:38,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:38,247 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-09-26 08:12:38,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-09-26 08:12:38,247 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-09-26 08:12:38,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-26 08:12:38,248 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:38,248 INFO L375 BasicCegarLoop]: trace histogram [169, 1, 1, 1] [2018-09-26 08:12:38,248 INFO L423 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:38,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:38,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1581314472, now seen corresponding path program 169 times [2018-09-26 08:12:38,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:38,835 INFO L134 CoverageAnalysis]: Checked inductivity of 14365 backedges. 0 proven. 14365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:38,835 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:38,835 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-09-26 08:12:38,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-09-26 08:12:38,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-09-26 08:12:38,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:12:38,838 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 172 states. [2018-09-26 08:12:39,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:39,388 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-09-26 08:12:39,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-09-26 08:12:39,389 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 172 [2018-09-26 08:12:39,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:39,389 INFO L225 Difference]: With dead ends: 176 [2018-09-26 08:12:39,389 INFO L226 Difference]: Without dead ends: 174 [2018-09-26 08:12:39,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:12:39,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-26 08:12:39,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-09-26 08:12:39,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-09-26 08:12:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-09-26 08:12:39,393 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 172 [2018-09-26 08:12:39,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:39,393 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-09-26 08:12:39,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-09-26 08:12:39,393 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-09-26 08:12:39,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-09-26 08:12:39,394 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:39,394 INFO L375 BasicCegarLoop]: trace histogram [170, 1, 1, 1] [2018-09-26 08:12:39,394 INFO L423 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:39,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:39,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1776106401, now seen corresponding path program 170 times [2018-09-26 08:12:39,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:40,135 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:40,135 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:40,136 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-09-26 08:12:40,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-09-26 08:12:40,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-09-26 08:12:40,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:12:40,141 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 173 states. [2018-09-26 08:12:40,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:40,407 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-09-26 08:12:40,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-09-26 08:12:40,407 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 173 [2018-09-26 08:12:40,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:40,408 INFO L225 Difference]: With dead ends: 177 [2018-09-26 08:12:40,408 INFO L226 Difference]: Without dead ends: 175 [2018-09-26 08:12:40,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:12:40,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-09-26 08:12:40,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-09-26 08:12:40,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-26 08:12:40,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-09-26 08:12:40,413 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 173 [2018-09-26 08:12:40,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:40,413 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-09-26 08:12:40,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-09-26 08:12:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-09-26 08:12:40,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-26 08:12:40,414 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:40,414 INFO L375 BasicCegarLoop]: trace histogram [171, 1, 1, 1] [2018-09-26 08:12:40,415 INFO L423 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:40,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:40,415 INFO L82 PathProgramCache]: Analyzing trace with hash -775278392, now seen corresponding path program 171 times [2018-09-26 08:12:40,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:41,113 INFO L134 CoverageAnalysis]: Checked inductivity of 14706 backedges. 0 proven. 14706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:41,114 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:41,114 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-09-26 08:12:41,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-09-26 08:12:41,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-09-26 08:12:41,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:12:41,118 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 174 states. [2018-09-26 08:12:41,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:41,891 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-09-26 08:12:41,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-09-26 08:12:41,891 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 174 [2018-09-26 08:12:41,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:41,892 INFO L225 Difference]: With dead ends: 178 [2018-09-26 08:12:41,892 INFO L226 Difference]: Without dead ends: 176 [2018-09-26 08:12:41,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:12:41,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-09-26 08:12:41,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-09-26 08:12:41,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-09-26 08:12:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-09-26 08:12:41,897 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 174 [2018-09-26 08:12:41,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:41,897 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-09-26 08:12:41,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-09-26 08:12:41,897 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-09-26 08:12:41,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-09-26 08:12:41,898 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:41,898 INFO L375 BasicCegarLoop]: trace histogram [172, 1, 1, 1] [2018-09-26 08:12:41,898 INFO L423 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:41,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:41,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1736171649, now seen corresponding path program 172 times [2018-09-26 08:12:41,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:42,690 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:42,690 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:42,691 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2018-09-26 08:12:42,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-09-26 08:12:42,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-09-26 08:12:42,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-09-26 08:12:42,694 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 175 states. [2018-09-26 08:12:43,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:43,173 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-09-26 08:12:43,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-09-26 08:12:43,173 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 175 [2018-09-26 08:12:43,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:43,174 INFO L225 Difference]: With dead ends: 179 [2018-09-26 08:12:43,174 INFO L226 Difference]: Without dead ends: 177 [2018-09-26 08:12:43,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-09-26 08:12:43,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-09-26 08:12:43,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-09-26 08:12:43,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-26 08:12:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-09-26 08:12:43,178 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 175 [2018-09-26 08:12:43,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:43,179 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-09-26 08:12:43,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-09-26 08:12:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-09-26 08:12:43,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-26 08:12:43,179 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:43,180 INFO L375 BasicCegarLoop]: trace histogram [173, 1, 1, 1] [2018-09-26 08:12:43,180 INFO L423 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:43,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:43,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2013255704, now seen corresponding path program 173 times [2018-09-26 08:12:43,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:43,925 INFO L134 CoverageAnalysis]: Checked inductivity of 15051 backedges. 0 proven. 15051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:43,926 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:43,926 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2018-09-26 08:12:43,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-09-26 08:12:43,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-09-26 08:12:43,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-09-26 08:12:43,930 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 176 states. [2018-09-26 08:12:44,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:44,553 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-09-26 08:12:44,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-09-26 08:12:44,553 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 176 [2018-09-26 08:12:44,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:44,553 INFO L225 Difference]: With dead ends: 180 [2018-09-26 08:12:44,554 INFO L226 Difference]: Without dead ends: 178 [2018-09-26 08:12:44,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-09-26 08:12:44,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-09-26 08:12:44,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-09-26 08:12:44,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-09-26 08:12:44,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-09-26 08:12:44,559 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 176 [2018-09-26 08:12:44,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:44,559 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-09-26 08:12:44,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-09-26 08:12:44,559 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-09-26 08:12:44,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-09-26 08:12:44,560 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:44,560 INFO L375 BasicCegarLoop]: trace histogram [174, 1, 1, 1] [2018-09-26 08:12:44,560 INFO L423 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:44,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:44,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2013580641, now seen corresponding path program 174 times [2018-09-26 08:12:44,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:45,308 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:45,308 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:45,308 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2018-09-26 08:12:45,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-09-26 08:12:45,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-09-26 08:12:45,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-09-26 08:12:45,312 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 177 states. [2018-09-26 08:12:45,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:45,924 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-09-26 08:12:45,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-09-26 08:12:45,925 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 177 [2018-09-26 08:12:45,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:45,925 INFO L225 Difference]: With dead ends: 181 [2018-09-26 08:12:45,925 INFO L226 Difference]: Without dead ends: 179 [2018-09-26 08:12:45,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-09-26 08:12:45,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-26 08:12:45,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-09-26 08:12:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-09-26 08:12:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-09-26 08:12:45,930 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 177 [2018-09-26 08:12:45,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:45,930 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-09-26 08:12:45,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-09-26 08:12:45,930 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-09-26 08:12:45,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-26 08:12:45,931 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:45,931 INFO L375 BasicCegarLoop]: trace histogram [175, 1, 1, 1] [2018-09-26 08:12:45,931 INFO L423 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:45,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:45,932 INFO L82 PathProgramCache]: Analyzing trace with hash -2003511544, now seen corresponding path program 175 times [2018-09-26 08:12:45,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 15400 backedges. 0 proven. 15400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:46,718 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:46,718 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2018-09-26 08:12:46,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-09-26 08:12:46,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-09-26 08:12:46,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 08:12:46,723 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 178 states. [2018-09-26 08:12:47,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:47,349 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-09-26 08:12:47,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-09-26 08:12:47,349 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 178 [2018-09-26 08:12:47,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:47,349 INFO L225 Difference]: With dead ends: 182 [2018-09-26 08:12:47,349 INFO L226 Difference]: Without dead ends: 180 [2018-09-26 08:12:47,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 08:12:47,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-09-26 08:12:47,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-09-26 08:12:47,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-09-26 08:12:47,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-09-26 08:12:47,354 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 178 [2018-09-26 08:12:47,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:47,354 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-09-26 08:12:47,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-09-26 08:12:47,354 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-09-26 08:12:47,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-09-26 08:12:47,354 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:47,355 INFO L375 BasicCegarLoop]: trace histogram [176, 1, 1, 1] [2018-09-26 08:12:47,355 INFO L423 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:47,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:47,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1979317695, now seen corresponding path program 176 times [2018-09-26 08:12:47,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:48,095 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:48,095 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:48,095 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178] total 178 [2018-09-26 08:12:48,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-09-26 08:12:48,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-09-26 08:12:48,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2018-09-26 08:12:48,098 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 179 states. [2018-09-26 08:12:48,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:48,508 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-09-26 08:12:48,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-09-26 08:12:48,508 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 179 [2018-09-26 08:12:48,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:48,509 INFO L225 Difference]: With dead ends: 183 [2018-09-26 08:12:48,509 INFO L226 Difference]: Without dead ends: 181 [2018-09-26 08:12:48,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2018-09-26 08:12:48,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-09-26 08:12:48,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-09-26 08:12:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-26 08:12:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-26 08:12:48,513 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 179 [2018-09-26 08:12:48,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:48,514 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-26 08:12:48,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-09-26 08:12:48,514 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-26 08:12:48,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-26 08:12:48,515 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:48,515 INFO L375 BasicCegarLoop]: trace histogram [177, 1, 1, 1] [2018-09-26 08:12:48,515 INFO L423 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:48,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:48,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1229308376, now seen corresponding path program 177 times [2018-09-26 08:12:48,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:49,245 INFO L134 CoverageAnalysis]: Checked inductivity of 15753 backedges. 0 proven. 15753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:49,246 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:49,246 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2018-09-26 08:12:49,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-09-26 08:12:49,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-09-26 08:12:49,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-09-26 08:12:49,251 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 180 states. [2018-09-26 08:12:49,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:49,874 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-09-26 08:12:49,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-09-26 08:12:49,874 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 180 [2018-09-26 08:12:49,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:49,875 INFO L225 Difference]: With dead ends: 184 [2018-09-26 08:12:49,875 INFO L226 Difference]: Without dead ends: 182 [2018-09-26 08:12:49,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-09-26 08:12:49,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-26 08:12:49,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-09-26 08:12:49,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-09-26 08:12:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-09-26 08:12:49,879 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 180 [2018-09-26 08:12:49,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:49,879 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-09-26 08:12:49,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-09-26 08:12:49,879 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-09-26 08:12:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-09-26 08:12:49,880 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:49,880 INFO L375 BasicCegarLoop]: trace histogram [178, 1, 1, 1] [2018-09-26 08:12:49,880 INFO L423 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:49,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:49,880 INFO L82 PathProgramCache]: Analyzing trace with hash 546144033, now seen corresponding path program 178 times [2018-09-26 08:12:49,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:50,604 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:50,604 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:50,604 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [180] total 180 [2018-09-26 08:12:50,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 181 states [2018-09-26 08:12:50,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2018-09-26 08:12:50,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-09-26 08:12:50,608 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 181 states. [2018-09-26 08:12:50,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:50,886 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-09-26 08:12:50,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-09-26 08:12:50,887 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 181 [2018-09-26 08:12:50,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:50,887 INFO L225 Difference]: With dead ends: 185 [2018-09-26 08:12:50,887 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 08:12:50,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-09-26 08:12:50,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 08:12:50,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-09-26 08:12:50,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-09-26 08:12:50,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-09-26 08:12:50,891 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 181 [2018-09-26 08:12:50,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:50,891 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-09-26 08:12:50,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 181 states. [2018-09-26 08:12:50,892 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-09-26 08:12:50,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-26 08:12:50,892 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:50,892 INFO L375 BasicCegarLoop]: trace histogram [179, 1, 1, 1] [2018-09-26 08:12:50,892 INFO L423 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:50,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:50,893 INFO L82 PathProgramCache]: Analyzing trace with hash -249406136, now seen corresponding path program 179 times [2018-09-26 08:12:50,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:51,582 INFO L134 CoverageAnalysis]: Checked inductivity of 16110 backedges. 0 proven. 16110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:51,582 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:51,583 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [181] total 181 [2018-09-26 08:12:51,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-09-26 08:12:51,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-09-26 08:12:51,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-09-26 08:12:51,587 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 182 states. [2018-09-26 08:12:52,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:52,317 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-09-26 08:12:52,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-09-26 08:12:52,317 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 182 [2018-09-26 08:12:52,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:52,318 INFO L225 Difference]: With dead ends: 186 [2018-09-26 08:12:52,318 INFO L226 Difference]: Without dead ends: 184 [2018-09-26 08:12:52,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-09-26 08:12:52,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-09-26 08:12:52,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-09-26 08:12:52,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-09-26 08:12:52,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-09-26 08:12:52,324 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 182 [2018-09-26 08:12:52,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:52,324 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-09-26 08:12:52,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-09-26 08:12:52,324 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-09-26 08:12:52,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-09-26 08:12:52,325 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:52,325 INFO L375 BasicCegarLoop]: trace histogram [180, 1, 1, 1] [2018-09-26 08:12:52,325 INFO L423 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:52,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:52,326 INFO L82 PathProgramCache]: Analyzing trace with hash 858342401, now seen corresponding path program 180 times [2018-09-26 08:12:52,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:53,072 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:53,072 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [182] total 182 [2018-09-26 08:12:53,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-09-26 08:12:53,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-09-26 08:12:53,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-09-26 08:12:53,076 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 183 states. [2018-09-26 08:12:53,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:53,326 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-09-26 08:12:53,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-09-26 08:12:53,326 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 183 [2018-09-26 08:12:53,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:53,327 INFO L225 Difference]: With dead ends: 187 [2018-09-26 08:12:53,327 INFO L226 Difference]: Without dead ends: 185 [2018-09-26 08:12:53,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-09-26 08:12:53,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-09-26 08:12:53,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-09-26 08:12:53,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-26 08:12:53,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-09-26 08:12:53,330 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 183 [2018-09-26 08:12:53,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:53,330 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-09-26 08:12:53,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-09-26 08:12:53,330 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-09-26 08:12:53,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-26 08:12:53,331 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:53,331 INFO L375 BasicCegarLoop]: trace histogram [181, 1, 1, 1] [2018-09-26 08:12:53,331 INFO L423 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:53,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:53,331 INFO L82 PathProgramCache]: Analyzing trace with hash 838808680, now seen corresponding path program 181 times [2018-09-26 08:12:53,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:54,026 INFO L134 CoverageAnalysis]: Checked inductivity of 16471 backedges. 0 proven. 16471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:54,026 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:54,026 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [183] total 183 [2018-09-26 08:12:54,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-09-26 08:12:54,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-09-26 08:12:54,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-09-26 08:12:54,030 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 184 states. [2018-09-26 08:12:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:54,641 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-09-26 08:12:54,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-09-26 08:12:54,641 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 184 [2018-09-26 08:12:54,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:54,641 INFO L225 Difference]: With dead ends: 188 [2018-09-26 08:12:54,641 INFO L226 Difference]: Without dead ends: 186 [2018-09-26 08:12:54,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-09-26 08:12:54,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-09-26 08:12:54,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-09-26 08:12:54,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-09-26 08:12:54,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-09-26 08:12:54,645 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 184 [2018-09-26 08:12:54,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:54,645 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-09-26 08:12:54,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-09-26 08:12:54,645 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-09-26 08:12:54,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-09-26 08:12:54,646 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:54,646 INFO L375 BasicCegarLoop]: trace histogram [182, 1, 1, 1] [2018-09-26 08:12:54,646 INFO L423 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:54,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:54,646 INFO L82 PathProgramCache]: Analyzing trace with hash 233263329, now seen corresponding path program 182 times [2018-09-26 08:12:54,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:55,361 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:55,361 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:55,361 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [184] total 184 [2018-09-26 08:12:55,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 185 states [2018-09-26 08:12:55,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2018-09-26 08:12:55,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-09-26 08:12:55,366 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 185 states. [2018-09-26 08:12:56,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:56,203 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-09-26 08:12:56,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-09-26 08:12:56,203 INFO L78 Accepts]: Start accepts. Automaton has 185 states. Word has length 185 [2018-09-26 08:12:56,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:56,204 INFO L225 Difference]: With dead ends: 189 [2018-09-26 08:12:56,204 INFO L226 Difference]: Without dead ends: 187 [2018-09-26 08:12:56,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-09-26 08:12:56,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-09-26 08:12:56,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-09-26 08:12:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-09-26 08:12:56,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-09-26 08:12:56,209 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 185 [2018-09-26 08:12:56,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:56,210 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-09-26 08:12:56,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 185 states. [2018-09-26 08:12:56,210 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-09-26 08:12:56,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-26 08:12:56,210 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:56,211 INFO L375 BasicCegarLoop]: trace histogram [183, 1, 1, 1] [2018-09-26 08:12:56,211 INFO L423 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:56,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:56,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1358773368, now seen corresponding path program 183 times [2018-09-26 08:12:56,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:56,992 INFO L134 CoverageAnalysis]: Checked inductivity of 16836 backedges. 0 proven. 16836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:56,992 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:56,992 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [185] total 185 [2018-09-26 08:12:56,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-09-26 08:12:56,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-09-26 08:12:56,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-09-26 08:12:56,994 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 186 states. [2018-09-26 08:12:57,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:57,199 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-09-26 08:12:57,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-09-26 08:12:57,199 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 186 [2018-09-26 08:12:57,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:57,199 INFO L225 Difference]: With dead ends: 190 [2018-09-26 08:12:57,199 INFO L226 Difference]: Without dead ends: 188 [2018-09-26 08:12:57,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-09-26 08:12:57,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-09-26 08:12:57,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-09-26 08:12:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-09-26 08:12:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-09-26 08:12:57,202 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 186 [2018-09-26 08:12:57,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:57,202 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-09-26 08:12:57,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-09-26 08:12:57,203 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-09-26 08:12:57,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-09-26 08:12:57,203 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:57,203 INFO L375 BasicCegarLoop]: trace histogram [184, 1, 1, 1] [2018-09-26 08:12:57,203 INFO L423 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:57,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:57,203 INFO L82 PathProgramCache]: Analyzing trace with hash 827696577, now seen corresponding path program 184 times [2018-09-26 08:12:57,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:57,912 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:57,913 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:57,913 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [186] total 186 [2018-09-26 08:12:57,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 187 states [2018-09-26 08:12:57,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 187 interpolants. [2018-09-26 08:12:57,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-09-26 08:12:57,916 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 187 states. [2018-09-26 08:12:58,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:12:58,580 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-09-26 08:12:58,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-09-26 08:12:58,580 INFO L78 Accepts]: Start accepts. Automaton has 187 states. Word has length 187 [2018-09-26 08:12:58,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:12:58,580 INFO L225 Difference]: With dead ends: 191 [2018-09-26 08:12:58,581 INFO L226 Difference]: Without dead ends: 189 [2018-09-26 08:12:58,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-09-26 08:12:58,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-09-26 08:12:58,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-09-26 08:12:58,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-26 08:12:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-09-26 08:12:58,584 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 187 [2018-09-26 08:12:58,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:12:58,585 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-09-26 08:12:58,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 187 states. [2018-09-26 08:12:58,585 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-09-26 08:12:58,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-26 08:12:58,585 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:12:58,585 INFO L375 BasicCegarLoop]: trace histogram [185, 1, 1, 1] [2018-09-26 08:12:58,585 INFO L423 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:12:58,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:12:58,586 INFO L82 PathProgramCache]: Analyzing trace with hash -111211864, now seen corresponding path program 185 times [2018-09-26 08:12:58,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:12:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:12:59,481 INFO L134 CoverageAnalysis]: Checked inductivity of 17205 backedges. 0 proven. 17205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:12:59,482 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:12:59,482 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [187] total 187 [2018-09-26 08:12:59,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-09-26 08:12:59,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-09-26 08:12:59,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-09-26 08:12:59,486 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 188 states. [2018-09-26 08:13:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:00,294 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-09-26 08:13:00,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-09-26 08:13:00,294 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 188 [2018-09-26 08:13:00,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:00,295 INFO L225 Difference]: With dead ends: 192 [2018-09-26 08:13:00,295 INFO L226 Difference]: Without dead ends: 190 [2018-09-26 08:13:00,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-09-26 08:13:00,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-09-26 08:13:00,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-09-26 08:13:00,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-09-26 08:13:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-09-26 08:13:00,299 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 188 [2018-09-26 08:13:00,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:00,299 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-09-26 08:13:00,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-09-26 08:13:00,299 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-09-26 08:13:00,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-09-26 08:13:00,299 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:00,300 INFO L375 BasicCegarLoop]: trace histogram [186, 1, 1, 1] [2018-09-26 08:13:00,300 INFO L423 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:00,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:00,300 INFO L82 PathProgramCache]: Analyzing trace with hash 847397537, now seen corresponding path program 186 times [2018-09-26 08:13:00,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:01,064 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:01,064 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [188] total 188 [2018-09-26 08:13:01,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 189 states [2018-09-26 08:13:01,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2018-09-26 08:13:01,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-09-26 08:13:01,068 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 189 states. [2018-09-26 08:13:01,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:01,372 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-09-26 08:13:01,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-09-26 08:13:01,373 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 189 [2018-09-26 08:13:01,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:01,373 INFO L225 Difference]: With dead ends: 193 [2018-09-26 08:13:01,373 INFO L226 Difference]: Without dead ends: 191 [2018-09-26 08:13:01,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-09-26 08:13:01,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-09-26 08:13:01,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-09-26 08:13:01,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-26 08:13:01,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-09-26 08:13:01,379 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 189 [2018-09-26 08:13:01,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:01,380 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-09-26 08:13:01,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 189 states. [2018-09-26 08:13:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-09-26 08:13:01,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-26 08:13:01,380 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:01,381 INFO L375 BasicCegarLoop]: trace histogram [187, 1, 1, 1] [2018-09-26 08:13:01,381 INFO L423 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:01,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:01,381 INFO L82 PathProgramCache]: Analyzing trace with hash 499517896, now seen corresponding path program 187 times [2018-09-26 08:13:01,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:02,191 INFO L134 CoverageAnalysis]: Checked inductivity of 17578 backedges. 0 proven. 17578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:02,192 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:02,192 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [189] total 189 [2018-09-26 08:13:02,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-09-26 08:13:02,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-09-26 08:13:02,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-09-26 08:13:02,195 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 190 states. [2018-09-26 08:13:02,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:02,616 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-09-26 08:13:02,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2018-09-26 08:13:02,616 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 190 [2018-09-26 08:13:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:02,617 INFO L225 Difference]: With dead ends: 194 [2018-09-26 08:13:02,617 INFO L226 Difference]: Without dead ends: 192 [2018-09-26 08:13:02,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-09-26 08:13:02,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-09-26 08:13:02,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-09-26 08:13:02,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-09-26 08:13:02,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-09-26 08:13:02,621 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 190 [2018-09-26 08:13:02,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:02,621 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-09-26 08:13:02,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-09-26 08:13:02,621 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-09-26 08:13:02,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-09-26 08:13:02,622 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:02,622 INFO L375 BasicCegarLoop]: trace histogram [188, 1, 1, 1] [2018-09-26 08:13:02,622 INFO L423 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:02,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:02,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1694816383, now seen corresponding path program 188 times [2018-09-26 08:13:02,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:03,433 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:03,434 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:03,434 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [190] total 190 [2018-09-26 08:13:03,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 191 states [2018-09-26 08:13:03,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2018-09-26 08:13:03,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18145, Invalid=18145, Unknown=0, NotChecked=0, Total=36290 [2018-09-26 08:13:03,438 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 191 states. [2018-09-26 08:13:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:04,290 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-09-26 08:13:04,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-09-26 08:13:04,291 INFO L78 Accepts]: Start accepts. Automaton has 191 states. Word has length 191 [2018-09-26 08:13:04,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:04,291 INFO L225 Difference]: With dead ends: 195 [2018-09-26 08:13:04,291 INFO L226 Difference]: Without dead ends: 193 [2018-09-26 08:13:04,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18145, Invalid=18145, Unknown=0, NotChecked=0, Total=36290 [2018-09-26 08:13:04,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-09-26 08:13:04,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-09-26 08:13:04,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-26 08:13:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-09-26 08:13:04,296 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 191 [2018-09-26 08:13:04,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:04,296 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-09-26 08:13:04,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 191 states. [2018-09-26 08:13:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-09-26 08:13:04,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-26 08:13:04,296 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:04,297 INFO L375 BasicCegarLoop]: trace histogram [189, 1, 1, 1] [2018-09-26 08:13:04,297 INFO L423 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:04,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:04,297 INFO L82 PathProgramCache]: Analyzing trace with hash -999702296, now seen corresponding path program 189 times [2018-09-26 08:13:04,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 17955 backedges. 0 proven. 17955 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:05,057 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:05,057 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [191] total 191 [2018-09-26 08:13:05,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-09-26 08:13:05,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-09-26 08:13:05,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-09-26 08:13:05,061 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 192 states. [2018-09-26 08:13:05,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:05,950 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-09-26 08:13:05,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-09-26 08:13:05,950 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 192 [2018-09-26 08:13:05,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:05,951 INFO L225 Difference]: With dead ends: 196 [2018-09-26 08:13:05,951 INFO L226 Difference]: Without dead ends: 194 [2018-09-26 08:13:05,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-09-26 08:13:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-26 08:13:05,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-09-26 08:13:05,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-09-26 08:13:05,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-09-26 08:13:05,956 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 192 [2018-09-26 08:13:05,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:05,957 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-09-26 08:13:05,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-09-26 08:13:05,957 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-09-26 08:13:05,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-09-26 08:13:05,958 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:05,958 INFO L375 BasicCegarLoop]: trace histogram [190, 1, 1, 1] [2018-09-26 08:13:05,958 INFO L423 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:05,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:05,958 INFO L82 PathProgramCache]: Analyzing trace with hash -926002079, now seen corresponding path program 190 times [2018-09-26 08:13:05,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:06,771 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:06,771 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [192] total 192 [2018-09-26 08:13:06,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 193 states [2018-09-26 08:13:06,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2018-09-26 08:13:06,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-09-26 08:13:06,774 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 193 states. [2018-09-26 08:13:07,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:07,221 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-09-26 08:13:07,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-09-26 08:13:07,222 INFO L78 Accepts]: Start accepts. Automaton has 193 states. Word has length 193 [2018-09-26 08:13:07,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:07,222 INFO L225 Difference]: With dead ends: 197 [2018-09-26 08:13:07,222 INFO L226 Difference]: Without dead ends: 195 [2018-09-26 08:13:07,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-09-26 08:13:07,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-26 08:13:07,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-09-26 08:13:07,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-09-26 08:13:07,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-09-26 08:13:07,225 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 193 [2018-09-26 08:13:07,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:07,226 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-09-26 08:13:07,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 193 states. [2018-09-26 08:13:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-09-26 08:13:07,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-09-26 08:13:07,226 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:07,226 INFO L375 BasicCegarLoop]: trace histogram [191, 1, 1, 1] [2018-09-26 08:13:07,226 INFO L423 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:07,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:07,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1358704648, now seen corresponding path program 191 times [2018-09-26 08:13:07,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:08,004 INFO L134 CoverageAnalysis]: Checked inductivity of 18336 backedges. 0 proven. 18336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:08,004 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:08,005 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [193] total 193 [2018-09-26 08:13:08,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-09-26 08:13:08,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-09-26 08:13:08,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-09-26 08:13:08,011 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 194 states. [2018-09-26 08:13:08,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:08,269 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-09-26 08:13:08,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-09-26 08:13:08,269 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 194 [2018-09-26 08:13:08,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:08,270 INFO L225 Difference]: With dead ends: 198 [2018-09-26 08:13:08,270 INFO L226 Difference]: Without dead ends: 196 [2018-09-26 08:13:08,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-09-26 08:13:08,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-09-26 08:13:08,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-09-26 08:13:08,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-09-26 08:13:08,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-09-26 08:13:08,276 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 194 [2018-09-26 08:13:08,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:08,277 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-09-26 08:13:08,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-09-26 08:13:08,277 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-09-26 08:13:08,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-26 08:13:08,278 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:08,278 INFO L375 BasicCegarLoop]: trace histogram [192, 1, 1, 1] [2018-09-26 08:13:08,278 INFO L423 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:08,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:08,279 INFO L82 PathProgramCache]: Analyzing trace with hash -829830847, now seen corresponding path program 192 times [2018-09-26 08:13:08,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:09,141 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:09,141 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:09,142 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [194] total 194 [2018-09-26 08:13:09,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 195 states [2018-09-26 08:13:09,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2018-09-26 08:13:09,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18915, Invalid=18915, Unknown=0, NotChecked=0, Total=37830 [2018-09-26 08:13:09,146 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 195 states. [2018-09-26 08:13:09,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:09,584 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-09-26 08:13:09,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-09-26 08:13:09,584 INFO L78 Accepts]: Start accepts. Automaton has 195 states. Word has length 195 [2018-09-26 08:13:09,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:09,585 INFO L225 Difference]: With dead ends: 199 [2018-09-26 08:13:09,585 INFO L226 Difference]: Without dead ends: 197 [2018-09-26 08:13:09,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18915, Invalid=18915, Unknown=0, NotChecked=0, Total=37830 [2018-09-26 08:13:09,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-09-26 08:13:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-09-26 08:13:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-26 08:13:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-09-26 08:13:09,589 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 195 [2018-09-26 08:13:09,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:09,589 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-09-26 08:13:09,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 195 states. [2018-09-26 08:13:09,590 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-09-26 08:13:09,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-26 08:13:09,590 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:09,590 INFO L375 BasicCegarLoop]: trace histogram [193, 1, 1, 1] [2018-09-26 08:13:09,590 INFO L423 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:09,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:09,591 INFO L82 PathProgramCache]: Analyzing trace with hash 45045544, now seen corresponding path program 193 times [2018-09-26 08:13:09,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:10,494 INFO L134 CoverageAnalysis]: Checked inductivity of 18721 backedges. 0 proven. 18721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:10,494 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:10,495 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [195] total 195 [2018-09-26 08:13:10,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-09-26 08:13:10,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-09-26 08:13:10,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-09-26 08:13:10,497 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 196 states. [2018-09-26 08:13:11,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:11,324 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-09-26 08:13:11,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-09-26 08:13:11,325 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 196 [2018-09-26 08:13:11,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:11,325 INFO L225 Difference]: With dead ends: 200 [2018-09-26 08:13:11,325 INFO L226 Difference]: Without dead ends: 198 [2018-09-26 08:13:11,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-09-26 08:13:11,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-09-26 08:13:11,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-09-26 08:13:11,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-09-26 08:13:11,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-09-26 08:13:11,329 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 196 [2018-09-26 08:13:11,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:11,329 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-09-26 08:13:11,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-09-26 08:13:11,330 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-09-26 08:13:11,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-09-26 08:13:11,330 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:11,331 INFO L375 BasicCegarLoop]: trace histogram [194, 1, 1, 1] [2018-09-26 08:13:11,331 INFO L423 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:11,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:11,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1396409889, now seen corresponding path program 194 times [2018-09-26 08:13:11,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:12,275 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:12,275 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [196] total 196 [2018-09-26 08:13:12,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 197 states [2018-09-26 08:13:12,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2018-09-26 08:13:12,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2018-09-26 08:13:12,280 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 197 states. [2018-09-26 08:13:13,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:13,211 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-09-26 08:13:13,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-09-26 08:13:13,212 INFO L78 Accepts]: Start accepts. Automaton has 197 states. Word has length 197 [2018-09-26 08:13:13,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:13,212 INFO L225 Difference]: With dead ends: 201 [2018-09-26 08:13:13,212 INFO L226 Difference]: Without dead ends: 199 [2018-09-26 08:13:13,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2018-09-26 08:13:13,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-26 08:13:13,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-09-26 08:13:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-09-26 08:13:13,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-09-26 08:13:13,216 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 197 [2018-09-26 08:13:13,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:13,217 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-09-26 08:13:13,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 197 states. [2018-09-26 08:13:13,217 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-09-26 08:13:13,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-09-26 08:13:13,217 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:13,217 INFO L375 BasicCegarLoop]: trace histogram [195, 1, 1, 1] [2018-09-26 08:13:13,217 INFO L423 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:13,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:13,218 INFO L82 PathProgramCache]: Analyzing trace with hash 339031624, now seen corresponding path program 195 times [2018-09-26 08:13:13,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:14,127 INFO L134 CoverageAnalysis]: Checked inductivity of 19110 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:14,127 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:14,127 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [197] total 197 [2018-09-26 08:13:14,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-09-26 08:13:14,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-09-26 08:13:14,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-09-26 08:13:14,132 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 198 states. [2018-09-26 08:13:15,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:15,139 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-09-26 08:13:15,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-09-26 08:13:15,139 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 198 [2018-09-26 08:13:15,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:15,139 INFO L225 Difference]: With dead ends: 202 [2018-09-26 08:13:15,140 INFO L226 Difference]: Without dead ends: 200 [2018-09-26 08:13:15,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-09-26 08:13:15,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-09-26 08:13:15,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-09-26 08:13:15,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-09-26 08:13:15,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-09-26 08:13:15,145 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 198 [2018-09-26 08:13:15,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:15,145 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-09-26 08:13:15,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-09-26 08:13:15,145 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-09-26 08:13:15,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-09-26 08:13:15,146 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:15,146 INFO L375 BasicCegarLoop]: trace histogram [196, 1, 1, 1] [2018-09-26 08:13:15,146 INFO L423 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:15,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:15,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1920043777, now seen corresponding path program 196 times [2018-09-26 08:13:15,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:16,037 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:16,037 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [198] total 198 [2018-09-26 08:13:16,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 199 states [2018-09-26 08:13:16,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 199 interpolants. [2018-09-26 08:13:16,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19701, Invalid=19701, Unknown=0, NotChecked=0, Total=39402 [2018-09-26 08:13:16,039 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 199 states. [2018-09-26 08:13:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:16,908 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-09-26 08:13:16,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-09-26 08:13:16,909 INFO L78 Accepts]: Start accepts. Automaton has 199 states. Word has length 199 [2018-09-26 08:13:16,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:16,909 INFO L225 Difference]: With dead ends: 203 [2018-09-26 08:13:16,909 INFO L226 Difference]: Without dead ends: 201 [2018-09-26 08:13:16,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19701, Invalid=19701, Unknown=0, NotChecked=0, Total=39402 [2018-09-26 08:13:16,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-09-26 08:13:16,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-09-26 08:13:16,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-26 08:13:16,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-09-26 08:13:16,912 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 199 [2018-09-26 08:13:16,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:16,913 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-09-26 08:13:16,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 199 states. [2018-09-26 08:13:16,913 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-09-26 08:13:16,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-26 08:13:16,913 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:16,913 INFO L375 BasicCegarLoop]: trace histogram [197, 1, 1, 1] [2018-09-26 08:13:16,913 INFO L423 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:16,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:16,914 INFO L82 PathProgramCache]: Analyzing trace with hash -608187032, now seen corresponding path program 197 times [2018-09-26 08:13:16,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:17,786 INFO L134 CoverageAnalysis]: Checked inductivity of 19503 backedges. 0 proven. 19503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:17,786 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:17,786 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [199] total 199 [2018-09-26 08:13:17,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-09-26 08:13:17,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-09-26 08:13:17,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-09-26 08:13:17,791 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 200 states. [2018-09-26 08:13:18,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:18,621 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-09-26 08:13:18,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-09-26 08:13:18,622 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 200 [2018-09-26 08:13:18,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:18,622 INFO L225 Difference]: With dead ends: 204 [2018-09-26 08:13:18,622 INFO L226 Difference]: Without dead ends: 202 [2018-09-26 08:13:18,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-09-26 08:13:18,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-09-26 08:13:18,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-09-26 08:13:18,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-26 08:13:18,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-09-26 08:13:18,626 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 200 [2018-09-26 08:13:18,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:18,626 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-09-26 08:13:18,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-09-26 08:13:18,627 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-09-26 08:13:18,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-09-26 08:13:18,627 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:18,627 INFO L375 BasicCegarLoop]: trace histogram [198, 1, 1, 1] [2018-09-26 08:13:18,627 INFO L423 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:18,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:18,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1673930783, now seen corresponding path program 198 times [2018-09-26 08:13:18,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:19,472 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:19,472 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:19,472 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [200] total 200 [2018-09-26 08:13:19,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 201 states [2018-09-26 08:13:19,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2018-09-26 08:13:19,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20100, Invalid=20100, Unknown=0, NotChecked=0, Total=40200 [2018-09-26 08:13:19,477 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 201 states. [2018-09-26 08:13:20,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:20,206 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-09-26 08:13:20,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-09-26 08:13:20,206 INFO L78 Accepts]: Start accepts. Automaton has 201 states. Word has length 201 [2018-09-26 08:13:20,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:20,206 INFO L225 Difference]: With dead ends: 205 [2018-09-26 08:13:20,206 INFO L226 Difference]: Without dead ends: 203 [2018-09-26 08:13:20,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20100, Invalid=20100, Unknown=0, NotChecked=0, Total=40200 [2018-09-26 08:13:20,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-09-26 08:13:20,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-09-26 08:13:20,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 08:13:20,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-09-26 08:13:20,211 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 201 [2018-09-26 08:13:20,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:20,211 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-09-26 08:13:20,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 201 states. [2018-09-26 08:13:20,211 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-09-26 08:13:20,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-26 08:13:20,211 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:20,212 INFO L375 BasicCegarLoop]: trace histogram [199, 1, 1, 1] [2018-09-26 08:13:20,212 INFO L423 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:20,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:20,212 INFO L82 PathProgramCache]: Analyzing trace with hash -352248696, now seen corresponding path program 199 times [2018-09-26 08:13:20,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:21,193 INFO L134 CoverageAnalysis]: Checked inductivity of 19900 backedges. 0 proven. 19900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:21,194 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:21,194 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [201] total 201 [2018-09-26 08:13:21,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-09-26 08:13:21,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-09-26 08:13:21,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-09-26 08:13:21,197 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 202 states. [2018-09-26 08:13:21,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:21,839 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-09-26 08:13:21,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-09-26 08:13:21,840 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 202 [2018-09-26 08:13:21,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:21,840 INFO L225 Difference]: With dead ends: 206 [2018-09-26 08:13:21,840 INFO L226 Difference]: Without dead ends: 204 [2018-09-26 08:13:21,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-09-26 08:13:21,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-09-26 08:13:21,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-09-26 08:13:21,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-09-26 08:13:21,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-09-26 08:13:21,843 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 202 [2018-09-26 08:13:21,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:21,844 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-09-26 08:13:21,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-09-26 08:13:21,844 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-09-26 08:13:21,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-09-26 08:13:21,844 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:21,844 INFO L375 BasicCegarLoop]: trace histogram [200, 1, 1, 1] [2018-09-26 08:13:21,845 INFO L423 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:21,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:21,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1965190337, now seen corresponding path program 200 times [2018-09-26 08:13:21,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:22,696 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 0 proven. 20100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:22,697 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:22,697 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [202] total 202 [2018-09-26 08:13:22,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 203 states [2018-09-26 08:13:22,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2018-09-26 08:13:22,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2018-09-26 08:13:22,702 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 203 states. [2018-09-26 08:13:23,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:23,388 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-09-26 08:13:23,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-09-26 08:13:23,388 INFO L78 Accepts]: Start accepts. Automaton has 203 states. Word has length 203 [2018-09-26 08:13:23,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:23,388 INFO L225 Difference]: With dead ends: 207 [2018-09-26 08:13:23,388 INFO L226 Difference]: Without dead ends: 205 [2018-09-26 08:13:23,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2018-09-26 08:13:23,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-09-26 08:13:23,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-09-26 08:13:23,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-26 08:13:23,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-09-26 08:13:23,392 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 203 [2018-09-26 08:13:23,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:23,393 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-09-26 08:13:23,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 203 states. [2018-09-26 08:13:23,393 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-09-26 08:13:23,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-26 08:13:23,393 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:23,393 INFO L375 BasicCegarLoop]: trace histogram [201, 1, 1, 1] [2018-09-26 08:13:23,394 INFO L423 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:23,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:23,394 INFO L82 PathProgramCache]: Analyzing trace with hash 791356328, now seen corresponding path program 201 times [2018-09-26 08:13:23,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:24,295 INFO L134 CoverageAnalysis]: Checked inductivity of 20301 backedges. 0 proven. 20301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:24,295 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:24,295 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [203] total 203 [2018-09-26 08:13:24,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 204 states [2018-09-26 08:13:24,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2018-09-26 08:13:24,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-09-26 08:13:24,300 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 204 states. [2018-09-26 08:13:25,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:25,083 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-09-26 08:13:25,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-09-26 08:13:25,083 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 204 [2018-09-26 08:13:25,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:25,084 INFO L225 Difference]: With dead ends: 208 [2018-09-26 08:13:25,084 INFO L226 Difference]: Without dead ends: 206 [2018-09-26 08:13:25,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-09-26 08:13:25,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-09-26 08:13:25,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-09-26 08:13:25,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-09-26 08:13:25,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-09-26 08:13:25,089 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 204 [2018-09-26 08:13:25,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:25,089 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-09-26 08:13:25,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 204 states. [2018-09-26 08:13:25,089 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-09-26 08:13:25,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-09-26 08:13:25,090 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:25,090 INFO L375 BasicCegarLoop]: trace histogram [202, 1, 1, 1] [2018-09-26 08:13:25,090 INFO L423 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:25,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:25,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1237759583, now seen corresponding path program 202 times [2018-09-26 08:13:25,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:26,100 INFO L134 CoverageAnalysis]: Checked inductivity of 20503 backedges. 0 proven. 20503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:26,100 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:26,100 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [204] total 204 [2018-09-26 08:13:26,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 205 states [2018-09-26 08:13:26,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 205 interpolants. [2018-09-26 08:13:26,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20910, Invalid=20910, Unknown=0, NotChecked=0, Total=41820 [2018-09-26 08:13:26,104 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 205 states. [2018-09-26 08:13:26,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:26,899 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-09-26 08:13:26,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2018-09-26 08:13:26,899 INFO L78 Accepts]: Start accepts. Automaton has 205 states. Word has length 205 [2018-09-26 08:13:26,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:26,900 INFO L225 Difference]: With dead ends: 209 [2018-09-26 08:13:26,900 INFO L226 Difference]: Without dead ends: 207 [2018-09-26 08:13:26,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20910, Invalid=20910, Unknown=0, NotChecked=0, Total=41820 [2018-09-26 08:13:26,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-09-26 08:13:26,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-09-26 08:13:26,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-26 08:13:26,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-09-26 08:13:26,903 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 205 [2018-09-26 08:13:26,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:26,903 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-09-26 08:13:26,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 205 states. [2018-09-26 08:13:26,903 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-09-26 08:13:26,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-26 08:13:26,904 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:26,904 INFO L375 BasicCegarLoop]: trace histogram [203, 1, 1, 1] [2018-09-26 08:13:26,904 INFO L423 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:26,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:26,904 INFO L82 PathProgramCache]: Analyzing trace with hash 284156616, now seen corresponding path program 203 times [2018-09-26 08:13:26,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:27,817 INFO L134 CoverageAnalysis]: Checked inductivity of 20706 backedges. 0 proven. 20706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:27,818 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:27,818 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [205] total 205 [2018-09-26 08:13:27,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 206 states [2018-09-26 08:13:27,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 206 interpolants. [2018-09-26 08:13:27,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-09-26 08:13:27,822 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 206 states. [2018-09-26 08:13:28,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:28,796 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-09-26 08:13:28,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-09-26 08:13:28,796 INFO L78 Accepts]: Start accepts. Automaton has 206 states. Word has length 206 [2018-09-26 08:13:28,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:28,796 INFO L225 Difference]: With dead ends: 210 [2018-09-26 08:13:28,797 INFO L226 Difference]: Without dead ends: 208 [2018-09-26 08:13:28,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-09-26 08:13:28,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-09-26 08:13:28,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-09-26 08:13:28,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-09-26 08:13:28,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-09-26 08:13:28,803 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 206 [2018-09-26 08:13:28,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:28,803 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-09-26 08:13:28,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 206 states. [2018-09-26 08:13:28,803 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-09-26 08:13:28,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-09-26 08:13:28,803 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:28,804 INFO L375 BasicCegarLoop]: trace histogram [204, 1, 1, 1] [2018-09-26 08:13:28,804 INFO L423 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:28,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:28,804 INFO L82 PathProgramCache]: Analyzing trace with hash 218918529, now seen corresponding path program 204 times [2018-09-26 08:13:28,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:29,761 INFO L134 CoverageAnalysis]: Checked inductivity of 20910 backedges. 0 proven. 20910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:29,762 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:29,762 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [206] total 206 [2018-09-26 08:13:29,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 207 states [2018-09-26 08:13:29,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 207 interpolants. [2018-09-26 08:13:29,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21321, Invalid=21321, Unknown=0, NotChecked=0, Total=42642 [2018-09-26 08:13:29,767 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 207 states. [2018-09-26 08:13:30,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:30,936 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-09-26 08:13:30,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-09-26 08:13:30,936 INFO L78 Accepts]: Start accepts. Automaton has 207 states. Word has length 207 [2018-09-26 08:13:30,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:30,937 INFO L225 Difference]: With dead ends: 211 [2018-09-26 08:13:30,937 INFO L226 Difference]: Without dead ends: 209 [2018-09-26 08:13:30,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21321, Invalid=21321, Unknown=0, NotChecked=0, Total=42642 [2018-09-26 08:13:30,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-26 08:13:30,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-09-26 08:13:30,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-26 08:13:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-09-26 08:13:30,943 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 207 [2018-09-26 08:13:30,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:30,943 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-09-26 08:13:30,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 207 states. [2018-09-26 08:13:30,943 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-09-26 08:13:30,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-26 08:13:30,944 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:30,944 INFO L375 BasicCegarLoop]: trace histogram [205, 1, 1, 1] [2018-09-26 08:13:30,944 INFO L423 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:30,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:30,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1803462168, now seen corresponding path program 205 times [2018-09-26 08:13:30,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 21115 backedges. 0 proven. 21115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:31,973 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:31,973 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [207] total 207 [2018-09-26 08:13:31,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 208 states [2018-09-26 08:13:31,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 208 interpolants. [2018-09-26 08:13:31,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-09-26 08:13:31,976 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 208 states. [2018-09-26 08:13:33,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:33,196 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-09-26 08:13:33,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2018-09-26 08:13:33,197 INFO L78 Accepts]: Start accepts. Automaton has 208 states. Word has length 208 [2018-09-26 08:13:33,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:33,197 INFO L225 Difference]: With dead ends: 212 [2018-09-26 08:13:33,197 INFO L226 Difference]: Without dead ends: 210 [2018-09-26 08:13:33,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-09-26 08:13:33,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-09-26 08:13:33,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-09-26 08:13:33,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-09-26 08:13:33,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-09-26 08:13:33,202 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 208 [2018-09-26 08:13:33,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:33,202 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-09-26 08:13:33,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 208 states. [2018-09-26 08:13:33,202 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-09-26 08:13:33,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-09-26 08:13:33,202 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:33,203 INFO L375 BasicCegarLoop]: trace histogram [206, 1, 1, 1] [2018-09-26 08:13:33,203 INFO L423 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:33,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:33,203 INFO L82 PathProgramCache]: Analyzing trace with hash -72754335, now seen corresponding path program 206 times [2018-09-26 08:13:33,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 21321 backedges. 0 proven. 21321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:34,131 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:34,131 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [208] total 208 [2018-09-26 08:13:34,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 209 states [2018-09-26 08:13:34,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 209 interpolants. [2018-09-26 08:13:34,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21736, Invalid=21736, Unknown=0, NotChecked=0, Total=43472 [2018-09-26 08:13:34,136 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 209 states. [2018-09-26 08:13:35,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:35,260 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-09-26 08:13:35,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-09-26 08:13:35,260 INFO L78 Accepts]: Start accepts. Automaton has 209 states. Word has length 209 [2018-09-26 08:13:35,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:35,261 INFO L225 Difference]: With dead ends: 213 [2018-09-26 08:13:35,261 INFO L226 Difference]: Without dead ends: 211 [2018-09-26 08:13:35,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21736, Invalid=21736, Unknown=0, NotChecked=0, Total=43472 [2018-09-26 08:13:35,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-26 08:13:35,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-09-26 08:13:35,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-26 08:13:35,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-09-26 08:13:35,266 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 209 [2018-09-26 08:13:35,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:35,266 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-09-26 08:13:35,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 209 states. [2018-09-26 08:13:35,266 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-09-26 08:13:35,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-26 08:13:35,267 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:35,267 INFO L375 BasicCegarLoop]: trace histogram [207, 1, 1, 1] [2018-09-26 08:13:35,267 INFO L423 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:35,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:35,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2039580936, now seen corresponding path program 207 times [2018-09-26 08:13:35,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:36,336 INFO L134 CoverageAnalysis]: Checked inductivity of 21528 backedges. 0 proven. 21528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:36,336 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:36,336 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [209] total 209 [2018-09-26 08:13:36,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 210 states [2018-09-26 08:13:36,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 210 interpolants. [2018-09-26 08:13:36,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-09-26 08:13:36,343 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 210 states. [2018-09-26 08:13:37,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:37,621 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-09-26 08:13:37,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-09-26 08:13:37,621 INFO L78 Accepts]: Start accepts. Automaton has 210 states. Word has length 210 [2018-09-26 08:13:37,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:37,622 INFO L225 Difference]: With dead ends: 214 [2018-09-26 08:13:37,622 INFO L226 Difference]: Without dead ends: 212 [2018-09-26 08:13:37,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-09-26 08:13:37,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-09-26 08:13:37,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-09-26 08:13:37,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-09-26 08:13:37,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-09-26 08:13:37,628 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 210 [2018-09-26 08:13:37,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:37,629 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-09-26 08:13:37,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 210 states. [2018-09-26 08:13:37,629 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-09-26 08:13:37,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-09-26 08:13:37,630 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:37,630 INFO L375 BasicCegarLoop]: trace histogram [208, 1, 1, 1] [2018-09-26 08:13:37,630 INFO L423 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:37,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:37,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1197502399, now seen corresponding path program 208 times [2018-09-26 08:13:37,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 21736 backedges. 0 proven. 21736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:38,805 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:38,805 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [210] total 210 [2018-09-26 08:13:38,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 211 states [2018-09-26 08:13:38,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 211 interpolants. [2018-09-26 08:13:38,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22155, Invalid=22155, Unknown=0, NotChecked=0, Total=44310 [2018-09-26 08:13:38,809 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 211 states. [2018-09-26 08:13:39,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:39,442 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-09-26 08:13:39,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2018-09-26 08:13:39,442 INFO L78 Accepts]: Start accepts. Automaton has 211 states. Word has length 211 [2018-09-26 08:13:39,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:39,443 INFO L225 Difference]: With dead ends: 215 [2018-09-26 08:13:39,443 INFO L226 Difference]: Without dead ends: 213 [2018-09-26 08:13:39,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=22155, Invalid=22155, Unknown=0, NotChecked=0, Total=44310 [2018-09-26 08:13:39,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-09-26 08:13:39,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-09-26 08:13:39,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-26 08:13:39,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-09-26 08:13:39,446 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 211 [2018-09-26 08:13:39,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:39,447 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-09-26 08:13:39,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 211 states. [2018-09-26 08:13:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-09-26 08:13:39,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-26 08:13:39,447 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:39,447 INFO L375 BasicCegarLoop]: trace histogram [209, 1, 1, 1] [2018-09-26 08:13:39,447 INFO L423 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:39,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:39,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1532129320, now seen corresponding path program 209 times [2018-09-26 08:13:39,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:40,382 INFO L134 CoverageAnalysis]: Checked inductivity of 21945 backedges. 0 proven. 21945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:40,382 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:40,382 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [211] total 211 [2018-09-26 08:13:40,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 212 states [2018-09-26 08:13:40,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 212 interpolants. [2018-09-26 08:13:40,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-09-26 08:13:40,387 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 212 states. [2018-09-26 08:13:41,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:41,005 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-09-26 08:13:41,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-09-26 08:13:41,005 INFO L78 Accepts]: Start accepts. Automaton has 212 states. Word has length 212 [2018-09-26 08:13:41,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:41,006 INFO L225 Difference]: With dead ends: 216 [2018-09-26 08:13:41,006 INFO L226 Difference]: Without dead ends: 214 [2018-09-26 08:13:41,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-09-26 08:13:41,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-26 08:13:41,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-09-26 08:13:41,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-09-26 08:13:41,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2018-09-26 08:13:41,011 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 212 [2018-09-26 08:13:41,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:41,011 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2018-09-26 08:13:41,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 212 states. [2018-09-26 08:13:41,011 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2018-09-26 08:13:41,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-09-26 08:13:41,011 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:41,012 INFO L375 BasicCegarLoop]: trace histogram [210, 1, 1, 1] [2018-09-26 08:13:41,012 INFO L423 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:41,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:41,012 INFO L82 PathProgramCache]: Analyzing trace with hash 251366689, now seen corresponding path program 210 times [2018-09-26 08:13:41,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:42,123 INFO L134 CoverageAnalysis]: Checked inductivity of 22155 backedges. 0 proven. 22155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:42,124 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:42,124 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [212] total 212 [2018-09-26 08:13:42,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 213 states [2018-09-26 08:13:42,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 213 interpolants. [2018-09-26 08:13:42,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22578, Invalid=22578, Unknown=0, NotChecked=0, Total=45156 [2018-09-26 08:13:42,130 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 213 states. [2018-09-26 08:13:43,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:43,041 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-09-26 08:13:43,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-09-26 08:13:43,041 INFO L78 Accepts]: Start accepts. Automaton has 213 states. Word has length 213 [2018-09-26 08:13:43,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:43,042 INFO L225 Difference]: With dead ends: 217 [2018-09-26 08:13:43,042 INFO L226 Difference]: Without dead ends: 215 [2018-09-26 08:13:43,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=22578, Invalid=22578, Unknown=0, NotChecked=0, Total=45156 [2018-09-26 08:13:43,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-26 08:13:43,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-09-26 08:13:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-09-26 08:13:43,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-09-26 08:13:43,046 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 213 [2018-09-26 08:13:43,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:43,046 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-09-26 08:13:43,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 213 states. [2018-09-26 08:13:43,046 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-09-26 08:13:43,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-09-26 08:13:43,047 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:43,047 INFO L375 BasicCegarLoop]: trace histogram [211, 1, 1, 1] [2018-09-26 08:13:43,047 INFO L423 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:43,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:43,047 INFO L82 PathProgramCache]: Analyzing trace with hash -797569208, now seen corresponding path program 211 times [2018-09-26 08:13:43,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:44,049 INFO L134 CoverageAnalysis]: Checked inductivity of 22366 backedges. 0 proven. 22366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:44,049 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:44,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [213] total 213 [2018-09-26 08:13:44,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 214 states [2018-09-26 08:13:44,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 214 interpolants. [2018-09-26 08:13:44,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-09-26 08:13:44,055 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 214 states. [2018-09-26 08:13:45,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:45,413 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-09-26 08:13:45,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2018-09-26 08:13:45,414 INFO L78 Accepts]: Start accepts. Automaton has 214 states. Word has length 214 [2018-09-26 08:13:45,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:45,414 INFO L225 Difference]: With dead ends: 218 [2018-09-26 08:13:45,414 INFO L226 Difference]: Without dead ends: 216 [2018-09-26 08:13:45,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-09-26 08:13:45,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-09-26 08:13:45,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-09-26 08:13:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-09-26 08:13:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-09-26 08:13:45,419 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 214 [2018-09-26 08:13:45,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:45,419 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-09-26 08:13:45,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 214 states. [2018-09-26 08:13:45,419 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-09-26 08:13:45,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-09-26 08:13:45,419 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:45,420 INFO L375 BasicCegarLoop]: trace histogram [212, 1, 1, 1] [2018-09-26 08:13:45,420 INFO L423 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:45,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:45,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1045156353, now seen corresponding path program 212 times [2018-09-26 08:13:45,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 22578 backedges. 0 proven. 22578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:46,518 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:46,519 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [214] total 214 [2018-09-26 08:13:46,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 215 states [2018-09-26 08:13:46,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 215 interpolants. [2018-09-26 08:13:46,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23005, Invalid=23005, Unknown=0, NotChecked=0, Total=46010 [2018-09-26 08:13:46,524 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 215 states. [2018-09-26 08:13:47,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:47,692 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-09-26 08:13:47,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-09-26 08:13:47,692 INFO L78 Accepts]: Start accepts. Automaton has 215 states. Word has length 215 [2018-09-26 08:13:47,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:47,692 INFO L225 Difference]: With dead ends: 219 [2018-09-26 08:13:47,692 INFO L226 Difference]: Without dead ends: 217 [2018-09-26 08:13:47,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23005, Invalid=23005, Unknown=0, NotChecked=0, Total=46010 [2018-09-26 08:13:47,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-09-26 08:13:47,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-09-26 08:13:47,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-26 08:13:47,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-09-26 08:13:47,698 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 215 [2018-09-26 08:13:47,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:47,698 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-09-26 08:13:47,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 215 states. [2018-09-26 08:13:47,699 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-09-26 08:13:47,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-26 08:13:47,699 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:47,699 INFO L375 BasicCegarLoop]: trace histogram [213, 1, 1, 1] [2018-09-26 08:13:47,699 INFO L423 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:47,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:47,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1959893400, now seen corresponding path program 213 times [2018-09-26 08:13:47,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:48,857 INFO L134 CoverageAnalysis]: Checked inductivity of 22791 backedges. 0 proven. 22791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:48,857 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:48,857 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [215] total 215 [2018-09-26 08:13:48,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 216 states [2018-09-26 08:13:48,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2018-09-26 08:13:48,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-09-26 08:13:48,861 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 216 states. [2018-09-26 08:13:49,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:49,311 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-09-26 08:13:49,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-09-26 08:13:49,312 INFO L78 Accepts]: Start accepts. Automaton has 216 states. Word has length 216 [2018-09-26 08:13:49,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:49,312 INFO L225 Difference]: With dead ends: 220 [2018-09-26 08:13:49,312 INFO L226 Difference]: Without dead ends: 218 [2018-09-26 08:13:49,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-09-26 08:13:49,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-09-26 08:13:49,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-09-26 08:13:49,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-09-26 08:13:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-09-26 08:13:49,316 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 216 [2018-09-26 08:13:49,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:49,316 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-09-26 08:13:49,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 216 states. [2018-09-26 08:13:49,317 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-09-26 08:13:49,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-09-26 08:13:49,317 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:49,317 INFO L375 BasicCegarLoop]: trace histogram [214, 1, 1, 1] [2018-09-26 08:13:49,317 INFO L423 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:49,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:49,318 INFO L82 PathProgramCache]: Analyzing trace with hash -627155231, now seen corresponding path program 214 times [2018-09-26 08:13:49,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:50,447 INFO L134 CoverageAnalysis]: Checked inductivity of 23005 backedges. 0 proven. 23005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:50,448 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:50,448 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [216] total 216 [2018-09-26 08:13:50,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 217 states [2018-09-26 08:13:50,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 217 interpolants. [2018-09-26 08:13:50,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23436, Invalid=23436, Unknown=0, NotChecked=0, Total=46872 [2018-09-26 08:13:50,454 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 217 states. [2018-09-26 08:13:51,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:51,207 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-09-26 08:13:51,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2018-09-26 08:13:51,207 INFO L78 Accepts]: Start accepts. Automaton has 217 states. Word has length 217 [2018-09-26 08:13:51,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:51,207 INFO L225 Difference]: With dead ends: 221 [2018-09-26 08:13:51,208 INFO L226 Difference]: Without dead ends: 219 [2018-09-26 08:13:51,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23436, Invalid=23436, Unknown=0, NotChecked=0, Total=46872 [2018-09-26 08:13:51,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-26 08:13:51,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-09-26 08:13:51,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-09-26 08:13:51,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-09-26 08:13:51,213 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 217 [2018-09-26 08:13:51,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:51,213 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-09-26 08:13:51,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 217 states. [2018-09-26 08:13:51,213 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-09-26 08:13:51,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-09-26 08:13:51,213 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:51,214 INFO L375 BasicCegarLoop]: trace histogram [215, 1, 1, 1] [2018-09-26 08:13:51,214 INFO L423 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:51,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:51,214 INFO L82 PathProgramCache]: Analyzing trace with hash 2033022344, now seen corresponding path program 215 times [2018-09-26 08:13:51,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:52,260 INFO L134 CoverageAnalysis]: Checked inductivity of 23220 backedges. 0 proven. 23220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:52,261 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:52,261 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [217] total 217 [2018-09-26 08:13:52,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 218 states [2018-09-26 08:13:52,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 218 interpolants. [2018-09-26 08:13:52,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-09-26 08:13:52,267 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 218 states. [2018-09-26 08:13:53,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:53,669 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-09-26 08:13:53,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2018-09-26 08:13:53,669 INFO L78 Accepts]: Start accepts. Automaton has 218 states. Word has length 218 [2018-09-26 08:13:53,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:53,670 INFO L225 Difference]: With dead ends: 222 [2018-09-26 08:13:53,670 INFO L226 Difference]: Without dead ends: 220 [2018-09-26 08:13:53,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-09-26 08:13:53,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-09-26 08:13:53,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-09-26 08:13:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-09-26 08:13:53,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-09-26 08:13:53,674 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 218 [2018-09-26 08:13:53,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:53,675 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-09-26 08:13:53,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 218 states. [2018-09-26 08:13:53,675 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-09-26 08:13:53,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-09-26 08:13:53,675 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:53,675 INFO L375 BasicCegarLoop]: trace histogram [216, 1, 1, 1] [2018-09-26 08:13:53,676 INFO L423 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:53,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:53,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1400818751, now seen corresponding path program 216 times [2018-09-26 08:13:53,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:54,880 INFO L134 CoverageAnalysis]: Checked inductivity of 23436 backedges. 0 proven. 23436 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:54,880 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:54,881 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [218] total 218 [2018-09-26 08:13:54,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 219 states [2018-09-26 08:13:54,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 219 interpolants. [2018-09-26 08:13:54,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23871, Invalid=23871, Unknown=0, NotChecked=0, Total=47742 [2018-09-26 08:13:54,886 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 219 states. [2018-09-26 08:13:55,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:55,915 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-09-26 08:13:55,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-09-26 08:13:55,916 INFO L78 Accepts]: Start accepts. Automaton has 219 states. Word has length 219 [2018-09-26 08:13:55,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:55,916 INFO L225 Difference]: With dead ends: 223 [2018-09-26 08:13:55,916 INFO L226 Difference]: Without dead ends: 221 [2018-09-26 08:13:55,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=23871, Invalid=23871, Unknown=0, NotChecked=0, Total=47742 [2018-09-26 08:13:55,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-09-26 08:13:55,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-09-26 08:13:55,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-26 08:13:55,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-09-26 08:13:55,920 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 219 [2018-09-26 08:13:55,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:55,920 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-09-26 08:13:55,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 219 states. [2018-09-26 08:13:55,921 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-09-26 08:13:55,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-26 08:13:55,921 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:55,921 INFO L375 BasicCegarLoop]: trace histogram [217, 1, 1, 1] [2018-09-26 08:13:55,921 INFO L423 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:55,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:55,922 INFO L82 PathProgramCache]: Analyzing trace with hash -475710296, now seen corresponding path program 217 times [2018-09-26 08:13:55,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:56,958 INFO L134 CoverageAnalysis]: Checked inductivity of 23653 backedges. 0 proven. 23653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:56,959 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:56,959 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [219] total 219 [2018-09-26 08:13:56,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 220 states [2018-09-26 08:13:56,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 220 interpolants. [2018-09-26 08:13:56,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-09-26 08:13:56,965 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 220 states. [2018-09-26 08:13:57,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:13:57,789 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-09-26 08:13:57,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-09-26 08:13:57,789 INFO L78 Accepts]: Start accepts. Automaton has 220 states. Word has length 220 [2018-09-26 08:13:57,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:13:57,790 INFO L225 Difference]: With dead ends: 224 [2018-09-26 08:13:57,790 INFO L226 Difference]: Without dead ends: 222 [2018-09-26 08:13:57,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-09-26 08:13:57,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-09-26 08:13:57,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-09-26 08:13:57,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-09-26 08:13:57,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-09-26 08:13:57,795 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 220 [2018-09-26 08:13:57,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:13:57,795 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-09-26 08:13:57,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 220 states. [2018-09-26 08:13:57,795 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-09-26 08:13:57,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-09-26 08:13:57,796 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:13:57,796 INFO L375 BasicCegarLoop]: trace histogram [218, 1, 1, 1] [2018-09-26 08:13:57,796 INFO L423 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:13:57,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:13:57,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1862119263, now seen corresponding path program 218 times [2018-09-26 08:13:57,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:13:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:13:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 23871 backedges. 0 proven. 23871 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:13:58,934 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:13:58,934 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [220] total 220 [2018-09-26 08:13:58,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 221 states [2018-09-26 08:13:58,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 221 interpolants. [2018-09-26 08:13:58,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24310, Invalid=24310, Unknown=0, NotChecked=0, Total=48620 [2018-09-26 08:13:58,937 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 221 states. [2018-09-26 08:14:00,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:00,604 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-09-26 08:14:00,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-09-26 08:14:00,604 INFO L78 Accepts]: Start accepts. Automaton has 221 states. Word has length 221 [2018-09-26 08:14:00,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:00,605 INFO L225 Difference]: With dead ends: 225 [2018-09-26 08:14:00,605 INFO L226 Difference]: Without dead ends: 223 [2018-09-26 08:14:00,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=24310, Invalid=24310, Unknown=0, NotChecked=0, Total=48620 [2018-09-26 08:14:00,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-09-26 08:14:00,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-09-26 08:14:00,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-09-26 08:14:00,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-09-26 08:14:00,609 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 221 [2018-09-26 08:14:00,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:00,609 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-09-26 08:14:00,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 221 states. [2018-09-26 08:14:00,609 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-09-26 08:14:00,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-09-26 08:14:00,610 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:00,610 INFO L375 BasicCegarLoop]: trace histogram [219, 1, 1, 1] [2018-09-26 08:14:00,610 INFO L423 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:00,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:00,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1891124280, now seen corresponding path program 219 times [2018-09-26 08:14:00,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:01,840 INFO L134 CoverageAnalysis]: Checked inductivity of 24090 backedges. 0 proven. 24090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:01,840 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:01,840 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [221] total 221 [2018-09-26 08:14:01,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 222 states [2018-09-26 08:14:01,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 222 interpolants. [2018-09-26 08:14:01,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-09-26 08:14:01,847 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 222 states. [2018-09-26 08:14:02,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:02,546 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-09-26 08:14:02,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2018-09-26 08:14:02,546 INFO L78 Accepts]: Start accepts. Automaton has 222 states. Word has length 222 [2018-09-26 08:14:02,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:02,547 INFO L225 Difference]: With dead ends: 226 [2018-09-26 08:14:02,547 INFO L226 Difference]: Without dead ends: 224 [2018-09-26 08:14:02,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-09-26 08:14:02,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-09-26 08:14:02,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-09-26 08:14:02,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-09-26 08:14:02,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2018-09-26 08:14:02,554 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 222 [2018-09-26 08:14:02,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:02,554 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2018-09-26 08:14:02,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 222 states. [2018-09-26 08:14:02,554 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2018-09-26 08:14:02,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-09-26 08:14:02,555 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:02,555 INFO L375 BasicCegarLoop]: trace histogram [220, 1, 1, 1] [2018-09-26 08:14:02,556 INFO L423 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:02,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:02,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1504687489, now seen corresponding path program 220 times [2018-09-26 08:14:02,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:03,995 INFO L134 CoverageAnalysis]: Checked inductivity of 24310 backedges. 0 proven. 24310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:03,996 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:03,996 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [222] total 222 [2018-09-26 08:14:03,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 223 states [2018-09-26 08:14:04,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 223 interpolants. [2018-09-26 08:14:04,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24753, Invalid=24753, Unknown=0, NotChecked=0, Total=49506 [2018-09-26 08:14:04,004 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 223 states. [2018-09-26 08:14:05,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:05,128 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-09-26 08:14:05,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2018-09-26 08:14:05,128 INFO L78 Accepts]: Start accepts. Automaton has 223 states. Word has length 223 [2018-09-26 08:14:05,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:05,129 INFO L225 Difference]: With dead ends: 227 [2018-09-26 08:14:05,129 INFO L226 Difference]: Without dead ends: 225 [2018-09-26 08:14:05,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=24753, Invalid=24753, Unknown=0, NotChecked=0, Total=49506 [2018-09-26 08:14:05,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-09-26 08:14:05,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-09-26 08:14:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-26 08:14:05,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-09-26 08:14:05,135 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 223 [2018-09-26 08:14:05,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:05,135 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-09-26 08:14:05,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 223 states. [2018-09-26 08:14:05,135 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-09-26 08:14:05,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-26 08:14:05,136 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:05,136 INFO L375 BasicCegarLoop]: trace histogram [221, 1, 1, 1] [2018-09-26 08:14:05,136 INFO L423 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:05,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:05,136 INFO L82 PathProgramCache]: Analyzing trace with hash -599330072, now seen corresponding path program 221 times [2018-09-26 08:14:05,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 24531 backedges. 0 proven. 24531 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:06,314 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:06,314 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [223] total 223 [2018-09-26 08:14:06,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 224 states [2018-09-26 08:14:06,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 224 interpolants. [2018-09-26 08:14:06,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-09-26 08:14:06,319 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 224 states. [2018-09-26 08:14:08,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:08,041 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-09-26 08:14:08,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2018-09-26 08:14:08,041 INFO L78 Accepts]: Start accepts. Automaton has 224 states. Word has length 224 [2018-09-26 08:14:08,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:08,042 INFO L225 Difference]: With dead ends: 228 [2018-09-26 08:14:08,042 INFO L226 Difference]: Without dead ends: 226 [2018-09-26 08:14:08,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-09-26 08:14:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-09-26 08:14:08,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2018-09-26 08:14:08,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-09-26 08:14:08,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-09-26 08:14:08,047 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 224 [2018-09-26 08:14:08,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:08,047 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-09-26 08:14:08,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 224 states. [2018-09-26 08:14:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-09-26 08:14:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-09-26 08:14:08,048 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:08,048 INFO L375 BasicCegarLoop]: trace histogram [222, 1, 1, 1] [2018-09-26 08:14:08,048 INFO L423 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:08,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:08,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1399365023, now seen corresponding path program 222 times [2018-09-26 08:14:08,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 24753 backedges. 0 proven. 24753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:09,229 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:09,229 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [224] total 224 [2018-09-26 08:14:09,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 225 states [2018-09-26 08:14:09,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 225 interpolants. [2018-09-26 08:14:09,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25200, Invalid=25200, Unknown=0, NotChecked=0, Total=50400 [2018-09-26 08:14:09,235 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 225 states. [2018-09-26 08:14:10,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:10,071 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-09-26 08:14:10,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2018-09-26 08:14:10,071 INFO L78 Accepts]: Start accepts. Automaton has 225 states. Word has length 225 [2018-09-26 08:14:10,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:10,071 INFO L225 Difference]: With dead ends: 229 [2018-09-26 08:14:10,071 INFO L226 Difference]: Without dead ends: 227 [2018-09-26 08:14:10,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25200, Invalid=25200, Unknown=0, NotChecked=0, Total=50400 [2018-09-26 08:14:10,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-09-26 08:14:10,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-09-26 08:14:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-26 08:14:10,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-09-26 08:14:10,076 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 225 [2018-09-26 08:14:10,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:10,077 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-09-26 08:14:10,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 225 states. [2018-09-26 08:14:10,077 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-09-26 08:14:10,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-26 08:14:10,077 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:10,077 INFO L375 BasicCegarLoop]: trace histogram [223, 1, 1, 1] [2018-09-26 08:14:10,077 INFO L423 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:10,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:10,078 INFO L82 PathProgramCache]: Analyzing trace with hash -430644728, now seen corresponding path program 223 times [2018-09-26 08:14:10,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 24976 backedges. 0 proven. 24976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:11,230 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:11,231 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [225] total 225 [2018-09-26 08:14:11,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 226 states [2018-09-26 08:14:11,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 226 interpolants. [2018-09-26 08:14:11,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-09-26 08:14:11,234 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 226 states. [2018-09-26 08:14:12,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:12,770 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-09-26 08:14:12,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 226 states. [2018-09-26 08:14:12,770 INFO L78 Accepts]: Start accepts. Automaton has 226 states. Word has length 226 [2018-09-26 08:14:12,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:12,771 INFO L225 Difference]: With dead ends: 230 [2018-09-26 08:14:12,771 INFO L226 Difference]: Without dead ends: 228 [2018-09-26 08:14:12,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-09-26 08:14:12,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-09-26 08:14:12,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-09-26 08:14:12,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-09-26 08:14:12,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-09-26 08:14:12,775 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 226 [2018-09-26 08:14:12,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:12,775 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-09-26 08:14:12,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 226 states. [2018-09-26 08:14:12,776 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-09-26 08:14:12,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-09-26 08:14:12,776 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:12,776 INFO L375 BasicCegarLoop]: trace histogram [224, 1, 1, 1] [2018-09-26 08:14:12,776 INFO L423 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:12,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:12,777 INFO L82 PathProgramCache]: Analyzing trace with hash -465086655, now seen corresponding path program 224 times [2018-09-26 08:14:12,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:13,937 INFO L134 CoverageAnalysis]: Checked inductivity of 25200 backedges. 0 proven. 25200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:13,937 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:13,937 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [226] total 226 [2018-09-26 08:14:13,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 227 states [2018-09-26 08:14:13,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 227 interpolants. [2018-09-26 08:14:13,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25651, Invalid=25651, Unknown=0, NotChecked=0, Total=51302 [2018-09-26 08:14:13,943 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 227 states. [2018-09-26 08:14:14,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:14,392 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-09-26 08:14:14,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2018-09-26 08:14:14,392 INFO L78 Accepts]: Start accepts. Automaton has 227 states. Word has length 227 [2018-09-26 08:14:14,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:14,393 INFO L225 Difference]: With dead ends: 231 [2018-09-26 08:14:14,393 INFO L226 Difference]: Without dead ends: 229 [2018-09-26 08:14:14,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25651, Invalid=25651, Unknown=0, NotChecked=0, Total=51302 [2018-09-26 08:14:14,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-26 08:14:14,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-09-26 08:14:14,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-26 08:14:14,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-09-26 08:14:14,398 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 227 [2018-09-26 08:14:14,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:14,398 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-09-26 08:14:14,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 227 states. [2018-09-26 08:14:14,398 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-09-26 08:14:14,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-26 08:14:14,399 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:14,399 INFO L375 BasicCegarLoop]: trace histogram [225, 1, 1, 1] [2018-09-26 08:14:14,399 INFO L423 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:14,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:14,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1532786392, now seen corresponding path program 225 times [2018-09-26 08:14:14,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 25425 backedges. 0 proven. 25425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:15,568 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:15,568 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [227] total 227 [2018-09-26 08:14:15,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 228 states [2018-09-26 08:14:15,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 228 interpolants. [2018-09-26 08:14:15,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25878, Invalid=25878, Unknown=0, NotChecked=0, Total=51756 [2018-09-26 08:14:15,576 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 228 states. [2018-09-26 08:14:17,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:17,249 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-09-26 08:14:17,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2018-09-26 08:14:17,250 INFO L78 Accepts]: Start accepts. Automaton has 228 states. Word has length 228 [2018-09-26 08:14:17,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:17,250 INFO L225 Difference]: With dead ends: 232 [2018-09-26 08:14:17,250 INFO L226 Difference]: Without dead ends: 230 [2018-09-26 08:14:17,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=25878, Invalid=25878, Unknown=0, NotChecked=0, Total=51756 [2018-09-26 08:14:17,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-09-26 08:14:17,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2018-09-26 08:14:17,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-09-26 08:14:17,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-09-26 08:14:17,254 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 228 [2018-09-26 08:14:17,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:17,254 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-09-26 08:14:17,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 228 states. [2018-09-26 08:14:17,255 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-09-26 08:14:17,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-09-26 08:14:17,255 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:17,255 INFO L375 BasicCegarLoop]: trace histogram [226, 1, 1, 1] [2018-09-26 08:14:17,255 INFO L423 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:17,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:17,256 INFO L82 PathProgramCache]: Analyzing trace with hash -271739871, now seen corresponding path program 226 times [2018-09-26 08:14:17,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:18,542 INFO L134 CoverageAnalysis]: Checked inductivity of 25651 backedges. 0 proven. 25651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:18,542 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:18,542 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [228] total 228 [2018-09-26 08:14:18,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 229 states [2018-09-26 08:14:18,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 229 interpolants. [2018-09-26 08:14:18,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26106, Invalid=26106, Unknown=0, NotChecked=0, Total=52212 [2018-09-26 08:14:18,549 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 229 states. [2018-09-26 08:14:19,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:19,640 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-09-26 08:14:19,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2018-09-26 08:14:19,640 INFO L78 Accepts]: Start accepts. Automaton has 229 states. Word has length 229 [2018-09-26 08:14:19,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:19,641 INFO L225 Difference]: With dead ends: 233 [2018-09-26 08:14:19,641 INFO L226 Difference]: Without dead ends: 231 [2018-09-26 08:14:19,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=26106, Invalid=26106, Unknown=0, NotChecked=0, Total=52212 [2018-09-26 08:14:19,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-09-26 08:14:19,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-09-26 08:14:19,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-09-26 08:14:19,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-09-26 08:14:19,646 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 229 [2018-09-26 08:14:19,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:19,647 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-09-26 08:14:19,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 229 states. [2018-09-26 08:14:19,647 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-09-26 08:14:19,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-26 08:14:19,647 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:19,647 INFO L375 BasicCegarLoop]: trace histogram [227, 1, 1, 1] [2018-09-26 08:14:19,648 INFO L423 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:19,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:19,648 INFO L82 PathProgramCache]: Analyzing trace with hash 165996616, now seen corresponding path program 227 times [2018-09-26 08:14:19,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:20,837 INFO L134 CoverageAnalysis]: Checked inductivity of 25878 backedges. 0 proven. 25878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:20,837 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:20,837 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [229] total 229 [2018-09-26 08:14:20,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 230 states [2018-09-26 08:14:20,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 230 interpolants. [2018-09-26 08:14:20,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26335, Invalid=26335, Unknown=0, NotChecked=0, Total=52670 [2018-09-26 08:14:20,843 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 230 states. [2018-09-26 08:14:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:22,643 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-09-26 08:14:22,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2018-09-26 08:14:22,644 INFO L78 Accepts]: Start accepts. Automaton has 230 states. Word has length 230 [2018-09-26 08:14:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:22,644 INFO L225 Difference]: With dead ends: 234 [2018-09-26 08:14:22,644 INFO L226 Difference]: Without dead ends: 232 [2018-09-26 08:14:22,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=26335, Invalid=26335, Unknown=0, NotChecked=0, Total=52670 [2018-09-26 08:14:22,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-09-26 08:14:22,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2018-09-26 08:14:22,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-09-26 08:14:22,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2018-09-26 08:14:22,651 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 230 [2018-09-26 08:14:22,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:22,651 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2018-09-26 08:14:22,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 230 states. [2018-09-26 08:14:22,652 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2018-09-26 08:14:22,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-09-26 08:14:22,652 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:22,652 INFO L375 BasicCegarLoop]: trace histogram [228, 1, 1, 1] [2018-09-26 08:14:22,652 INFO L423 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:22,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:22,653 INFO L82 PathProgramCache]: Analyzing trace with hash 850925825, now seen corresponding path program 228 times [2018-09-26 08:14:22,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 26106 backedges. 0 proven. 26106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:23,986 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:23,986 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [230] total 230 [2018-09-26 08:14:23,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 231 states [2018-09-26 08:14:23,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 231 interpolants. [2018-09-26 08:14:23,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26565, Invalid=26565, Unknown=0, NotChecked=0, Total=53130 [2018-09-26 08:14:23,992 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 231 states. [2018-09-26 08:14:24,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:24,521 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-09-26 08:14:24,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2018-09-26 08:14:24,522 INFO L78 Accepts]: Start accepts. Automaton has 231 states. Word has length 231 [2018-09-26 08:14:24,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:24,522 INFO L225 Difference]: With dead ends: 235 [2018-09-26 08:14:24,522 INFO L226 Difference]: Without dead ends: 233 [2018-09-26 08:14:24,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=26565, Invalid=26565, Unknown=0, NotChecked=0, Total=53130 [2018-09-26 08:14:24,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-09-26 08:14:24,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-09-26 08:14:24,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-26 08:14:24,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-09-26 08:14:24,527 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 231 [2018-09-26 08:14:24,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:24,527 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-09-26 08:14:24,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 231 states. [2018-09-26 08:14:24,527 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-09-26 08:14:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-26 08:14:24,528 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:24,528 INFO L375 BasicCegarLoop]: trace histogram [229, 1, 1, 1] [2018-09-26 08:14:24,528 INFO L423 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:24,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:24,528 INFO L82 PathProgramCache]: Analyzing trace with hash 608894824, now seen corresponding path program 229 times [2018-09-26 08:14:24,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:25,737 INFO L134 CoverageAnalysis]: Checked inductivity of 26335 backedges. 0 proven. 26335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:25,737 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:25,737 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [231] total 231 [2018-09-26 08:14:25,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 232 states [2018-09-26 08:14:25,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 232 interpolants. [2018-09-26 08:14:25,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26796, Invalid=26796, Unknown=0, NotChecked=0, Total=53592 [2018-09-26 08:14:25,744 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 232 states. [2018-09-26 08:14:27,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:27,384 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-09-26 08:14:27,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2018-09-26 08:14:27,384 INFO L78 Accepts]: Start accepts. Automaton has 232 states. Word has length 232 [2018-09-26 08:14:27,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:27,385 INFO L225 Difference]: With dead ends: 236 [2018-09-26 08:14:27,385 INFO L226 Difference]: Without dead ends: 234 [2018-09-26 08:14:27,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=26796, Invalid=26796, Unknown=0, NotChecked=0, Total=53592 [2018-09-26 08:14:27,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-26 08:14:27,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-09-26 08:14:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-09-26 08:14:27,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 234 transitions. [2018-09-26 08:14:27,391 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 234 transitions. Word has length 232 [2018-09-26 08:14:27,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:27,391 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 234 transitions. [2018-09-26 08:14:27,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 232 states. [2018-09-26 08:14:27,391 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 234 transitions. [2018-09-26 08:14:27,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-09-26 08:14:27,392 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:27,392 INFO L375 BasicCegarLoop]: trace histogram [230, 1, 1, 1] [2018-09-26 08:14:27,392 INFO L423 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:27,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:27,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1695868385, now seen corresponding path program 230 times [2018-09-26 08:14:27,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:28,671 INFO L134 CoverageAnalysis]: Checked inductivity of 26565 backedges. 0 proven. 26565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:28,672 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:28,672 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [232] total 232 [2018-09-26 08:14:28,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 233 states [2018-09-26 08:14:28,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 233 interpolants. [2018-09-26 08:14:28,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27028, Invalid=27028, Unknown=0, NotChecked=0, Total=54056 [2018-09-26 08:14:28,676 INFO L87 Difference]: Start difference. First operand 234 states and 234 transitions. Second operand 233 states. [2018-09-26 08:14:29,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:29,778 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-09-26 08:14:29,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2018-09-26 08:14:29,778 INFO L78 Accepts]: Start accepts. Automaton has 233 states. Word has length 233 [2018-09-26 08:14:29,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:29,778 INFO L225 Difference]: With dead ends: 237 [2018-09-26 08:14:29,778 INFO L226 Difference]: Without dead ends: 235 [2018-09-26 08:14:29,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27028, Invalid=27028, Unknown=0, NotChecked=0, Total=54056 [2018-09-26 08:14:29,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-26 08:14:29,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-09-26 08:14:29,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-09-26 08:14:29,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-09-26 08:14:29,783 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 233 [2018-09-26 08:14:29,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:29,783 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-09-26 08:14:29,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 233 states. [2018-09-26 08:14:29,784 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-09-26 08:14:29,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-09-26 08:14:29,784 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:29,784 INFO L375 BasicCegarLoop]: trace histogram [231, 1, 1, 1] [2018-09-26 08:14:29,784 INFO L423 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:29,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:29,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1032310408, now seen corresponding path program 231 times [2018-09-26 08:14:29,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:30,981 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 26796 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:30,982 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:30,982 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [233] total 233 [2018-09-26 08:14:30,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 234 states [2018-09-26 08:14:30,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 234 interpolants. [2018-09-26 08:14:30,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27261, Invalid=27261, Unknown=0, NotChecked=0, Total=54522 [2018-09-26 08:14:30,989 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 234 states. [2018-09-26 08:14:31,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:31,949 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-09-26 08:14:31,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2018-09-26 08:14:31,949 INFO L78 Accepts]: Start accepts. Automaton has 234 states. Word has length 234 [2018-09-26 08:14:31,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:31,949 INFO L225 Difference]: With dead ends: 238 [2018-09-26 08:14:31,949 INFO L226 Difference]: Without dead ends: 236 [2018-09-26 08:14:31,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=27261, Invalid=27261, Unknown=0, NotChecked=0, Total=54522 [2018-09-26 08:14:31,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-09-26 08:14:31,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2018-09-26 08:14:31,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-09-26 08:14:31,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-09-26 08:14:31,957 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 234 [2018-09-26 08:14:31,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:31,957 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-09-26 08:14:31,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 234 states. [2018-09-26 08:14:31,957 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-09-26 08:14:31,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-09-26 08:14:31,958 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:31,958 INFO L375 BasicCegarLoop]: trace histogram [232, 1, 1, 1] [2018-09-26 08:14:31,958 INFO L423 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:31,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:31,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1936849601, now seen corresponding path program 232 times [2018-09-26 08:14:31,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 27028 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:33,403 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:33,403 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [234] total 234 [2018-09-26 08:14:33,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 235 states [2018-09-26 08:14:33,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 235 interpolants. [2018-09-26 08:14:33,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27495, Invalid=27495, Unknown=0, NotChecked=0, Total=54990 [2018-09-26 08:14:33,407 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 235 states. [2018-09-26 08:14:34,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:34,834 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-09-26 08:14:34,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2018-09-26 08:14:34,834 INFO L78 Accepts]: Start accepts. Automaton has 235 states. Word has length 235 [2018-09-26 08:14:34,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:34,835 INFO L225 Difference]: With dead ends: 239 [2018-09-26 08:14:34,835 INFO L226 Difference]: Without dead ends: 237 [2018-09-26 08:14:34,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=27495, Invalid=27495, Unknown=0, NotChecked=0, Total=54990 [2018-09-26 08:14:34,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-26 08:14:34,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-09-26 08:14:34,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-26 08:14:34,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-09-26 08:14:34,839 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 235 [2018-09-26 08:14:34,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:34,839 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-09-26 08:14:34,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 235 states. [2018-09-26 08:14:34,839 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-09-26 08:14:34,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-26 08:14:34,840 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:34,840 INFO L375 BasicCegarLoop]: trace histogram [233, 1, 1, 1] [2018-09-26 08:14:34,840 INFO L423 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:34,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:34,840 INFO L82 PathProgramCache]: Analyzing trace with hash -87206488, now seen corresponding path program 233 times [2018-09-26 08:14:34,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:36,099 INFO L134 CoverageAnalysis]: Checked inductivity of 27261 backedges. 0 proven. 27261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:36,099 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:36,100 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [235] total 235 [2018-09-26 08:14:36,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 236 states [2018-09-26 08:14:36,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 236 interpolants. [2018-09-26 08:14:36,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27730, Invalid=27730, Unknown=0, NotChecked=0, Total=55460 [2018-09-26 08:14:36,106 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 236 states. [2018-09-26 08:14:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:37,310 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-09-26 08:14:37,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2018-09-26 08:14:37,311 INFO L78 Accepts]: Start accepts. Automaton has 236 states. Word has length 236 [2018-09-26 08:14:37,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:37,311 INFO L225 Difference]: With dead ends: 240 [2018-09-26 08:14:37,312 INFO L226 Difference]: Without dead ends: 238 [2018-09-26 08:14:37,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27730, Invalid=27730, Unknown=0, NotChecked=0, Total=55460 [2018-09-26 08:14:37,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-09-26 08:14:37,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-09-26 08:14:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-09-26 08:14:37,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-09-26 08:14:37,318 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 236 [2018-09-26 08:14:37,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:37,319 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-09-26 08:14:37,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 236 states. [2018-09-26 08:14:37,319 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-09-26 08:14:37,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-09-26 08:14:37,319 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:37,319 INFO L375 BasicCegarLoop]: trace histogram [234, 1, 1, 1] [2018-09-26 08:14:37,320 INFO L423 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:37,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:37,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1591564193, now seen corresponding path program 234 times [2018-09-26 08:14:37,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:38,702 INFO L134 CoverageAnalysis]: Checked inductivity of 27495 backedges. 0 proven. 27495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:38,703 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:38,703 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [236] total 236 [2018-09-26 08:14:38,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 237 states [2018-09-26 08:14:38,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 237 interpolants. [2018-09-26 08:14:38,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27966, Invalid=27966, Unknown=0, NotChecked=0, Total=55932 [2018-09-26 08:14:38,711 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 237 states. [2018-09-26 08:14:39,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:39,916 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-09-26 08:14:39,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 237 states. [2018-09-26 08:14:39,916 INFO L78 Accepts]: Start accepts. Automaton has 237 states. Word has length 237 [2018-09-26 08:14:39,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:39,916 INFO L225 Difference]: With dead ends: 241 [2018-09-26 08:14:39,917 INFO L226 Difference]: Without dead ends: 239 [2018-09-26 08:14:39,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=27966, Invalid=27966, Unknown=0, NotChecked=0, Total=55932 [2018-09-26 08:14:39,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-26 08:14:39,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-09-26 08:14:39,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-09-26 08:14:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-09-26 08:14:39,920 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 237 [2018-09-26 08:14:39,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:39,920 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-09-26 08:14:39,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 237 states. [2018-09-26 08:14:39,920 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-09-26 08:14:39,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-09-26 08:14:39,921 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:39,921 INFO L375 BasicCegarLoop]: trace histogram [235, 1, 1, 1] [2018-09-26 08:14:39,921 INFO L423 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:39,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:39,921 INFO L82 PathProgramCache]: Analyzing trace with hash 2093847752, now seen corresponding path program 235 times [2018-09-26 08:14:39,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 27730 backedges. 0 proven. 27730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:41,149 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:41,150 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [237] total 237 [2018-09-26 08:14:41,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 238 states [2018-09-26 08:14:41,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 238 interpolants. [2018-09-26 08:14:41,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28203, Invalid=28203, Unknown=0, NotChecked=0, Total=56406 [2018-09-26 08:14:41,156 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 238 states. [2018-09-26 08:14:42,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:42,577 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2018-09-26 08:14:42,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2018-09-26 08:14:42,577 INFO L78 Accepts]: Start accepts. Automaton has 238 states. Word has length 238 [2018-09-26 08:14:42,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:42,577 INFO L225 Difference]: With dead ends: 242 [2018-09-26 08:14:42,577 INFO L226 Difference]: Without dead ends: 240 [2018-09-26 08:14:42,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=28203, Invalid=28203, Unknown=0, NotChecked=0, Total=56406 [2018-09-26 08:14:42,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-09-26 08:14:42,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2018-09-26 08:14:42,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-09-26 08:14:42,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-09-26 08:14:42,583 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 238 [2018-09-26 08:14:42,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:42,583 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-09-26 08:14:42,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 238 states. [2018-09-26 08:14:42,583 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-09-26 08:14:42,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-09-26 08:14:42,584 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:42,584 INFO L375 BasicCegarLoop]: trace histogram [236, 1, 1, 1] [2018-09-26 08:14:42,584 INFO L423 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:42,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:42,584 INFO L82 PathProgramCache]: Analyzing trace with hash 484768897, now seen corresponding path program 236 times [2018-09-26 08:14:42,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:43,939 INFO L134 CoverageAnalysis]: Checked inductivity of 27966 backedges. 0 proven. 27966 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:43,940 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:43,940 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [238] total 238 [2018-09-26 08:14:43,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 239 states [2018-09-26 08:14:43,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 239 interpolants. [2018-09-26 08:14:43,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28441, Invalid=28441, Unknown=0, NotChecked=0, Total=56882 [2018-09-26 08:14:43,948 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 239 states. [2018-09-26 08:14:45,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:45,221 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-09-26 08:14:45,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 239 states. [2018-09-26 08:14:45,221 INFO L78 Accepts]: Start accepts. Automaton has 239 states. Word has length 239 [2018-09-26 08:14:45,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:45,221 INFO L225 Difference]: With dead ends: 243 [2018-09-26 08:14:45,222 INFO L226 Difference]: Without dead ends: 241 [2018-09-26 08:14:45,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=28441, Invalid=28441, Unknown=0, NotChecked=0, Total=56882 [2018-09-26 08:14:45,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-09-26 08:14:45,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-09-26 08:14:45,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-26 08:14:45,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-09-26 08:14:45,227 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 239 [2018-09-26 08:14:45,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:45,227 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-09-26 08:14:45,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 239 states. [2018-09-26 08:14:45,227 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-09-26 08:14:45,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-26 08:14:45,228 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:45,228 INFO L375 BasicCegarLoop]: trace histogram [237, 1, 1, 1] [2018-09-26 08:14:45,228 INFO L423 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:45,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:45,228 INFO L82 PathProgramCache]: Analyzing trace with hash 2142931944, now seen corresponding path program 237 times [2018-09-26 08:14:45,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 28203 backedges. 0 proven. 28203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:46,490 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:46,490 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [239] total 239 [2018-09-26 08:14:46,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 240 states [2018-09-26 08:14:46,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 240 interpolants. [2018-09-26 08:14:46,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28680, Invalid=28680, Unknown=0, NotChecked=0, Total=57360 [2018-09-26 08:14:46,497 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 240 states. [2018-09-26 08:14:47,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:47,464 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-09-26 08:14:47,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 240 states. [2018-09-26 08:14:47,465 INFO L78 Accepts]: Start accepts. Automaton has 240 states. Word has length 240 [2018-09-26 08:14:47,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:47,465 INFO L225 Difference]: With dead ends: 244 [2018-09-26 08:14:47,465 INFO L226 Difference]: Without dead ends: 242 [2018-09-26 08:14:47,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=28680, Invalid=28680, Unknown=0, NotChecked=0, Total=57360 [2018-09-26 08:14:47,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-09-26 08:14:47,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2018-09-26 08:14:47,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-09-26 08:14:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-09-26 08:14:47,471 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 240 [2018-09-26 08:14:47,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:47,471 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-09-26 08:14:47,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 240 states. [2018-09-26 08:14:47,471 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-09-26 08:14:47,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-09-26 08:14:47,471 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:47,472 INFO L375 BasicCegarLoop]: trace histogram [238, 1, 1, 1] [2018-09-26 08:14:47,472 INFO L423 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:47,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:47,472 INFO L82 PathProgramCache]: Analyzing trace with hash 2006378849, now seen corresponding path program 238 times [2018-09-26 08:14:47,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 28441 backedges. 0 proven. 28441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:48,867 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:48,867 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [240] total 240 [2018-09-26 08:14:48,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 241 states [2018-09-26 08:14:48,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 241 interpolants. [2018-09-26 08:14:48,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28920, Invalid=28920, Unknown=0, NotChecked=0, Total=57840 [2018-09-26 08:14:48,876 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 241 states. [2018-09-26 08:14:50,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:50,724 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-09-26 08:14:50,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2018-09-26 08:14:50,724 INFO L78 Accepts]: Start accepts. Automaton has 241 states. Word has length 241 [2018-09-26 08:14:50,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:50,725 INFO L225 Difference]: With dead ends: 245 [2018-09-26 08:14:50,725 INFO L226 Difference]: Without dead ends: 243 [2018-09-26 08:14:50,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=28920, Invalid=28920, Unknown=0, NotChecked=0, Total=57840 [2018-09-26 08:14:50,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-09-26 08:14:50,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-09-26 08:14:50,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-09-26 08:14:50,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-09-26 08:14:50,730 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 241 [2018-09-26 08:14:50,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:50,730 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-09-26 08:14:50,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 241 states. [2018-09-26 08:14:50,731 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-09-26 08:14:50,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-09-26 08:14:50,731 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:50,731 INFO L375 BasicCegarLoop]: trace histogram [239, 1, 1, 1] [2018-09-26 08:14:50,731 INFO L423 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:50,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:50,732 INFO L82 PathProgramCache]: Analyzing trace with hash 2068200200, now seen corresponding path program 239 times [2018-09-26 08:14:50,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:50,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:52,004 INFO L134 CoverageAnalysis]: Checked inductivity of 28680 backedges. 0 proven. 28680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:52,004 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:52,004 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [241] total 241 [2018-09-26 08:14:52,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 242 states [2018-09-26 08:14:52,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 242 interpolants. [2018-09-26 08:14:52,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29161, Invalid=29161, Unknown=0, NotChecked=0, Total=58322 [2018-09-26 08:14:52,011 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 242 states. [2018-09-26 08:14:53,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:53,581 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-09-26 08:14:53,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2018-09-26 08:14:53,581 INFO L78 Accepts]: Start accepts. Automaton has 242 states. Word has length 242 [2018-09-26 08:14:53,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:53,582 INFO L225 Difference]: With dead ends: 246 [2018-09-26 08:14:53,582 INFO L226 Difference]: Without dead ends: 244 [2018-09-26 08:14:53,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=29161, Invalid=29161, Unknown=0, NotChecked=0, Total=58322 [2018-09-26 08:14:53,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-09-26 08:14:53,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2018-09-26 08:14:53,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-09-26 08:14:53,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 244 transitions. [2018-09-26 08:14:53,588 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 244 transitions. Word has length 242 [2018-09-26 08:14:53,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:53,588 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 244 transitions. [2018-09-26 08:14:53,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 242 states. [2018-09-26 08:14:53,588 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 244 transitions. [2018-09-26 08:14:53,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-09-26 08:14:53,588 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:53,589 INFO L375 BasicCegarLoop]: trace histogram [240, 1, 1, 1] [2018-09-26 08:14:53,589 INFO L423 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:53,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:53,589 INFO L82 PathProgramCache]: Analyzing trace with hash -310305215, now seen corresponding path program 240 times [2018-09-26 08:14:53,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:55,003 INFO L134 CoverageAnalysis]: Checked inductivity of 28920 backedges. 0 proven. 28920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:55,003 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:55,003 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [242] total 242 [2018-09-26 08:14:55,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 243 states [2018-09-26 08:14:55,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 243 interpolants. [2018-09-26 08:14:55,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29403, Invalid=29403, Unknown=0, NotChecked=0, Total=58806 [2018-09-26 08:14:55,011 INFO L87 Difference]: Start difference. First operand 244 states and 244 transitions. Second operand 243 states. [2018-09-26 08:14:55,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:55,617 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-09-26 08:14:55,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2018-09-26 08:14:55,617 INFO L78 Accepts]: Start accepts. Automaton has 243 states. Word has length 243 [2018-09-26 08:14:55,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:55,617 INFO L225 Difference]: With dead ends: 247 [2018-09-26 08:14:55,617 INFO L226 Difference]: Without dead ends: 245 [2018-09-26 08:14:55,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=29403, Invalid=29403, Unknown=0, NotChecked=0, Total=58806 [2018-09-26 08:14:55,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-09-26 08:14:55,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-09-26 08:14:55,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-26 08:14:55,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-09-26 08:14:55,623 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 243 [2018-09-26 08:14:55,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:55,623 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-09-26 08:14:55,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 243 states. [2018-09-26 08:14:55,623 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-09-26 08:14:55,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-26 08:14:55,624 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:55,624 INFO L375 BasicCegarLoop]: trace histogram [241, 1, 1, 1] [2018-09-26 08:14:55,624 INFO L423 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:55,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:55,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1029529048, now seen corresponding path program 241 times [2018-09-26 08:14:55,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:14:56,894 INFO L134 CoverageAnalysis]: Checked inductivity of 29161 backedges. 0 proven. 29161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:14:56,895 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:14:56,895 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [243] total 243 [2018-09-26 08:14:56,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 244 states [2018-09-26 08:14:56,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 244 interpolants. [2018-09-26 08:14:56,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29646, Invalid=29646, Unknown=0, NotChecked=0, Total=59292 [2018-09-26 08:14:56,901 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 244 states. [2018-09-26 08:14:59,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:14:59,105 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-09-26 08:14:59,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2018-09-26 08:14:59,105 INFO L78 Accepts]: Start accepts. Automaton has 244 states. Word has length 244 [2018-09-26 08:14:59,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:14:59,106 INFO L225 Difference]: With dead ends: 248 [2018-09-26 08:14:59,106 INFO L226 Difference]: Without dead ends: 246 [2018-09-26 08:14:59,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=29646, Invalid=29646, Unknown=0, NotChecked=0, Total=59292 [2018-09-26 08:14:59,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-09-26 08:14:59,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2018-09-26 08:14:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-09-26 08:14:59,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-09-26 08:14:59,113 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 244 [2018-09-26 08:14:59,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:14:59,113 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-09-26 08:14:59,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 244 states. [2018-09-26 08:14:59,113 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-09-26 08:14:59,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-09-26 08:14:59,114 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:14:59,114 INFO L375 BasicCegarLoop]: trace histogram [242, 1, 1, 1] [2018-09-26 08:14:59,114 INFO L423 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:14:59,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:14:59,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1850631391, now seen corresponding path program 242 times [2018-09-26 08:14:59,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:14:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 29403 backedges. 0 proven. 29403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:00,711 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:00,711 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [244] total 244 [2018-09-26 08:15:00,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 245 states [2018-09-26 08:15:00,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 245 interpolants. [2018-09-26 08:15:00,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29890, Invalid=29890, Unknown=0, NotChecked=0, Total=59780 [2018-09-26 08:15:00,719 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 245 states. [2018-09-26 08:15:03,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:03,042 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-09-26 08:15:03,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 245 states. [2018-09-26 08:15:03,042 INFO L78 Accepts]: Start accepts. Automaton has 245 states. Word has length 245 [2018-09-26 08:15:03,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:03,043 INFO L225 Difference]: With dead ends: 249 [2018-09-26 08:15:03,043 INFO L226 Difference]: Without dead ends: 247 [2018-09-26 08:15:03,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=29890, Invalid=29890, Unknown=0, NotChecked=0, Total=59780 [2018-09-26 08:15:03,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-09-26 08:15:03,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-09-26 08:15:03,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-09-26 08:15:03,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-09-26 08:15:03,050 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 245 [2018-09-26 08:15:03,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:03,050 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-09-26 08:15:03,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 245 states. [2018-09-26 08:15:03,050 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-09-26 08:15:03,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-09-26 08:15:03,051 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:03,051 INFO L375 BasicCegarLoop]: trace histogram [243, 1, 1, 1] [2018-09-26 08:15:03,051 INFO L423 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:03,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:03,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1535000248, now seen corresponding path program 243 times [2018-09-26 08:15:03,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 29646 backedges. 0 proven. 29646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:04,451 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:04,451 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [245] total 245 [2018-09-26 08:15:04,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 246 states [2018-09-26 08:15:04,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 246 interpolants. [2018-09-26 08:15:04,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30135, Invalid=30135, Unknown=0, NotChecked=0, Total=60270 [2018-09-26 08:15:04,457 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 246 states. [2018-09-26 08:15:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:06,538 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-09-26 08:15:06,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 246 states. [2018-09-26 08:15:06,538 INFO L78 Accepts]: Start accepts. Automaton has 246 states. Word has length 246 [2018-09-26 08:15:06,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:06,539 INFO L225 Difference]: With dead ends: 250 [2018-09-26 08:15:06,539 INFO L226 Difference]: Without dead ends: 248 [2018-09-26 08:15:06,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=30135, Invalid=30135, Unknown=0, NotChecked=0, Total=60270 [2018-09-26 08:15:06,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-09-26 08:15:06,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-09-26 08:15:06,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-09-26 08:15:06,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-09-26 08:15:06,544 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 246 [2018-09-26 08:15:06,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:06,544 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-09-26 08:15:06,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 246 states. [2018-09-26 08:15:06,544 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-09-26 08:15:06,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-09-26 08:15:06,545 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:06,545 INFO L375 BasicCegarLoop]: trace histogram [244, 1, 1, 1] [2018-09-26 08:15:06,545 INFO L423 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:06,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:06,545 INFO L82 PathProgramCache]: Analyzing trace with hash -340369407, now seen corresponding path program 244 times [2018-09-26 08:15:06,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 29890 backedges. 0 proven. 29890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:08,019 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:08,019 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [246] total 246 [2018-09-26 08:15:08,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 247 states [2018-09-26 08:15:08,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 247 interpolants. [2018-09-26 08:15:08,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30381, Invalid=30381, Unknown=0, NotChecked=0, Total=60762 [2018-09-26 08:15:08,026 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 247 states. [2018-09-26 08:15:09,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:09,920 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-09-26 08:15:09,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2018-09-26 08:15:09,920 INFO L78 Accepts]: Start accepts. Automaton has 247 states. Word has length 247 [2018-09-26 08:15:09,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:09,921 INFO L225 Difference]: With dead ends: 251 [2018-09-26 08:15:09,921 INFO L226 Difference]: Without dead ends: 249 [2018-09-26 08:15:09,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=30381, Invalid=30381, Unknown=0, NotChecked=0, Total=60762 [2018-09-26 08:15:09,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-09-26 08:15:09,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-09-26 08:15:09,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-09-26 08:15:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-09-26 08:15:09,927 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 247 [2018-09-26 08:15:09,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:09,927 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-09-26 08:15:09,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 247 states. [2018-09-26 08:15:09,927 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-09-26 08:15:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-09-26 08:15:09,928 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:09,928 INFO L375 BasicCegarLoop]: trace histogram [245, 1, 1, 1] [2018-09-26 08:15:09,928 INFO L423 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:09,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:09,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1961519000, now seen corresponding path program 245 times [2018-09-26 08:15:09,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:11,335 INFO L134 CoverageAnalysis]: Checked inductivity of 30135 backedges. 0 proven. 30135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:11,335 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:11,335 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [247] total 247 [2018-09-26 08:15:11,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 248 states [2018-09-26 08:15:11,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 248 interpolants. [2018-09-26 08:15:11,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30628, Invalid=30628, Unknown=0, NotChecked=0, Total=61256 [2018-09-26 08:15:11,342 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 248 states. [2018-09-26 08:15:12,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:12,425 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2018-09-26 08:15:12,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 248 states. [2018-09-26 08:15:12,425 INFO L78 Accepts]: Start accepts. Automaton has 248 states. Word has length 248 [2018-09-26 08:15:12,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:12,425 INFO L225 Difference]: With dead ends: 252 [2018-09-26 08:15:12,426 INFO L226 Difference]: Without dead ends: 250 [2018-09-26 08:15:12,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=30628, Invalid=30628, Unknown=0, NotChecked=0, Total=61256 [2018-09-26 08:15:12,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-09-26 08:15:12,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2018-09-26 08:15:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-09-26 08:15:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2018-09-26 08:15:12,431 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 248 [2018-09-26 08:15:12,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:12,431 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2018-09-26 08:15:12,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 248 states. [2018-09-26 08:15:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2018-09-26 08:15:12,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-09-26 08:15:12,432 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:12,432 INFO L375 BasicCegarLoop]: trace histogram [246, 1, 1, 1] [2018-09-26 08:15:12,432 INFO L423 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:12,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:12,432 INFO L82 PathProgramCache]: Analyzing trace with hash -677548831, now seen corresponding path program 246 times [2018-09-26 08:15:12,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:14,014 INFO L134 CoverageAnalysis]: Checked inductivity of 30381 backedges. 0 proven. 30381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:14,014 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:14,014 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [248] total 248 [2018-09-26 08:15:14,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 249 states [2018-09-26 08:15:14,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 249 interpolants. [2018-09-26 08:15:14,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30876, Invalid=30876, Unknown=0, NotChecked=0, Total=61752 [2018-09-26 08:15:14,021 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 249 states. [2018-09-26 08:15:15,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:15,667 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-09-26 08:15:15,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 249 states. [2018-09-26 08:15:15,667 INFO L78 Accepts]: Start accepts. Automaton has 249 states. Word has length 249 [2018-09-26 08:15:15,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:15,667 INFO L225 Difference]: With dead ends: 253 [2018-09-26 08:15:15,667 INFO L226 Difference]: Without dead ends: 251 [2018-09-26 08:15:15,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=30876, Invalid=30876, Unknown=0, NotChecked=0, Total=61752 [2018-09-26 08:15:15,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-09-26 08:15:15,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-09-26 08:15:15,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-26 08:15:15,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-09-26 08:15:15,674 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 249 [2018-09-26 08:15:15,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:15,675 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-09-26 08:15:15,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 249 states. [2018-09-26 08:15:15,675 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-09-26 08:15:15,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-26 08:15:15,675 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:15,675 INFO L375 BasicCegarLoop]: trace histogram [247, 1, 1, 1] [2018-09-26 08:15:15,676 INFO L423 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:15,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:15,676 INFO L82 PathProgramCache]: Analyzing trace with hash 470820744, now seen corresponding path program 247 times [2018-09-26 08:15:15,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 30628 backedges. 0 proven. 30628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:17,106 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:17,106 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [249] total 249 [2018-09-26 08:15:17,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 250 states [2018-09-26 08:15:17,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 250 interpolants. [2018-09-26 08:15:17,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31125, Invalid=31125, Unknown=0, NotChecked=0, Total=62250 [2018-09-26 08:15:17,113 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 250 states. [2018-09-26 08:15:17,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:17,810 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2018-09-26 08:15:17,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 250 states. [2018-09-26 08:15:17,810 INFO L78 Accepts]: Start accepts. Automaton has 250 states. Word has length 250 [2018-09-26 08:15:17,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:17,811 INFO L225 Difference]: With dead ends: 254 [2018-09-26 08:15:17,811 INFO L226 Difference]: Without dead ends: 252 [2018-09-26 08:15:17,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=31125, Invalid=31125, Unknown=0, NotChecked=0, Total=62250 [2018-09-26 08:15:17,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-09-26 08:15:17,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2018-09-26 08:15:17,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-09-26 08:15:17,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2018-09-26 08:15:17,817 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 250 [2018-09-26 08:15:17,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:17,818 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2018-09-26 08:15:17,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 250 states. [2018-09-26 08:15:17,818 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2018-09-26 08:15:17,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-09-26 08:15:17,818 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:17,819 INFO L375 BasicCegarLoop]: trace histogram [248, 1, 1, 1] [2018-09-26 08:15:17,819 INFO L423 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:17,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:17,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1710539201, now seen corresponding path program 248 times [2018-09-26 08:15:17,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:19,378 INFO L134 CoverageAnalysis]: Checked inductivity of 30876 backedges. 0 proven. 30876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:19,378 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:19,378 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [250] total 250 [2018-09-26 08:15:19,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 251 states [2018-09-26 08:15:19,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 251 interpolants. [2018-09-26 08:15:19,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31375, Invalid=31375, Unknown=0, NotChecked=0, Total=62750 [2018-09-26 08:15:19,386 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 251 states. [2018-09-26 08:15:21,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:21,311 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-09-26 08:15:21,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 251 states. [2018-09-26 08:15:21,311 INFO L78 Accepts]: Start accepts. Automaton has 251 states. Word has length 251 [2018-09-26 08:15:21,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:21,311 INFO L225 Difference]: With dead ends: 255 [2018-09-26 08:15:21,311 INFO L226 Difference]: Without dead ends: 253 [2018-09-26 08:15:21,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=31375, Invalid=31375, Unknown=0, NotChecked=0, Total=62750 [2018-09-26 08:15:21,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-09-26 08:15:21,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-09-26 08:15:21,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-09-26 08:15:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-09-26 08:15:21,317 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 251 [2018-09-26 08:15:21,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:21,318 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-09-26 08:15:21,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 251 states. [2018-09-26 08:15:21,318 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-09-26 08:15:21,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-09-26 08:15:21,318 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:21,318 INFO L375 BasicCegarLoop]: trace histogram [249, 1, 1, 1] [2018-09-26 08:15:21,319 INFO L423 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:21,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:21,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1487105704, now seen corresponding path program 249 times [2018-09-26 08:15:21,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:22,908 INFO L134 CoverageAnalysis]: Checked inductivity of 31125 backedges. 0 proven. 31125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:22,908 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:22,908 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [251] total 251 [2018-09-26 08:15:22,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 252 states [2018-09-26 08:15:22,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 252 interpolants. [2018-09-26 08:15:22,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31626, Invalid=31626, Unknown=0, NotChecked=0, Total=63252 [2018-09-26 08:15:22,917 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 252 states. [2018-09-26 08:15:23,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:23,708 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-09-26 08:15:23,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 252 states. [2018-09-26 08:15:23,708 INFO L78 Accepts]: Start accepts. Automaton has 252 states. Word has length 252 [2018-09-26 08:15:23,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:23,709 INFO L225 Difference]: With dead ends: 256 [2018-09-26 08:15:23,709 INFO L226 Difference]: Without dead ends: 254 [2018-09-26 08:15:23,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=31626, Invalid=31626, Unknown=0, NotChecked=0, Total=63252 [2018-09-26 08:15:23,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-09-26 08:15:23,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2018-09-26 08:15:23,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-09-26 08:15:23,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2018-09-26 08:15:23,717 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 252 [2018-09-26 08:15:23,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:23,717 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2018-09-26 08:15:23,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 252 states. [2018-09-26 08:15:23,717 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2018-09-26 08:15:23,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-09-26 08:15:23,718 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:23,718 INFO L375 BasicCegarLoop]: trace histogram [250, 1, 1, 1] [2018-09-26 08:15:23,718 INFO L423 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:23,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:23,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1144365407, now seen corresponding path program 250 times [2018-09-26 08:15:23,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 31375 backedges. 0 proven. 31375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:25,274 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:25,274 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [252] total 252 [2018-09-26 08:15:25,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 253 states [2018-09-26 08:15:25,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 253 interpolants. [2018-09-26 08:15:25,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31878, Invalid=31878, Unknown=0, NotChecked=0, Total=63756 [2018-09-26 08:15:25,282 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 253 states. [2018-09-26 08:15:27,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:27,488 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-09-26 08:15:27,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 253 states. [2018-09-26 08:15:27,488 INFO L78 Accepts]: Start accepts. Automaton has 253 states. Word has length 253 [2018-09-26 08:15:27,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:27,488 INFO L225 Difference]: With dead ends: 257 [2018-09-26 08:15:27,489 INFO L226 Difference]: Without dead ends: 255 [2018-09-26 08:15:27,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=31878, Invalid=31878, Unknown=0, NotChecked=0, Total=63756 [2018-09-26 08:15:27,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-09-26 08:15:27,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-09-26 08:15:27,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-09-26 08:15:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-09-26 08:15:27,492 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 253 [2018-09-26 08:15:27,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:27,492 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-09-26 08:15:27,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 253 states. [2018-09-26 08:15:27,493 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-09-26 08:15:27,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-09-26 08:15:27,493 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:27,493 INFO L375 BasicCegarLoop]: trace histogram [251, 1, 1, 1] [2018-09-26 08:15:27,493 INFO L423 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:27,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:27,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1115591224, now seen corresponding path program 251 times [2018-09-26 08:15:27,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:29,101 INFO L134 CoverageAnalysis]: Checked inductivity of 31626 backedges. 0 proven. 31626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:29,101 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:29,102 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [253] total 253 [2018-09-26 08:15:29,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 254 states [2018-09-26 08:15:29,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 254 interpolants. [2018-09-26 08:15:29,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32131, Invalid=32131, Unknown=0, NotChecked=0, Total=64262 [2018-09-26 08:15:29,109 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 254 states. [2018-09-26 08:15:30,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:30,088 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-09-26 08:15:30,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 254 states. [2018-09-26 08:15:30,089 INFO L78 Accepts]: Start accepts. Automaton has 254 states. Word has length 254 [2018-09-26 08:15:30,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:30,090 INFO L225 Difference]: With dead ends: 258 [2018-09-26 08:15:30,090 INFO L226 Difference]: Without dead ends: 256 [2018-09-26 08:15:30,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=32131, Invalid=32131, Unknown=0, NotChecked=0, Total=64262 [2018-09-26 08:15:30,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-09-26 08:15:30,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2018-09-26 08:15:30,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-09-26 08:15:30,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2018-09-26 08:15:30,097 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 254 [2018-09-26 08:15:30,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:30,098 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2018-09-26 08:15:30,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 254 states. [2018-09-26 08:15:30,098 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2018-09-26 08:15:30,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-09-26 08:15:30,099 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:30,099 INFO L375 BasicCegarLoop]: trace histogram [252, 1, 1, 1] [2018-09-26 08:15:30,099 INFO L423 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:30,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:30,100 INFO L82 PathProgramCache]: Analyzing trace with hash -223591551, now seen corresponding path program 252 times [2018-09-26 08:15:30,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:31,822 INFO L134 CoverageAnalysis]: Checked inductivity of 31878 backedges. 0 proven. 31878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:31,822 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:31,822 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [254] total 254 [2018-09-26 08:15:31,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 255 states [2018-09-26 08:15:31,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 255 interpolants. [2018-09-26 08:15:31,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32385, Invalid=32385, Unknown=0, NotChecked=0, Total=64770 [2018-09-26 08:15:31,826 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 255 states. [2018-09-26 08:15:34,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:34,085 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-09-26 08:15:34,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 255 states. [2018-09-26 08:15:34,086 INFO L78 Accepts]: Start accepts. Automaton has 255 states. Word has length 255 [2018-09-26 08:15:34,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:34,086 INFO L225 Difference]: With dead ends: 259 [2018-09-26 08:15:34,086 INFO L226 Difference]: Without dead ends: 257 [2018-09-26 08:15:34,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=32385, Invalid=32385, Unknown=0, NotChecked=0, Total=64770 [2018-09-26 08:15:34,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-09-26 08:15:34,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-09-26 08:15:34,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-26 08:15:34,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-09-26 08:15:34,090 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 255 [2018-09-26 08:15:34,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:34,091 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-09-26 08:15:34,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 255 states. [2018-09-26 08:15:34,091 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-09-26 08:15:34,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-26 08:15:34,091 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:34,092 INFO L375 BasicCegarLoop]: trace histogram [253, 1, 1, 1] [2018-09-26 08:15:34,092 INFO L423 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:34,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:34,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1658594536, now seen corresponding path program 253 times [2018-09-26 08:15:34,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:35,642 INFO L134 CoverageAnalysis]: Checked inductivity of 32131 backedges. 0 proven. 32131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:35,642 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:35,642 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [255] total 255 [2018-09-26 08:15:35,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 256 states [2018-09-26 08:15:35,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 256 interpolants. [2018-09-26 08:15:35,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32640, Invalid=32640, Unknown=0, NotChecked=0, Total=65280 [2018-09-26 08:15:35,652 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 256 states. [2018-09-26 08:15:36,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:36,520 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-09-26 08:15:36,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 256 states. [2018-09-26 08:15:36,521 INFO L78 Accepts]: Start accepts. Automaton has 256 states. Word has length 256 [2018-09-26 08:15:36,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:36,521 INFO L225 Difference]: With dead ends: 260 [2018-09-26 08:15:36,521 INFO L226 Difference]: Without dead ends: 258 [2018-09-26 08:15:36,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=32640, Invalid=32640, Unknown=0, NotChecked=0, Total=65280 [2018-09-26 08:15:36,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-09-26 08:15:36,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2018-09-26 08:15:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-09-26 08:15:36,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 258 transitions. [2018-09-26 08:15:36,529 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 258 transitions. Word has length 256 [2018-09-26 08:15:36,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:36,529 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 258 transitions. [2018-09-26 08:15:36,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 256 states. [2018-09-26 08:15:36,529 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 258 transitions. [2018-09-26 08:15:36,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-09-26 08:15:36,530 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:36,530 INFO L375 BasicCegarLoop]: trace histogram [254, 1, 1, 1] [2018-09-26 08:15:36,530 INFO L423 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:36,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:36,530 INFO L82 PathProgramCache]: Analyzing trace with hash -123178911, now seen corresponding path program 254 times [2018-09-26 08:15:36,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 32385 backedges. 0 proven. 32385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:38,173 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:38,173 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [256] total 256 [2018-09-26 08:15:38,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 257 states [2018-09-26 08:15:38,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 257 interpolants. [2018-09-26 08:15:38,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32896, Invalid=32896, Unknown=0, NotChecked=0, Total=65792 [2018-09-26 08:15:38,177 INFO L87 Difference]: Start difference. First operand 258 states and 258 transitions. Second operand 257 states. [2018-09-26 08:15:40,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:15:40,120 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-09-26 08:15:40,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 257 states. [2018-09-26 08:15:40,120 INFO L78 Accepts]: Start accepts. Automaton has 257 states. Word has length 257 [2018-09-26 08:15:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:15:40,121 INFO L225 Difference]: With dead ends: 261 [2018-09-26 08:15:40,121 INFO L226 Difference]: Without dead ends: 259 [2018-09-26 08:15:40,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=32896, Invalid=32896, Unknown=0, NotChecked=0, Total=65792 [2018-09-26 08:15:40,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-09-26 08:15:40,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-09-26 08:15:40,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-09-26 08:15:40,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-09-26 08:15:40,125 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 257 [2018-09-26 08:15:40,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:15:40,126 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-09-26 08:15:40,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 257 states. [2018-09-26 08:15:40,126 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-09-26 08:15:40,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-09-26 08:15:40,127 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:15:40,127 INFO L375 BasicCegarLoop]: trace histogram [255, 1, 1, 1] [2018-09-26 08:15:40,127 INFO L423 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:15:40,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:15:40,128 INFO L82 PathProgramCache]: Analyzing trace with hash 476419080, now seen corresponding path program 255 times [2018-09-26 08:15:40,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:15:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:15:41,706 INFO L134 CoverageAnalysis]: Checked inductivity of 32640 backedges. 0 proven. 32640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:15:41,707 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:15:41,707 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [257] total 257 [2018-09-26 08:15:41,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 258 states [2018-09-26 08:15:41,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 258 interpolants. [2018-09-26 08:15:41,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33153, Invalid=33153, Unknown=0, NotChecked=0, Total=66306 [2018-09-26 08:15:41,716 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 258 states. Received shutdown request... [2018-09-26 08:15:42,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-09-26 08:15:42,040 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:15:42,046 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:15:42,047 INFO L202 PluginConnector]: Adding new model overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:15:42 BoogieIcfgContainer [2018-09-26 08:15:42,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:15:42,048 INFO L168 Benchmark]: Toolchain (without parser) took 257398.91 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -23.1 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-09-26 08:15:42,049 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:15:42,049 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.20 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:15:42,050 INFO L168 Benchmark]: Boogie Preprocessor took 19.34 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:15:42,050 INFO L168 Benchmark]: RCFGBuilder took 216.36 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:15:42,050 INFO L168 Benchmark]: TraceAbstraction took 257117.03 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -33.6 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-09-26 08:15:42,052 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 40.20 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 19.34 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 216.36 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 257117.03 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -33.6 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 31). Cancelled while BasicCegarLoop was constructing difference of abstraction (259states) and FLOYD_HOARE automaton (currently 125 states, 258 states before enhancement), while ReachableStatesComputation was computing reachable states (123 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 257.0s OverallTime, 256 OverallIterations, 255 TraceHistogramMax, 107.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 766 SDtfs, 0 SDslu, 16818 SDs, 0 SdLazy, 49836 SolverSat, 489 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33152 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 32896 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 130.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=259occurred in iteration=255, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 255 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 139.5s InterpolantComputationTime, 33408 NumberOfCodeBlocks, 33408 NumberOfCodeBlocksAsserted, 256 NumberOfCheckSat, 33152 ConstructedInterpolants, 0 QuantifiedInterpolants, 17007488 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 256 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2796160 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/overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-15-42-062.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-15-42-062.csv Completed graceful shutdown